Related papers: On the number of fully packed loop configurations …
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…
In [Pal13] (arXiv:1106.4540) the second author proved that the sequence of "oriented" configuration spaces on an open connected manifold exhibits homological stability as the number of particles goes to infinity. To complement that result…
In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…
The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for…
In this paper, we study the convergence of Alternating Projection (AP) algorithm for the matrix completion and compressed sensing problems. We also present computational evidence for the excellent performance of the algorithm. Also, in the…
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…
In this paper, we consider plane partitions $\text{PP}(\lambda; m)$ of a given shape $\lambda$, with entries at most $m$. We prove that the distributions of two statistics on $\text{PP}(\lambda; m)$ coincide: one is the number of rows…
We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…
We give an algorithm to determine whether Wilf's conjecture holds for all numerical semigroups with a given multiplicity $m$, and use it to prove Wilf's conjecture holds whenever $m \le 18$. Our algorithm utilizes techniques from polyhedral…
A new relation between a class of complex polynomials with a good behavior at infinity studied by A. N\'emethi and A. Zaharia and the cohomology groups of affine complex hyperplane arrangement complements with rank one local system…
The matched pair theory (of groups) is studied for a class of quasigroups; namely, the $m$-inverse property loops. The theory is upgraded to the Hopf level, and the "$m$-invertible Hopf quasigroups" are introduced.
We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…
In the papers from Chui and Parnes (1971) and Luh (1972), as well on the paper from V.Nestoridis (1996) on the Universal Taylor series, it is used, without proof, that the union of two compact sets in $\mathbb{R} ^2$ with connected…
We prove that integer programming with three quantifier alternations is $NP$-complete, even for a fixed number of variables. This complements earlier results by Lenstra and Kannan, which together say that integer programming with at most…
We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in the complex projective plane. Such pair of arrangements has an additional property: they admit conjugated equations on the ring…
In this note, we propose a simple-looking but broad conjecture about star-algebras over the field of real numbers. The conjecture enables many matrix decompositions to be represented by star-algebras and star-ideals. This paper is written…
Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs,…
Many well-known problems in Combinatorics can be reduced to finding a large rainbow structure in a certain edge-coloured multigraph. Two celebrated examples of this are Ringel's tree packing conjecture and Ryser's conjecture on transversals…
We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…