Related papers: The asymptotic number of binary codes and binary m…
We study the following inverse graph-theoretic problem: how many vertices should a graph have given that it has a specified value of some parameter. We obtain asymptotic for the minimal number of vertices of the graph with the given number…
The authors analyze the asymptotics of eigenvalues of Toeplitz matrices with certain continuous and discontinuous symbols. In particular, the authors prove a conjecture of Levitin and Shargorodsky on the near-periodicity of Toeplitz…
The purpose of this paper is to complete the classification of binary self-dual [48,24,10] codes with an automorphism of odd prime order. We prove that if there is a self-dual [48, 24, 10] code with an automorphism of type p-(c,f) with p…
In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…
In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated…
We investigate point-line geometries whose singular subspaces correspond to binary equidistant codes. The main result is a description of automorphisms of these geometries. In some important cases, automorphisms induced by non-monomial…
Answering a question of Clark and Ehrenborg (2010), we determine asymptotics for the number of permutations of size n that admit the most common excedance set. In fact, we provide a more general bivariate asymptotic using the multivariate…
In this paper, we develop the Riemann-Hilbert method to study the asymptotics of discrete orthogonal polynomials on infinite nodes with an accumulation point. To illustrate our method, we consider the Tricomi-Carlitz polynomials…
We solve an asymptotic problem in the geometry of numbers, where we count the number of singular $n\times n$ matrices where row vectors are primitive and of length at most T. Without the constraint of primitivity, the problem was solved by…
We establish the asymptotic behaviour of $\mu(G(n,p))$, the number of unlabelled induced subgraphs in the binomial random graph $G(n,p)$, for almost the entire range of the probability parameter $p=p(n)\in[0,1]$. In particular, we show that…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
In this article we obtain asymptotic formulas for eigenvalues and eigenfunctions of the operator generated by a system of ordinary differential equations with summable coefficients and quasiperiodic boundary conditions. Then using these…
A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are sieved from the large pool of all non-isomorphic…
The binary problem of Goldbach is solved by the method of the trigonometrical sums. The asymptotic formula of distribution of the even numbers formed by the sum of two simple uneven numbers is found for each even number from the set of…
This is a manuscript of a chapter prepared for a book. The good codes possess large information length and large minimum distance. A class of codes is said to be asymptotically good if there exists a positive real $\delta$ such that, for…
We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.
We exhibit a procedure to asymptotically enumerate monotone grid classes of permutations. This is then applied to compute the asymptotic number of permutations in any connected one-corner class. Our strategy consists of enumerating the…
We compute the asymptotics of the number of connected branched coverings of a torus as their degree goes to infinity and the ramification type stays fixed. These numbers are equal to the volumes of the moduli spaces of pairs (curve,…
We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…
An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found