English
Related papers

Related papers: Lower Bounds for Buchsbaum* Complexes

200 papers

We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.

Combinatorics · Mathematics 2009-04-29 Steven Klee

This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r + 1}(n)) =…

Combinatorics · Mathematics 2018-12-21 Anna Gundert

The approximate coherent state rank is the minimal number of (classical) coherent states required to approximate a continuous-variable bosonic quantum state and directly relates to the classical complexity of simulating bosonic…

Quantum Physics · Physics 2026-04-02 Florian Cottier , Ulysse Chabaud

The Buchsbaum-Eisenbud-Horrocks rank conjecture proposes lower bounds for the Betti numbers of a graded module M based on the codimension of M. We prove a special case of this conjecture via Boij-Soederberg theory. More specifically, we…

Commutative Algebra · Mathematics 2018-04-30 Daniel Erman

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

Combinatorics · Mathematics 2024-01-05 Hamid Reza Daneshpajouh , Frédéric Meunier

We develop a framework suitable for obtaining simplicity criteria for reduced $C^*$-algebras of Hausdorff etale groupoids. This is based on the study of certain non-degenerate $C^*$-subalgebras (in the case of groupoids, the $C^*$-algebra…

Operator Algebras · Mathematics 2018-12-31 Danny Crytser , Gabriel Nagy

In this paper we show that expansion of a Buchsbaum simplicial complex is $CM_t$, for an optimal integer $t\geq 1$. Also, by imposing extra assumptions on a $CM_t$ simplicial complex, we prove that it can be obtained from a Buchsbaum…

Commutative Algebra · Mathematics 2017-01-19 Rahim Rahmati-Asghar

The face numbers of simplicial complexes without missing faces of dimension larger than $i$ are studied. It is shown that among all such $(d-1)$-dimensional complexes with non-vanishing top homology, a certain polytopal sphere has the…

Combinatorics · Mathematics 2009-07-13 Michael Goff , Steven Klee , Isabella Novik

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

Symbolic Computation · Computer Science 2009-02-20 Saugata Basu , Richard Leroy , Marie-Francoise Roy

A notion of an $i$-banner simplicial complex is introduced. For various values of $i$, these complexes interpolate between the class of flag complexes and the class of all simplicial complexes. Examples of simplicial spheres of an arbitrary…

Combinatorics · Mathematics 2012-10-05 Steven Klee , Isabella Novik

We obtain analytical lower bounds on the concurrence of bipartite quantum systems in arbitrary dimensions related to the violation of separability conditions based on local uncertainty relations and on the Bloch representation of density…

Quantum Physics · Physics 2009-11-13 Julio I. de Vicente

We consider simplicial polytopes, and more general simplicial complexes, without missing faces above a fixed dimension. Sharp analogues of McMullen's generalized lower bounds, and of Barnette's lower bounds, are conjectured for these…

Combinatorics · Mathematics 2009-04-24 Eran Nevo

We prove some new rank selection theorems for balanced simplicial complexes. Specifically, we prove that rank selected subcomplexes of balanced simplicial complexes satisfying Serre's condition $(S_{\ell})$ retain $(S_{\ell})$. We also…

Commutative Algebra · Mathematics 2019-02-26 Brent Holmes , Justin Lyle

This article provides new lower bounds for both Schur and weak Schur numbers by exploiting a "template"-based approach. The concept of "template" is also generalized to weak Schur numbers. Finding new templates leads to explicit partitions…

Combinatorics · Mathematics 2022-04-05 Romain Ageron , Paul Casteras , Thibaut Pellerin , Yann Portella , Arpad Rimmel , Joanna Tomasik

We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is…

Combinatorics · Mathematics 2019-06-03 Francisco Criado , Andrew Newman

We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…

Algebraic Geometry · Mathematics 2013-08-21 Nickolas Hein , Christopher J. Hillar , Frank Sottile

We determine which simplicial complexes have the maximum or minimum sum of Betti numbers and sum of bigraded Betti numbers with a given number of vertices in each dimension.

Combinatorics · Mathematics 2024-07-30 Pimeng Dai , Li Yu

Improved model independent upper bounds on the weak transition form factors are derived using inclusive sum rules. Comparison of the new bounds with the old ones is made for the form factors h_{A_1} and h_V in B -> D* decays.

High Energy Physics - Phenomenology · Physics 2009-12-15 Cheng-Wei Chiang

Via the BGG-correspondence a simplicial complex D on [n] is transformed into a complex of coherent sheaves L(D) on the projective space n-1-space. In general we compute the support of each of its cohomology sheaves. When the Alexander dual…

Combinatorics · Mathematics 2007-05-23 Gunnar Floystad

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

Quantum Physics · Physics 2008-05-12 Andris Ambainis