中文
相关论文

相关论文: The stresses on centrally symmetric complexes and …

200 篇论文

Stanley proved that for any centrally symmetric simplicial $d$-polytope $P$ with $d\geq 3$, $g_2(P) \geq {d \choose 2}-d$. We provide a characterization of centrally symmetric $d$-polytopes with $d\geq 4$ that satisfy this inequality as…

组合数学 · 数学 2018-11-13 Steven Klee , Eran Nevo , Isabella Novik , Hailun Zheng

A simplicial complex of dimension $d-1$ is said to be balanced if its graph is $d$-colorable. Juhnke-Kubitzke and Murai proved an analogue of the generalized lower bound theorem for balanced simplicial polytopes. We establish a…

组合数学 · 数学 2016-08-30 Martina Juhnke-Kubitzke , Satoshi Murai , Isabella Novik , Connor Sawaske

For a simplicial complex $\Delta$, the graded Betti number $\beta_{i,j}(k[\Delta])$ of the Stanley-Reisner ring $k[\Delta]$ over a field $k$ has a combinatorial interpretation due to Hochster. Terai and Hibi showed that if $\Delta$ is the…

组合数学 · 数学 2010-04-07 Suyoung Choi , Jang Soo Kim

A conjecture of Kalai from 1994 posits that for an arbitrary $2\leq k\leq \lfloor d/2 \rfloor$, the combinatorial type of a simplicial $d$-polytope $P$ is uniquely determined by the $(k-1)$-skeleton of $P$ (given as an abstract simplicial…

组合数学 · 数学 2022-04-28 Isabella Novik , Hailun Zheng

A $(d-1)$-dimensional simplicial complex $\Delta$ is balanced if its graph $G(\Delta)$ is $d$-colorable. Klee and Novik obtained the balanced lower bound theorem for balanced normal $(d-1)$-pseudomanifolds $\Delta$ with $d\geq3$ by showing…

组合数学 · 数学 2023-10-10 Ryoshun Oba

In 1971, McMullen and Walkup posed the following conjecture, which is called the generalized lower bound conjecture: If $P$ is a simplicial $d$-polytope then its $h$-vector $(h_0,h_1,...,h_d)$ satisfies $h_0 \leq h_1 \leq ... \leq…

组合数学 · 数学 2012-04-06 Satoshi Murai , Eran Nevo

A centrally symmetric $2d$-vertex combinatorial triangulation of the product of spheres $\S^i\times\S^{d-2-i}$ is constructed for all pairs of non-negative integers $i$ and $d$ with $0\leq i \leq d-2$. For the case of $i=d-2-i$, the…

组合数学 · 数学 2011-02-03 Steven Klee , Isabella Novik

We prove that for $d\geq 3$, the 1-skeleton of any $(d-1)$-dimensional doubly Cohen Macaulay (abbreviated 2-CM) complex is generically $d$-rigid. This implies the following two corollaries (by Kalai and Lee respectively): Barnette's lower…

组合数学 · 数学 2008-09-05 Eran Nevo

Suppose $\Delta$ is a pure simplicial complex on $n$ vertices having dimension $d$ and let $c = n-d-1$ be its codimension in the simplex. Terai and Yoshida proved that if the number of facets of $\Delta$ is at least $\binom{n}{c}-2c+1$,…

组合数学 · 数学 2024-12-06 Anton Dochtermann , Ritika Nair , Jay Schweig , Adam Van Tuyl , Russ Woodroofe

A conjecture of Kalai asserts that for $d\geq 4$, the affine type of a prime simplicial $d$-polytope $P$ can be reconstructed from the space of affine $2$-stresses of $P$. We prove this conjecture for all $d\geq 5$. We also prove the…

组合数学 · 数学 2023-11-21 Satoshi Murai , Isabella Novik , Hailun Zheng

Kalai conjectured that if $P$ is a simplicial $d$-polytope that has no missing faces of dimension $d-1$, then the graph of $P$ and the space of affine $2$-stresses of $P$ determine $P$ up to affine equivalence. We propose a…

组合数学 · 数学 2024-03-26 Isabella Novik , Hailun Zheng

It is proved that a certain symmetric sequence of nonnegative integers arising in the enumeration of magic squares of given size n by row sums or, equivalently, in the generating function of the Ehrhart polynomial of the polytope of doubly…

组合数学 · 数学 2007-05-23 Christos A. Athanasiadis

A long-standing conjecture of Stanley states that every Cohen-Macaulay simplicial complex is partitionable. We disprove the conjecture by constructing an explicit counterexample. Due to a result of Herzog, Jahan and Yassemi, our…

组合数学 · 数学 2016-06-08 Art M. Duval , Bennet Goeckner , Caroline J. Klivans , Jeremy L. Martin

The $g$-theorem is a momentous result in combinatorics that gives a complete numerical characterization of the face numbers of simplicial convex polytopes. The $g$-conjecture asserts that the same numerical conditions given in the…

组合数学 · 数学 2024-07-02 Kai Fong Ernest Chong , Tiong Seng Tay

The concept of Cohen-Macaulay complexes emerged in the mid-1970s and swiftly became the focal point of an attractive and richly connected new area of mathematics, at the crossroads of combinatoics, commutative algebra and topology. As the…

组合数学 · 数学 2014-11-11 Anders Björner

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

组合数学 · 数学 2026-03-09 Yewen Sun

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…

交换代数 · 数学 2007-05-23 Uwe Nagel , Tim Roemer

Let $\Delta$ be a stable simplicial complex on $n$ vertexes. Over an arbitrary base field $K$, the symmetric algebraic shifted complex $\Delta^s$ of $\Delta$ is defined. It is proved that the Betti numbers of the Stanley-Reisner ideals in…

交换代数 · 数学 2007-05-23 Zhongming Tang , Guifen Zhuang

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…

组合数学 · 数学 2007-05-23 Anders Björner

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…

组合数学 · 数学 2012-10-05 Steven Klee , Isabella Novik
‹ 上一页 1 2 3 10 下一页 ›