Related papers: Colorful Words and d-Tverberg Complexes
For certain problems involving vector fields, it is possible to find an associated imaginary field that, in conjunction with the first, forms a complex field for which the equation can be solved. This result is generalized to arbitrary…
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…
Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…
We prove a new theorem of Tverberg type which confirms the conjecture of Blagojevic, Frick, and Ziegler about the existence of "balanced Tverberg partitions" (Conjecture 6.6 in, Tverberg plus constraints, Bull. London Math. Soc., 46 (2014)…
We prove a combination theorem for hyperbolic groups, in the case of groups acting on complexes displaying combinatorial features reminiscent of non-positive curvature. Such complexes include for instance weakly systolic complexes and…
A vector composition of a vector $\mathbf{\ell}$ is a matrix $\mathbf{A}$ whose rows sum to $\mathbf{\ell}$. We define a weighted vector composition as a vector composition in which the column values of $\mathbf{A}$ may appear in different…
Regular incidence complexes are combinatorial incidence structures generalizing regular convex polytopes, regular complex polytopes, various types of incidence geometries, and many other highly symmetric objects. The special case of…
We obtain algorithms for computing Tverberg partitions based on centerpoint approximations. This applies to a wide range of convexity spaces, from the classic Euclidean setting to geodetic convexity in graphs. In the Euclidean setting, we…
Ehrenborg and Jung recently related the order complex for the lattice of d-divisible partitions with the simplicial complex of pointed ordered set partitions via a homotopy equivalence. The latter has top homology naturally identified as a…
A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were…
Let $r$ be a positive integer. An $r$-set is a pair $X= (V(X),R(X))$ consisting of a set $V(X)$ with a subset $R(X)$ of the direct product $V(X)^r$. The object of this paper is to investigate the Hom complexes of $r$-sets, which were…
A d-partite hypergraph is called *fractionally balanced* if there exists a non-negative, not identically zero, function on its edge set that has constant degrees in each vertex side. Using a topological version of Hall's theorem we prove…
Tverberg's theorem asserts that every (k-1)(d+1)+1 points in R^d can be partitioned into k parts, so that the convex hulls of the parts have a common intersection. Calder and Eckhoff asked whether there is a purely combinatorial deduction…
We construct several topological groups with very strong combinatorial properties. In particular, we give simple examples of subgroups of the real line R (thus strictly o-bounded) which have the Hurewicz property but are not sigma-compact,…
The purpose of this paper is to articulate an observation that many interesting type of wavelets (or coherent states) arise from group representations which are not square integrable or vacuum vectors which are not admissible. This extends…
We prove a "multiple colored Tverberg theorem" and a "balanced colored Tverberg theorem", by applying different methods, tools and ideas. The proof of the first theorem uses multiple chessboard complexes (as configuration spaces) and…
Word-representable graphs are a class of graphs that can be represented by words, where edges and non-edges are determined by the alternation of letters in those words. Several papers in the literature have explored the…
The colourful simplicial depth problem in dimension d is to find a configuration of (d+1) sets of (d+1) points such that the origin is contained in the convex hull of each set (colour) but contained in a minimal number of colourful…
The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…
Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been…