Related papers: Counting toroidal binary arrays
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
We are studying fractional linear recursions of second and third orders and finding periodic recursions with periods of eight and twelve, which, apparently, were not known before.
Recently it was proved that every billiard trajectory inside a $C^3$ convex cone has a finite number of reflections. Here, by a $C^3$ convex cone, we mean a cone whose section with some hyperplane is a strictly convex closed $C^3$…
In this paper, we count the number of matrices whose rows generate different $\mathbb{Z}_2\mathbb{Z}_8$ additive codes. This is a natural generalization of the well known Gaussian numbers that count the number of matrices whose rows…
Using $n$ finite order automorphisms on a simple complex Lie algebra we construct twisted $n$-toroidal Lie algebras. Thus obtaining Lie algebras wich have a rootspace decomposition. For the case $n=2$ we list certain simple Lie algebras and…
Let $m,k$ be fixed positive integers. Determining the generating function for the number of tilings of an $m\times n$ rectangle by $k\times 1$ rectangles is a long-standing open problem to which the answer is only known in certain special…
An m-ballot path of size n is a path on the square grid consisting of north and east steps, starting at (0,0), ending at (mn,n), and never going below the line {x=my}. The set of these paths can be equipped with a lattice structure, called…
We consider possible reconstructions of a binary image of which the row and column sums are given. For any reconstruction we can define the length of the boundary of the image. In this paper we prove a new lower bound on the length of this…
We derive formulae for the number of set-valued standard tableaux of two-rowed shapes, keeping track of the total number of entries, the number of entries in the first row, and the number of entries in the second row. Key in the proofs is a…
We consider the algebra of invariants of binary forms of degree 10 with complex coefficients, construct a system of parameters with degrees 2, 4, 6, 6, 8, 9, 10, 14 and find the 106 basic invariants.
We introduce a new numerical method for the computation of the inverse nonlinear Fourier transform and compare its computational complexity and accuracy to those of other methods available in the literature. For a given accuracy, the…
According to theoretical considerations, multiplicity of hierarchical stellar systems can reach, depending on masses and orbital parameters, several hundred, while observational data confirm existence of at most septuple (seven-component)…
We study bounded width algebras which are minimal in the sense that every proper reduct does not have bounded width. We show that minimal bounded width algebras can be arranged into a pseudovariety with one basic ternary operation. We…
Based upon properties of ordinal length, we introduce a new class of modules, the binary modules, and study their endomorphism ring. The nilpotent endomorphisms form a two-sided ideal, and after factoring this out, we get a commutative…
In this paper, we find formulas for the number of representations of certain diagonal octonary quadratic forms with coefficients $1,2,3,4$ and $6$. We obtain these formulas by constructing explicit bases of the space of modular forms of…
A central limit theorem for binary tree is numerically examined. Two types of central limit theorem for higher-order branches are formulated. A topological structure of a binary tree is expressed by a binary sequence, and the…
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
We consider billiard trajectories in a smooth convex body in $\mathbb R^d$ and estimate the number of distinct periodic trajectories that make exactly $p$ reflections per period at the boundary of the body. In the case of prime $p$ we…
A matrix is given in ``shredded'' form if we are presented with the multiset of rows and the multiset of columns, but not told which row is which or which column is which. The matrix is reconstructible if it is uniquely determined by this…