Scalable quantum computers hold the promise to solve hard computational problems, such as prime factorization, combinatorial optimization, simulation of many-body physics, and quantum chemistry. While being key to understanding many real-world phenom...
We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more standard approa...
We characterize folding patterns, the combinatorial options of folding minimal alcove-to-alcove galleries in affine Coxeter complexes positively with respect to Weyl chamber orientations of the Coxeter complex, by drawing a connection to the Bruhat m...
We study the structure of inverse limit space of so-called Fibonacci-like tent maps. The combinatorial constraints implied by the Fibonacci-like assumption allow us to introduce certain chains that enable a more detailed analysis of symmetric arcs wi...
The NP-complete combinatorial optimization task of assigning offsets to a set of buffers with known sizes and lifetimes so as to minimize total memory usage is called dynamic storage allocation (DSA). Existing DSA implementations bypass the theoretic...
Optimization is a key task in a number of applications. When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set of constraints, optimization is typically NP-hard. Fortunately, in man...
Stochastic search algorithms are among the most sucessful approaches for solving hard combinatorial problems. A large class of stochastic search approaches can be cast into the framework of Las Vegas Algorithms (LVAs). As the run-time behavior of LVA...
In view of Tucker's lemma (an equivalent combinatorial version of the Borsuk- Ulam theorem), the present authors (2013) introduced the kth altermatic number of a graph G as a tight lower bound for the chromatic number of G. In this note, we present a...
In this paper, we present a new network flow linear programming (LP) model of the standard Assignment Problem (AP) polytope. The model is not meant to be competitive with the existing standard, two-dimensional abstraction of the AP with respect to so...
Recall that a definable group is `definably amenable' if it admits a translation-invariant Keisler measure. We prove a combinatorial characterization of definable amenability for groups definable in NIP theories. More specifically, given a group $G$,...
Petrie symmetric functions $G(k,n)$, also known as truncated homogeneous symmetric functions or modular complete symmetric functions, form a class of symmetric functions interpolating between the elementary symmetric functions $e_n$ and the homogeneo...
This article proves the following theorem, first enunciated by Roger Penrose about 70 years ago but never published: In $\mathbb{R}P^{2}$, if conics are assigned to seven of the vertices of a combinatorial cube such that (i) conics connected by an ed...
An approximate Spielman-Teng theorem for the least singular value $s_n(M_n)$ of a random $n\times n$ square matrix $M_n$ is a statement of the following form: there exist constants $C,c >0$ such that for all $η\geq 0$, $\Pr(s_n(M_n) \leq η) \lesssi...
maximum generalized assignment problem is a problem in combinatorial optimization. This problem is a generalization of the assignment problem in which both
The assignment problem is a fundamental combinatorial optimization problem. In its most general form, the problem is as follows: The problem instance has
In 1996, Jackson and Martin proved that a strong ideal ramp scheme is equivalent to an orthogonal array. However, there was no good characterization of ideal ramp schemes that are not strong. Here we show the equivalence of ideal ramp schemes to a ne...
Recently, Gumbel AlphaZero~(GAZ) was proposed to solve classic combinatorial optimization problems such as TSP and JSSP by creating a carefully designed competition model~(consisting of a learning player and a competitor player), which leverages the...
We present a new combinatorial characterization for local optimality of a codeword in an irregular Tanner code. The main novelty in this characterization is that it is based on a linear combination of subtrees in the computation trees. These subtrees...
We consider hypergraphs on vertices $P\cup R$ where each hyperedge contains exactly one vertex in $P$. Our goal is to select a matching that covers all of $P$, but we allow each selected hyperedge to drop all but an $(1/α)$-fraction of its intersect...
We introduce and study the twisted adapted $r$-cluster point and its combinatorial Auslander-Reiten quivers, called twisted AR-quivers and folded AR-quivers, of type $A_{2n+1}$ which are closely related to twisted Coxeter elements and the non-trivial...