Eduard Lerner

collaborators

3 papers

math.CO2025

The $α$ -representation for Tait coloring and sums over spanning trees

Ilyas Kalimullin, Eduard Lerner

Consider a connected pseudograph $H$ such that each edge is associated with weight $x_{e}$ , $x_{e} \in F_{3}$ ; $T (H)$ is the set of spanning trees of graph $H$ . Assume…

math.CO2025

The $α$ -representation for the Tait coloring and for the characteristic polynomial of matroid

Eduard Lerner

Consider a finite field $F_{q}$ , $q = p^{d}$ , where $p$ is an odd number. Let $M = (E, r)$ be a regular matroid; denote by $B$ the family of its bases, $\bar s(M;α)=\sum_…

math.CO2024

Slack-Pack algorithm for Meir-Moser packing problem

A. D. Kislovskiy, E. Yu. Lerner, I. A. Senkevich

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$ …

The α-representation for Tait coloring and sums over spanning trees

The α-representation for the Tait coloring and for the characteristic polynomial of matroid

Slack-Pack algorithm for Meir-Moser packing problem

The $α$ -representation for Tait coloring and sums over spanning trees

The $α$ -representation for the Tait coloring and for the characteristic polynomial of matroid