Related papers: Introducing irrational enumeration: analytic combi…

In this paper, we establish the irrationality of some open problems in mathematics based on using a recursive formula that generate the complete sequence of numbers. see [1] But before getting into that we begin with some Ramanujan notable…

We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…

The computation of observables in general interacting theories, be them quantum mechanical, field, gauge or string theories, is a non-trivial problem which in many cases can only be addressed by resorting to perturbative methods. In most…

In this paper we give an attempt to extend some arithmetic properties such as multiplicativity, convolution products to the setting of operators theory. We provide a significant examples which are of interest in number theory. We also give…

We study the probabilistic behaviour of the continued fraction expansion of a quadratic irrational number, when weighted by some "additive" cost. We prove asymptotic Gaussian limit laws, with an optimal speed of convergence. We deal with…

We study the ring of arithmetical functions with unitary convolution, giving an isomorphism to a generalized power series ring on infinitely many variables, similar to the isomorphism of Cashwell-Everett between the ring of arithmetical…

We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…

We completely generalize previous results related to the counting of connected Feynman diagrams. We use a generating function approach, which encodes the Wick contraction combinatorics of the respective connected diagrams. Exact solutions…

In this paper we propose a method for proving some exponential inequalities based on power series expansion and analysis of derivations of the corresponding functions. Our approach provides a simple proof and generates a new class of…

A commutative semigroup of abstract factorials is defined in the context of the ring of integers. We study such factorials for their own sake, whether they are or are not connected to sets of integers. Given a subset X of the positive…

We study Dirichlet series enumerating orbits of Cartesian products of maps whose orbit distributions are modelled on the distributions of finite index subgroups of free abelian groups of finite rank. We interpret Euler factors of such orbit…

We define an extension of the Ramanujan trigonometric function to arbitrary dimensions, and give the Dirichlet series generating function. The extension was first given by Eckford Cohen long ago. This links directly to visible point vector…

Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…

Sequences that are defined by multisums of hypergeometric terms with compact support occur frequently in enumeration problems of combinatorics, algebraic geometry and perturbative quantum field theory. The standard recipe to study the…

This is an anthology of series involving rational, factorial, and power functions expressed in terms of special functions. New finite expansions involving quotient functions expressed in terms of the Hurwitz-Lerch zeta function are given.…

The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…

We present a unified algebraic framework utilizing the formal Bell transform to bridge the Dirichlet convolution of arithmetic functions with the combinatorial structure of infinite Euler-type products. By analyzing the logarithmic…

In this article we tackle the combinatorics of coloured hard-dimer objects. This is achieved by identifying coloured hard-dimer configurations with a certain class of rooted trees that allow for an algebraic treatment in terms of…

We showed that isomorphism classes of idempotent evolution algebras are in bijection with the orbits of the semidirect product group of the symmetric group and the torus, considered the combinatoric problem of enumeration of isomorphism…

We study the asymptotic size of decompositions of tensor powers of tilting modules for quantum groups (mostly at a complex root of unity). In type A1 we obtain a sharp result for the number of indecomposable summands, explained by a one…