相关论文: Rigidity and the chess board theorem for cube pack…

A cubic partition is an integer partition wherein the even parts can appear in two colors. In this paper, we introduce the notion of generalized cubic partitions and prove a number of new congruences akin to the classical Ramanujan-type. We…

We develop a Helmholtz-like theorem for differential forms in Euclidean space $E_{n}$ using a uniqueness theorem similar to the one for vector fields. We then apply it to Riemannian manifolds, $R_{n}$, which, by virtue of the…

An open problem of quantum information theory has been to determine under what conditions universal exchange-only computation is possible for qudits encoded on $d$-state systems for $d>2$. This problem can be posed in terms of…

We verify the infinitesimal inversive rigidity of almost all triangulated circle polyhedra in the Euclidean plane $\mathbb{E}^{2}$, as well as the infinitesimal inversive rigidity of tangency circle packings on the $2$-sphere…

It is known that the Littlewood-Richardson coefficients can be calculated using a certain class of measures, and these measures have a rigidity property when the coefficient is equal to 1. Rigid measures decompose uniquely into sums of…

It is known that there is a linear dependence between the treewidth of a graph and its balanced separator number: the smallest integer $k$ such that for every weighing of the vertices, the graph admits a balanced separator of size at most…

In this paper we develop the compactness theorem for $\lambda$-surface in $\mathbb R^3$ with uniform $\lambda$, genus, and area growth. This theorem can be viewed as a generalization of Colding-Minicozzi's compactness theorem for…

The robustness of multipartite entanglement of systems undergoing decoherence is of central importance to the area of quantum information. Its characterization depends however on the measure used to quantify entanglement and on how one…

There are significant differences between Helmholtz and Hodge's decomposition theorems, but both share a common flavor. This paper is a first step to bring them together. We here produce Helmholtz theorems for differential 1-forms and…

We classify all cubic extensions of any field of arbitrary characteristic, up to isomorphism, via an explicit construction involving three fundamental types of cubic forms. We deduce a classification of any Galois cubic extension of a…

The Hodge-de Rham Theorem is introduced and discussed. This result has implications for the general study of several partial differential equations. Some propositions which have applications to the proof of this theorem are used to study…

A well known generalization of Alon's "splitting nacklace theorem" by Longueville and Zivaljevic states that every k-colored n-dimensional cube can be fairly split using only k cuts in each dimension. Here we prove that for every t there…

Gr\"unbaum's equipartition problem asked if for any measure $\mu$ on $\mathbb{R}^d$ there are always $d$ hyperplanes which divide $\mathbb{R}^d$ into $2^d$ $\mu$-equal parts. This problem is known to have a positive answer for $d\le 3$ and…

Tverberg's theorem states that any set of $t(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Moreover, generic collections of fewer points cannot be so…

A compactness theorem is proved for a family of K\"{a}hler surfaces with constant scalar curvature and volume bounded from below, diameter bounded from above, Ricci curvature bounded and the signature bounded from below. Furthermore, a…

A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

The classical Lusternik-Schnirelman-Borsuk theorem states that if a d-sphere is covered by d+1 closed sets, then at least one of the sets must contain a pair of antipodal points. In this paper, we prove a combinatorial version of this…

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

Classification theory and the study of projective varieties which are covered by rational curves of minimal degrees naturally leads to the study of families of singular rational curves. Since families of arbitrarily singular curves are hard…