Related papers: Inscribed Tverberg-Type Partitions for Orbit Polyt…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Motivated by spin modular representations of the symmetric groups, we propose two generalizations of the Schur regular partitions for an odd integer $p\geq 3$. One forms a subset of the set of $p$-strict partitions, and the other forms that…

The program of understanding Shape Theory layer by layer topologically and geometrically -- proposed in Part I -- is now addressed for 4 points in 1-$d$. Topological shape space graphs are far more complex here, whereas metric shape spaces…

The Satisfactory Partition problem consists in deciding if the set of vertices of a given undirected graph can be partitioned into two nonempty parts such that each vertex has at least as many neighbours in its part as in the other part.…

We show that tautological integrals on Hilbert schemes of points can be written in terms of universal polynomials in Chern numbers. The results hold in all dimensions, though they strengthen known results even for surfaces by allowing…

We study the distribution of periodic points for a wide class of maps, namely entire transcendental functions of finite order and with bounded set of singular values, or compositions thereof. Fix $p\in\N$ and assume that all dynamic rays…

The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms. For questions related to location, the partition problem can be modeled, in…

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

We prove that for every positive integer $d \ge 2$ there exist polynomial functions $F_d, G_d: \mathbb{N} \to \mathbb{N}$ such that for each positive integer $r$, every order-$d$ tensor $T$ over an arbitrary field and with partition rank at…

Let $d\geq 2$ be a positive integer, $K$ an algebraically closed field of characteristic not dividing $d$, $n\geq d+1$ a positive integer that is prime to $d$, $f(x)\in K[x]$ a degree $n$ monic polynomial without multiple roots, $C_{f,d}:…

Let OT_d(n) be the smallest integer N such that every N-element point sequence in R^d in general position contains an order-type homogeneous subset of size n, where a set is order-type homogeneous if all (d+1)-tuples from this set have the…

This paper, about a fluid-like system of spatially confined particles, reveals the analytic structure for both, the canonical and grand canonical partition functions. The studied system is inhomogeneously distributed in a region whose…

Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…

We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…

The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…

For an $r$-tuple $(\gamma_1,\ldots,\gamma_r)$ of special orthogonal $d\times d$ matrices, we say that the Euclidean $(d-1)$-dimensional sphere $S^{d-1}$ is $(\gamma_1,\ldots,\gamma_r)$-divisible if there is a subset $A\subseteq S^{d-1}$…

The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…

In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…

Kostka coefficients appear in the representation theory of the general linear group and enumerate semistandard Young tableaux of fixed shape and content. The $r$-Kostka cone is the real polyhedral cone generated by pairs of partitions with…

For a finite set $S$ of points in the plane and a graph with vertices on $S$ consider the disks with diameters induced by the edges. We show that for any odd set $S$ there exists a Hamiltonian cycle for which these disks share a point, and…