Related papers: Growth problems in diagram categories
This paper is concerned with asymptotic behavior of a variety of functionals of increments of continuous semimartingales. Sampling times are assumed to follow a rather general discretization scheme. If an underlying semimartingale is…
Most machine learning models for structured data encode the structural knowledge of a node by leveraging simple aggregation functions (in neural models, typically a weighted sum) of the information in the node's neighbourhood. Nevertheless,…
Structural properties of large random maps and lambda-terms may be gleaned by studying the limit distributions of various parameters of interest. In our work we focus on restricted classes of maps and their counterparts in the…
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…
We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…
Sums over inverse s-th powers of semiprimes and k-almost primes are transformed into sums over products of powers of ordinary prime zeta functions. Multinomial coefficients known from the cycle decomposition of permutation groups play the…
We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…
We investigate one-dimensional families of diagonal forms, considering the evolution of the asymptotic formula and error term. We then discuss properties of the average asymptotic formula obtained. The subsequent second moment analysis…
We investigate depoissonization, the problem of recovering asymptotics of sequence coefficients from their exponential generating function. Classical approaches rely on complex-analytic growth conditions, but here we develop real-variable…
In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with $n$ leaves has the factor $n^{2n}$ in its main asymptotic growth term. In this paper, we improve this by completely identifying the…
In the previous paper arxiv:math/0610552 semisimple tensor categories were constructed out of certain regular Mal'cev categories. In this paper, we calculate the tensor product multiplicities and the categorical dimensions of the simple…
We investigate lattice-counting problems associated with symplectic forms from the perspective of homogeneous dynamics. In the qualitative direction, we establish an analog of Margulis theorem for symplectic forms, proving density results…
A semilinear reaction-diffusion two-point boundary value problem, whose second-order derivative is multiplied by a small positive parameter $\eps^2$, is considered. It can have multiple solutions. An asymptotic expansion is constructed for…
The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…
This article answers the question of V.M. Buchstaber about the growth function of a particular $n$-valued group. This question is closely related to discrete integrable systems. In this paper, we will find a formula for the growth function…
We bound the tensor ranks of elementary symmetric polynomials, and we give explicit decompositions into powers of linear forms. The bound is attained when the degree is odd.
We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…
A permutation is centrosymmetric if it is fixed by a half-turn rotation of its diagram. Initially motivated by a question by Alexander Woo, we investigate the question of whether the growth rate of a permutation class equals the growth rate…
Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…
Duplication graphs are graphs that grow by duplication of existing vertices, and are important models of biological networks, including protein-protein interaction networks and gene regulatory networks. Three models of graph growth are…