Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/9502219

The iterated logarithmic algebra

Daniel E. Loeb
View original source ↗Read source document ↗Export metadata ↓

Abstract

We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms and x to an arbitrary real power. Using a theory of formal power series with real exponents, and a more general definition of factorial, binomial coefficient, and Stirling numbers to all the real numbers, we define the Iterated Logarithmic Algebra I. Its elements are the formal representations of the asymptotic expansions of a large class of real functions, and we define the harmonic logarithm basis of I which will be interpreted as a generalization of the powers x^n since it behaves nicely with respect to the derivative We classify all operators over I which commute with the derivative (classically these are known as shift-invariant operators), and formulate several equivalent definitions of a sequence of binomial type. We then derive many formulas useful towards the calculation of these sequences including the Recurrence Formula, the Transfer Formula, and the Lagrange Inversion Formula. Finally, we study Sheffer sequences, and give many examples.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel E. Loeb. 1995-02-09. The iterated logarithmic algebra. https://arxiv.org/abs/math/9502219

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗