English
Related papers

Related papers: Tight orientably-regular polytopes

200 papers

We show that every $PD_3$-complex $P$ bounds a $PD_4$-pair $(Z,P)$. If $P$ is orientable we may assume that $\pi_1(Z)=1$. We show also that if $P$ has a manifold 1-skeleton then it is homotopy equivalent to a closed 3-manifold, and that if…

Geometric Topology · Mathematics 2023-01-18 Jonathan A. Hillman

A self-avoiding polygon is a lattice polygon consisting of a closed self-avoiding walk on a square lattice. Surprisingly little is known rigorously about the enumeration of self-avoiding polygons, although there are numerous conjectures…

Combinatorics · Mathematics 2019-08-15 Kyungpyo Hong , Seungsang Oh

Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…

Metric Geometry · Mathematics 2020-09-07 Martin Winter

Given a bounded convex open set $\Omega\subseteq \mathbb R^N$, we prove that the Poincar\'e-Sobolev constants $\lambda_{p,q}(\Omega)$ can be bounded from below by the $p$-power of the ratio between the perimeter of $\Omega$ and a suitable…

Analysis of PDEs · Mathematics 2026-04-15 Giovanni Pisante , Francesca Prinari

We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…

Probability · Mathematics 2020-03-02 Gil Kur

A simplicial polytope is combinatorially rigid if its combinatorial structure is determined by its graded Betti numbers which are important invariant coming from combinatorial commutative algebra. We find a necessary condition to be…

Combinatorics · Mathematics 2011-08-30 Suyoung Choi , Jang Soo Kim

This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…

Number Theory · Mathematics 2019-02-14 Marcin Mazur , Bogdan V. Petrenko

We establish several sufficient conditions for the strong ellipticity of any fourth-order elasticity tensor in this paper. The first presented sufficient condition is an extension of positive definite matrices, which states that the strong…

Numerical Analysis · Mathematics 2017-05-30 Weiyang Ding , Liqun Qi , Hong Yan

We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…

Combinatorics · Mathematics 2011-12-14 Joseph Gubeladze

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

Combinatorics · Mathematics 2018-11-20 Eran Nevo , Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

In this paper, we get the sharp bound for $|G/O_p(G)|_p$ under the assumption that either $p^2 \nmid \chi(1)$ for all $\chi \in {\rm Irr}(G)$ or $p^2 \nmid \phi(1)$ for all $\phi \in {\rm IBr}_p(G)$. This would settle two conjectures raised…

Group Theory · Mathematics 2021-02-19 Guohua Qian , Yong Yang

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…

Geometric Topology · Mathematics 2007-05-29 Jaejeong Lee

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

Combinatorics · Mathematics 2024-01-30 Joshua Hinman

In the previous work, we study the moment polytope of the closure of the complex subtorus orbit in a symplectic toric manifold associated to an affine subspace when the closure is a smooth complex submanifold. In this paper, we clarify the…

Symplectic Geometry · Mathematics 2026-05-07 Kentaro Yamaguchi

We consider the quotient group $T(G)$ of the multiple holomorph by the holomorph of a finite $p$-group $G$ of class two for an odd prime $p$. By work of the first-named author, we know that $T(G)$ contains a cyclic subgroup of order…

Group Theory · Mathematics 2024-03-05 A. Caranti , Cindy Tsang

In this paper, we deal with the question; under what conditions the points $P_i(xi,yi)$ $(i = 1,\cdots, n)$ form a convex polygon provided $x_1 < \cdots < x_n$ holds. One of the main findings of the paper can be stated as follows: "Let…

Metric Geometry · Mathematics 2024-04-19 Angshuman Robin Goswami , István Szalkai

This paper gives a necessary and sufficient condition for robust D-stability of Polytopic Polynomial Matrices. Edge theorem is extended to multi-input-multi-output case.

Optimization and Control · Mathematics 2007-05-23 Long Wang , Zhizhen Wang , Wensheng Yu

An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…

Number Theory · Mathematics 2018-09-26 Su Hu , Min-Soo Kim , Min Sha

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

Geometric Topology · Mathematics 2018-10-24 Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

Let $G$ be the split orthogonal group of degree $2n$ over an arbitrary infinite field $\mathbb{F}$ of chararcteristic not $2$. In this paper, we classify multiple flag varieties $G/P_1\times\cdots\times G/P_k$ of finite type. Here a…

Representation Theory · Mathematics 2019-03-18 Toshihiko Matsuki