相关论文: The asymptotic number of binary codes and binary m…
In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
Current performance bounds for randomized iterative methods are often considered tight under per-iteration analyses, yet they are notoriously loose in practice. We derive asymptotic performance bounds that narrow this theory-practice gap,…
In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…
The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…
We discuss the relationship between ratio asymptotics for general orthogonal polynomials and the asymptotics of the associated Bergman shift operator. More specifically, we consider the case in which a measure is supported on an infinite…
We give a uniform asymptotic bound for the number of zeros of complete Abelian integrals in domains bounded away from infinity and the singularities.
A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial…
We give a characterization of the internally 4-connected binary matroids that have no minor isomorphic to M(K3,3). Any such matroid is either cographic, or is isomorphic to a particular single-element extension of the bond matroid of a…
We give explicit formulas for the asymptotic growth rate of the number of summands in tensor powers in certain monoidal categories with finitely many indecomposable objects, and related structures.
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
Ratio asymptotics for matrix orthogonal polynomials with recurrence coefficients $A_n$ and $B_n$ having limits $A$ and $B$ respectively (the matrix Nevai class) were obtained by Dur\'an. In the present paper we obtain an alternative…
We obtain large n asymptotics for products of powers of the absolute values of the characteristic polynomials in the Gaussian Unitary Ensemble of n\times n matrices. Our results can also be interpreted as asymptotics of the determinant of a…
We derive asymptotic formulae for the coefficients of bivariate generating functions with algebraic and logarithmic factors. Logarithms appear when encoding cycles of combinatorial objects, and also implicitly when objects can be broken…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
In this paper, we prove a conditional limit theorem for independent not necessarily identically distributed random variables. Namely, we obtain the asymptotic distribution of a large number of them given the sum.
In this Article, several aspects of the asymptotic dynamics of finite-dimensional open quantum systems are explored. First, after recalling a structure theorem for the peripheral map, we discuss sufficient conditions and a characterization…
Mappings of a finite set into itself with restriction on the cycle lengths are considered (the so-called A-mappings). Asymptotics is given for the number of these mappings with a power-law reduction of the remainder.
The paper has three parts. In the first part we apply the theory of commuting pairs of (pseudo) difference operators to the (formal) asymptotics of orthogonal polynomials: using purely geometrical arguments we show heuristically that the…