Related papers: A simple explicit bijection between (n,2) Gog and …
The graph bisection problem is the problem of partitioning the vertex set of a graph into two sets of given sizes such that the sum of weights of edges joining these two sets is optimized. We present a semidefinite programming relaxation…
For a connected reductive group $G_k$ over an algebraically closed field $k$ of char $\neq 2$ and a fixed point subgroup $K_k$ under an algebraic group involution, we construct a quantization and an integral model of any affine embeddings…
Exactly integrable systems connected to semisimple algebras of second rank with an arbitrary choice of grading are presented in explicit form. General solutions of these systems are expressed in terms of matrix elements of two fundamental…
One of our result is that 5 measurable sets in $R^8$ always admit an equipartition by 2 hyperplanes. This is an instance of a general equipartition problem (formulated by B. Gr{\" u}nbaum and H. Hadwiger) which can be reduced to the…
A unicellular map, or one-face map, is a graph embedded in an orientable surface such that its complement is a topological disk. In this paper, we give a new viewpoint to the structure of these objects, by describing a decomposition of any…
Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…
We extend the Marcus-Schaeffer bijection between orientable rooted bipartite quadrangulations (equivalently: rooted maps) and orientable labeled one-face maps to the case of all surfaces, that is orientable and non-orientable as well. This…
We present a bijection for toroidal maps that are essentially $3$-connected ($3$-connected in the periodic planar representation). Our construction actually proceeds on certain closely related bipartite toroidal maps with all faces of…
In this paper, we formulate and prove linear analogues of results concerning matchings in groups. A matching in a group G is a bijection f between two finite subsets A,B of G with the property, motivated by old questions on symmetric…
A definable set in a pair (K, k) of algebraically closed fields is co-analyzable relative to the subfield k of the pair if and only if it is almost internal to k. To prove this and some related results for tame pairs of real closed fields…
For every $g\geq 2$ we distinguish real period matrices of real Riemann surfaces of topological type $(g,0,0)$ from the ones of topological type $(g,k,1)$, with $k$ equal to one or two for $g$ even or odd respectively (Theorem B). To that…
In a recent paper, Andrews and Merca investigated the number of even parts in all partitions of $n$ into distinct parts, which arise naturally from the Euler-Glaisher bijective proof. They obtained new combinatorial interpretations for this…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
In the previous paper, we describe the intersection complexes of a toric variety as a finite complex of graded exterior modules on the associated fan. In this second part, we rewrite it explicitly by the barycentric subdivision of the fan.…
We show that the word problem of the Brin-Higman-Thompson group $n G_{k,1}$ is {\sf coNP}-complete for all $n \ge 2$ and all $k \ge 2$. For this we prove that $n G_{k,1}$ is finitely generated, and that $n G_{k,1}$ contains a subgroup of $2…
We construct a class of exactly solved (0,2) heterotic compactifications, similar to the (2,2) models constructed by Gepner. We identify these as special points in moduli spaces containing geometric limits described by non-linear sigma…
A $k$-bisection of a multigraph $G$ is a partition of its vertex set into two parts of the same cardinality such that every component of each part has at most $k$ vertices. Cui and Liu shown that every claw-free cubic multigraph contains a…
We present bijections for the planar cases of two counting formulas on maps that arise from the KP hierarchy (Goulden-Jackson and Carrell-Chapuy formulas), relying on a "cut-and-slide" operation. This is the first time a bijective proof is…
Let $p_k(n)$ denote the number of $2$-color partitions of $n$ where one of the colors appears only in parts that are multiples of $k$. We will prove a conjecture of Ahmed, Baruah, and Dastidar on congruences modulo $5$ for $p_k(n)$.…
It is proved that a bijection between two compact hyperbolic surfaces with boundary is an isometry if it and its inverse map each geodesic onto some geodesic.