English
Related papers

Related papers: Introducing irrational enumeration: analytic combi…

200 papers

This paper considers a probabilistic-analytical approach to determining asymptotics of prime objects on the initial interval of the natural series. The author proposes a new method based on the construction of a probability space. An…

Number Theory · Mathematics 2025-04-01 Victor Volfson

Using an application of Schmidt's Subspace Theorem, this paper gives new transcendence criteria for rapidly converging infinite products of algebraic numbers. The paper also improves existing criteria for irrationality of products and…

Number Theory · Mathematics 2025-03-04 Mathias L. Laursen

Studying Birkhoff sums of non-integrable functions involves the challenge of large observations depending on the sampled orbit, which prevents pointwise limit theorems. To address this issue, the largest observations are removed, this…

Dynamical Systems · Mathematics 2025-03-31 Max Auer , Tanja I. Schindler

Let $\cal R$ be either the Grothendieck semiring (semiring with multiplication) of complex algebraic varieties, or the Grothendieck ring of these varieties, or the Grothendieck ring localized by the class of the complex affine line. We…

Algebraic Geometry · Mathematics 2007-05-23 S. M. Gusein-Zade , I. Luengo , A. Melle-Hernandez

We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method,…

Combinatorics · Mathematics 2016-03-01 Stephen Melczer , Mark C. Wilson

We investigate the asymptotic number of elements of size $n$ in a particular class of closed lambda-terms (so-called $BCI(p)$-terms) which are related to axiom systems of combinatory logic. By deriving a differential equation for the…

Combinatorics · Mathematics 2013-05-06 Olivier Bodini , Danièle Gardy , Bernhard Gittenberger , Alice Jacquot

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

Probability · Mathematics 2021-12-22 Jacopo Borga

A ``hybrid method'', dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singularity analysis theory. This hybrid method applies to functions that remain of…

Combinatorics · Mathematics 2007-05-23 Philippe Flajolet , Eric Fusy , Xavier Gourdon , Daniel Panario , Nicolas Pouyanne

Among all sequences that satisfy a divide-and-conquer recurrence, the sequences that are rational with respect to a numeration system are certainly the most immediate and most essential. Nevertheless, until recently they have not been…

Computational Complexity · Computer Science 2013-07-02 Philippe Dumas

The perturbation expansion of the solution of a fixed point equation or of an ordinary differential equation may be expressed as a power series in the perturbation parameter. The terms in this series are indexed by rooted trees and depend…

Combinatorics · Mathematics 2021-03-30 William G. Faris

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Combinatorics · Mathematics 2012-06-26 Robert S. Coulter , Todd Gutekunst

The enumeration of planar maps equipped with an Eulerian orientation has attracted attention in both combinatorics and theoretical physics since at least 2000. The case of 4-valent maps is particularly interesting: these orientations are in…

Combinatorics · Mathematics 2024-09-16 Mireille Bousquet-Mélou , Andrew Elvey Price

It is an observation of Kontsevich and Soibelman that generating series that produce certain (generalized) Donaldson Thomas invariants are secretly algebraic functions over the rationals. From a physical perspective this observation arises…

High Energy Physics - Theory · Physics 2016-06-09 Tom Mainiero

This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…

Logic in Computer Science · Computer Science 2019-01-18 Ziyuan Gao , Sanjay Jain , Bakhadyr Khoussainov , Wei Li , Alexander Melnikov , Karen Seidel , Frank Stephan

We consider weighted small step walks in the positive quadrant, and provide algebraicity and differential transcendence results for the underlying generating functions: we prove that depending on the probabilities of allowed steps, certain…

Combinatorics · Mathematics 2021-08-25 Thomas Dreyfus , Kilian Raschel

We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. The construction involves an iteration procedure on an infinite-dimensional…

Dynamical Systems · Mathematics 2025-07-29 Konstantin Bogdanov

In this paper we study the satisfiability and solutions of group equations when combinatorial, algebraic and language-theoretic constraints are imposed on the solutions. We show that the solutions to equations with length, lexicographic…

Group Theory · Mathematics 2024-03-29 Laura Ciobanu , Alex Evetts , Alex Levine

We construct vertex transitive lattices on products of trees of arbitrary dimension $d \geq 1$ based on quaternion algebras over global fields with exactly two ramified places. Starting from arithmetic examples, we find non-residually…

Group Theory · Mathematics 2019-10-22 Nithi Rungtanapirom , Jakob Stix , Alina Vdovina

Prudent walks are special self-avoiding walks that never take a step towards an already occupied site, and \emph{$k$-sided prudent walks} (with $k=1,2,3,4$) are, in essence, only allowed to grow along $k$ directions. Prudent polygons are…

Combinatorics · Mathematics 2021-12-20 Nicholas R. Beaton , Philippe Flajolet , Anthony J. Guttmann

We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…

Number Theory · Mathematics 2019-08-21 Stella Brassesco , Arnaud Meyroneinc
‹ Prev 1 3 4 5 6 7 10 Next ›