arXiv subjects

E. Yu. Lerner

Publications and source records attributed to E. Yu. Lerner.

9 recordsLinked to original sources

arXiv2024

Slack-Pack algorithm for Meir-Moser packing problem

The well-known problem stated by A. Meir and L. Moser consists in tiling the unit square with rectangles (details), whose side lengths equal $1/n\times 1/(n+1)$, where indices~$n$ range from 1 to infinity. Recently, Terence Tao has proved that it is possible to tile with $1/n^t\times 1/(n+1)^t$ rectangles (squares with the side length of $1/n^t$), $1/2<t<1$, the square, whose area equals the sum of areas of these details, provided that only those details, whose indices exceed certain~$n_0$, are taken into consideration. We adduce arguments in favor of the assumption that the result obtained by T. Tao is also valid for $t=1$. We use a new tiling method (the Slack-Pack algorithm), which initially admits gaps between stacks of details. The algorithm uses a pre-fixed parameter $\gamma$, $\sqrt{3/2}<\gamma<3/2$, connected with the gap value. The new algorithm allows one to control the ratio of the area of the large rectangular part, which is free of details, to the whole area of the remaining empty space. This ratio (under certain natural assumptions) always exceeds $1-1/\gamma-\delta$, where $\delta$ tends to zero as $n_0$ increases.

math.CO↗

arXiv2024

The Heawood approach to Tait colorings and defining vertex sets

Given a simple biconnected planar cubic graph, we associate each its vertex among $2n$ ones with the so-called spin, i.e., a variable which takes on values $\pm 1$. P. J. Heawood has proved that a Tait coloring, accurate to the choice of a color for one edge, is equivalent to the choice of spin values so as to make the sum of these value at vertices of any face be a multiple of~3. We treat faces, which satisfy this condition, as {\it proper}. The condition that guarantee the propriety of faces define a system of linear equations (SLE) with respect to variables, which take on nonzero values in the field ${\mathbb F}_3$. We say that a set of vertices is {\it defining} if values of spins of these vertices uniquely define values of the rest spins. In particular, so is the set of vertices which correspond to all free variables of the SLE. We actualize the approach proposed by P. J. Heawood by proposing a geometric proof of the fact that for a non-bipartite graph the rank of the SLE equals $n+1$. Moreover, we also geometrically describe the necessary condition for the minimality of the defining set. This implies that in the case of a non-bipartite graph there exist defining subsets consisting of $n-1$ vertices. As a simple corollary, we conclude that the number of Tait colorings in this case does not exceed $3\cdot 2^{n-1}$. Though this estimate is not exact, it is by half better than the known one. We also prove that the number of Tait colorings for a graph $CL_n$, which is bipartite for even $n$ and non-bipartite for an odd one, equals $2^n+8$ and $2^n-2$, correspondingly.

math.CO↗

arXiv2024

Matroid variant of Matiyasevich formula and its application

In 1977, Yu. V. Matiyasevich proposed a formula expressing the chromatic polynomial of an arbitrary graph as a linear combination of flow polynomials of subgraphs of the original graph. In this paper, we prove that this representation is a particular case of one (easily verifiable) formula, namely, the representation of the characteristic polynomial of an arbitrary matroid as a linear combination of characteristic polynomials of dual matroids. As an application, we represent the flow polynomial of a complete graph with $n$ vertices as the sum of elementary terms with respect to all partitions of positive integer $n$. Since the growth rate of the number of all partitions is less than exponential, this technique allows us to evaluate the flow polynomial for values of $n\approx 50$. We also get an explicit expression for the characteristic polynomial of the matroid dual to the matroid of the projective geometry over a finite field. We prove, in particular, that major coefficients of all these polynomials coincide with the beginning of the row in the Pascal triangle, whose number equals the quantity of elements in the corresponding matroid. At the end part of the paper, we consider one more approach, which allows us to obtain the same results of application of our main theoren by using properties of the Tutte polynomial and the classical Rota formula for coefficients of the characteristic polynomial of a matroid. In addition, we describe the connection between the matroid variant of the Matiyasevich formula and convolution formulas for Tutte polynomials.

math.CO↗

arXiv2021

Minimal instances with no weakly stable matching for three-sided problem with cyclic incomplete preferences

Given $n$ men, $n$ women, and $n$ dogs, each man has an incomplete preference list of women, each woman does an incomplete preference list of dogs, and each dog does an incomplete preference list of men. We understand a family as a triple consisting of one man, one woman, and one dog such that each of them enters in the preference list of the corresponding agent. We do a matching as a collection of nonintersecting families (some agents, possibly, remain single). A matching is said to be nonstable, if one can find a man, a woman, and a dog which do not live together currently but each of them would become "happier" if they do. Otherwise the matching is said to be stable (a weakly stable matching in 3-DSMI-CYC problem). We give an example of this problem for $n=3$ where no stable matching exists. Moreover, we prove the absence of such an example for $n<3$. Such an example was known earlier only for $n=6$ (Biro, McDermid, 2010). The constructed examples also allows one to decrease (in two times) the size of the recently constructed analogous example for complete preference lists (Lam, Plaxton, 2019).

math.CO↗

arXiv2012

The Zipf law for random texts with unequal probabilities of occurrence of letters and the Pascal pyramid

We model the generation of words with independent unequal probabilities of occurrence of letters. We prove that the probability $p(r)$ of occurrence of words of rank $r$ has a power asymptotics. As distinct from the paper published earlier by B. Conrad and M. Mitzenmacher, we give a brief proof by elementary methods and obtain an explicit formula for the exponent of the power law.

math.ST↗

arXiv2009

About statistics of periods of continued fractions of quadratic irrationalities

In this paper we answer certain questions posed by V.I. Arnold, namely, we study periods of continued fractions for solutions of quadratic equations in the form $x^2+p x=q$ with integer $p$ and $q$, $p^2+q^2\le R^2$. Our results concern the average sum of period elements and Gauss--Kuzmin statistics as $R\to\infty$.

math.NT↗

arXiv2008

Statistics of incomplete quotients of continued fractions of quadratic irrationalities

V.I. Arnold has experimentally established that the limit of the statistics of incomplete quotients of partial continued fractions of quadratic irrationalities coincides with the Gauss--Kuz'min statistics. Below we briefly prove this fact for roots of the equation $r x^2+p x=q$ with fixed $p$ and $r$ ($r>0$), and with random $q$, $q\le R$, $R\to \infty$. In Section 3 we estimate the sum of incomplete quotients of the period. According to the obtained bound, prior to the passage to the limit, incomplete quotients in average are logarithmically small. We also upper estimate the proportion of the "red" numbers among those representable as a sum of two squares.

math.OC↗

arXiv2007

Tables of graphs of binary and ternary sequences differentiation

Let $x$ be a cyclic sequence of $n$ elements of the finite field $\mathbb{F}_q$ (the first element immediately follows the $n$-th one). Let us define the operation $Δ$ as the transition from $x$ to the sequence of differences of the neighbouring elements from $x$. The aim of this work is to give graphs of the dynamic system $Δ$ for $q=2$, $n\le 300$ and $q=3$, $n\le 150$. These results enable us to define more precisely the Arnold hypotheses and to prove them.

math.NT↗

arXiv2007

Multiplicative function instead of logarithm (an elementary approach)

V.I. Arnold has recently defined the complexity of finite sequences of zeroes and ones in terms of periods and preperiods of attractors of a dynamic system of the operator of finite differentiation. Arnold has set up a hypothesis that the sequence of the values of the logarithm is most complicated or almost most complicated. In this paper we obtain the necessary and sufficient conditions which make this sequence (supplemented with zero) most complicated for a more wide class of operators. We prove that a sequence of values of a multiplicative function in a finite field is most complicated or almost most complicated for any operator divisible by the differentiation operator.

math.NT↗