English
Related papers

Related papers: A lower bound theorem for centrally symmetric simp…

200 papers

In this article, we prove that the least energy nodal solutions to Lane-Emden equation $-{\Delta}u = |u|^{p-2}u$ with zero Dirichlet boundary conditions on a square are odd with respect to one diagonal and even with respect to the other one…

Analysis of PDEs · Mathematics 2022-02-23 Ariel Salort , Christophe Troestler

A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…

Commutative Algebra · Mathematics 2022-08-30 Gunnar Fløystad , Milo Orlich

We show that Wall's D(2) problem, the Realization problem and the Relation Gap problem could all be solved if it could be shown that the deficiency of a certain group is, as intuition would suggest, less than -1. Note the paper has been…

Group Theory · Mathematics 2009-01-12 W. H. Mannan

Assume D is a simplicial sphere, and k_1 is a field. We say that D is generically anisotropic over k_1 if, for a certain purely transcendental field extension k of k_1, a certain Artinian reduction A of the Stanley-Reisner ring k[D] has the…

Commutative Algebra · Mathematics 2020-12-18 Stavros Argyrios Papadakis , Vasiliki Petrotou

We investigate polyhedral $2k$-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex {\it $k$-Hamiltonian} if it contains the full $k$-skeleton of the polytope. Since the case of the cube is well…

Geometric Topology · Mathematics 2010-06-10 Felix Effenberger , Wolfgang Kühnel

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…

Algebraic Topology · Mathematics 2019-11-15 Andrew Newman

A W-state is an order d symmetric tensor of the form W_d=x^{d-1}y. We prove that the partially symmetric rank of W_{d_1}\otimes \cdots \otimes W_{d_k} is at most 2^{k-1}(d_1+\cdots +d_k-2k+2). The same bound holds for the tensor rank and it…

Algebraic Geometry · Mathematics 2025-12-08 S. Canino , A. Casarotti , P. Santarsiero

We consider a class of interacting particle systems with values in $[0,\8)^{\zd}$, of which the binary contact path process is an example. For $d \ge 3$ and under a certain square integrability condition on the total number of the…

Probability · Mathematics 2009-06-26 Yukio Nagahata , Nobuo Yoshida

We study the structure of Stanley-Reisner rings associated to cyclic polytopes, using ideas from unprojection theory. Consider the boundary simplicial complex Delta(d,m) of the d-dimensional cyclic polytope with m vertices. We show how to…

Commutative Algebra · Mathematics 2012-07-19 Janko Boehm , Stavros Argyrios Papadakis

One of the main open questions in liaison theory is whether every homogeneous Cohen-Macaulay ideal in a polynomial ring is glicci, i.e. if it is in the G-liaison class of a complete intersection. We give an affirmative answer to this…

Commutative Algebra · Mathematics 2007-05-23 Uwe Nagel , Tim Roemer

We have found the minimal difference $\Delta(k) = \min\limits_P (f_{d-1}(P) - f_{0}(P))$ between the number of facets and the number of vertices of a $k$-neighborly $d$-polytope $P$ for the case $f_{0}(P) = d+3$: $\Delta(2) = 4$, $\Delta(3)…

Combinatorics · Mathematics 2018-08-27 Aleksandr Maksimenko

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

Logic · Mathematics 2024-10-30 Tamás Kátay , László Márton Tóth , Zoltán Vidnyánszky

We derive a central limit theorem for the number of vertices of convex polytopes induced by stationary Poisson hyperplane processes in $\mathbb{R}^d$. This result generalizes an earlier one proved by Paroux [Adv. in Appl. Probab. 30 (1998)…

Probability · Mathematics 2007-05-23 Lothar Heinrich , Hendrik Schmidt , Volker Schmidt

In 1989 Kalai stated the three conjectures A, B, C of increasing strength concerning face numbers of centrally symmetric convex polytopes. The weakest conjecture, A, became known as the ``$3^d$-conjecture''. It is well-known that the three…

Combinatorics · Mathematics 2012-12-27 Raman Sanyal , Axel Werner , Günter M. Ziegler

We consider complex projective schemes $X\subset\Bbb{P}^{r}$ defined by quadratic equations and satisfying a technical hypothesis on the fibres of the rational map associated to the linear system of quadrics defining $X$. Our assumption is…

Algebraic Geometry · Mathematics 2010-07-01 Alberto Alzati , José Carlos Sierra

Kalai's $3^d$ conjecture states that every centrally-symmetric $d$-polytope has at least $3^d$ faces. We give short proofs for two special cases: if $P$ is unconditional (that is, invariant w.r.t. reflection in any coordinate hyperplane),…

Combinatorics · Mathematics 2024-04-23 Raman Sanyal , Martin Winter

We generalize the following result of White: Suppose $N$ is a compact, strictly convex domain in $\RR^3$ with smooth boundary. Let $\Sigma$ be a compact 2-manifold with boundary. Then a generic smooth curve $\Gamma\cong \partial\Sigma$ in…

Differential Geometry · Mathematics 2009-05-18 David Hoffman , Brian White

The Leray number of an abstract simplicial complex is the minimal integer $d$ where its induced subcomplexes have trivial homology groups in dimension $d$ or greater. We give an upper bound on the Leray number of a complex in terms of how…

Commutative Algebra · Mathematics 2023-08-08 Jaewoo Jung , Jinha Kim , Minki Kim , Yeongrak Kim

In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…

Metric Geometry · Mathematics 2016-02-09 Júlia Frittmann , Zsolt Lángi

Let $K$ be a smooth convex set with volume one in $\BBR^d$. Choose $n$ random points in $K$ independently according to the uniform distribution. The convex hull of these points, denoted by $K_n$, is called a {\it random polytope}. We prove…

Probability · Mathematics 2007-05-23 Van Vu