Related papers: On the number of fully packed loop configurations …
We consider a matching problem in a bipartite graph $G$ where every vertex has a capacity and a strict preference order on its neighbors. Furthermore, there is a cost function on the edge set. We assume $G$ admits a perfect matching, i.e.,…
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It is then possible to define an induced chain map between the…
We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…
Multiplicative bundle gerbes are gerbes over a Lie group which are compatible with the group structure. In this article connections on such bundle gerbes are introduced and studied. It is shown that multiplicative bundle gerbes with…
We prove that the cyclic homology of a scheme with an ample line bundle coincides with the cyclic homology of its category of algebraic vector bundles. As a byproduct of the proof, we obtain a new construction of the Chern character of a…
Let $k$ be an uncountable field. We prove that the polynomial ring $R:=k[X_1,\dots,X_n]$ in $n\ge 2$ variables over $k$ is complete in its adic topology. In addition we prove that also the localization $R_{\goth m}$ at a maximal ideal…
In the MINIMUM CONVEX COVER (MCC) problem, we are given a simple polygon $\mathcal P$ and an integer $k$, and the question is if there exist $k$ convex polygons whose union is $\mathcal P$. It is known that MCC is $\mathsf{NP}$-hard…
We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…
Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…
We show fully polynomial time randomized approximation schemes (FPRAS) for counting matchings of a given size, or more generally sampling/counting monomer-dimer systems in planar, not-necessarily-bipartite, graphs. While perfect matchings…
In this paper we study polycubes: orthogonal polyhedra with axis-aligned quadrilateral faces. We present a complete characterization of polycubes of any genus based on their dual structure: a collection of oriented loops which run in each…
For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…
In this paper we explore enumeration problems related to the number of reachable configurations in a chip-firing game on a finite connected graph G. We define an auxiliary notion of debt-reachability and prove that the number of…
A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been recentlyintroduced by Kuperberg, Lovett, and Peled (STOC 2012). Using this technique, it can be shown that under certain…
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are equal. We prove that these equalities hold for any…
Investigating a problem posed by W. Hengartner (2000), we study the maximal valence (number of preimages of a prescribed point in the complex plane) of logharmonic polynomials, i.e., complex functions that take the form $f(z) = p(z)…
We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.
For a bridgeless cubic graph $G$, $m_3(G)$ is the ratio of the maximum number of edges of $G$ covered by the union of $3$ perfect matchings to $|E(G)|$. We prove that for any $r\in [4/5, 1)$, there exist infinitely many cubic graphs $G$…
Let $M$ be a perfect matching in a graph. A subset $S$ of $M$ is said to be a forcing set of $M$, if $M$ is the only perfect matching in the graph that contains $S$. The minimum size of a forcing set of $M$ is called the forcing number of…
A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…