Related papers: Lower Bounds for Buchsbaum* Complexes

We study face numbers of simplicial complexes that triangulate manifolds (or even normal pseudomanifolds) with boundary. Specifically, we establish a sharp lower bound on the number of interior edges of a simplicial normal pseudomanifold…

This paper proves Burgess bounds for short mixed character sums in multi-dimensional settings. The mixed character sums we consider involve both an exponential evaluated at a real-valued multivariate polynomial, and a product of…

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

A classification is given of certain separable nuclear C*-algebras not necessarily of real rank zero, namely, the class of separable simple C*-algebras which are inductive limits of continuous-trace C*-algebras whose building blocks have…

Given a finite CAT(0) cubical complex, we define a flag simplicial complex associated to it, called the crossing complex. We show that the crossing complex holds much of the combinatorial information of the original cubical complex: for…

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…

A new way of constructing fusion bases (i.e., the set of inequalities governing fusion rules) out of fusion elementary couplings is presented. It relies on a polytope reinterpretation of the problem: the elementary couplings are associated…

Over a regular local ring of dimension two with maximal ideal m, we study the Buchsbaum-Rim multiplicity of a finitely generated module M of finite colength in a free module F. First, we investigate the colength of an m-primary ideal and…

Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…

For $n \in \mathbb{N}$, let $h(n)$ denote the number of simplicial complexes on $n$ vertices up to homotopy equivalence. Here we prove that $h(n) \geq 2^{2^{0.02n}}$ when $n$ is large enough. Together with the trivial upper bound of…

In this article we investigate the shellability of the flag simplicial complexes attached to non-simple and thin polyominoes. As a consequence, we obtain the Cohen-Macaulayness and a combinatorial interepetation of the $h$-polynomial of the…

Suzuki recently gave constructions of non-discrete examples of locally compact C*-simple groups and Raum showed C*-simplicity of the relative profinite completions of the Baumslag-Solitar groups by using Suzuki's results. We extend this…

We extend applications of Furstenberg boundary theory to the study of $C^*$-algebras associated to minimal actions $\Gamma\!\curvearrowright\! X$ of discrete groups $\Gamma$ on locally compact spaces $X$. We introduce boundary maps on…

In this paper, we consider hypergraphs whose vertices are distinct points moving smoothly on a Riemannian manifold M. We take these hypergraphs as graded submanifolds of configuration spaces. We construct double complexes of differential…

We prove that the limits of Baumslag-Solitar groups which we previously studied are non-linear hopfian C*-simple groups with infinitely many twisted conjugacy classes. We exhibit infinite presentations for these groups, classify them up to…

We generalize the shadow codes of Cherubini and Micheli to include basic polynomials having arbitrary degree, and show that restricting basic polynomials to have degree one or less can result in improved lower bounds on the minimum distance…

The nonnegative rank of a nonnegative matrix $X$ is the smallest number of nonnegative rank-one factors that sum to $X$. Since computing the nonnegative rank is NP-hard, it is common to circumvent this issue by computing lower and upper…

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…