English
Related papers

Related papers: Affine stresses, inverse systems, and reconstructi…

200 papers

We show that the graph of a simplicial polytope of dimension $d \ge 3$ has no nontrivial minimum edge cut with fewer than $d(d+1)/2$ edges, hence the graph is $\min\{\delta, d(d+1)/2\}$-edge-connected where $\delta$ denotes the minimum…

Combinatorics · Mathematics 2023-11-14 Vincent Pilaud , Guillermo Pineda-Villavicencio , Julien Ugon

A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of…

Combinatorics · Mathematics 2016-11-22 Erkko Lehtonen

In 1967, Gr\"unbaum conjectured that the function $$ \phi_k(d+s,d):=\binom{d+1}{k+1}+\binom{d}{k+1}-\binom{d+1-s}{k+1},\; \text{for $2\le s\le d$} $$ provides the minimum number of $k$-faces for a $d$-dimensional polytope (abbreviated as a…

Combinatorics · Mathematics 2025-01-24 Guillermo Pineda-Villavicencio , Jie Wang , David Yost

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2013-10-16 Danko Adrovic , Jan Verschelde

We study affine fusion with the adjoint representation. For simple Lie algebras, elementary and universal formulas determine the decomposition of a tensor product of an integrable highest-weight representation with the adjoint…

Mathematical Physics · Physics 2016-07-27 Andrew Urichuk , Mark A. Walton

We study the existence and structure of $d$-polytopes for which the number $f_1$ of edges is small compared to the number $f_0$ of vertices. Our results are more elegantly expressed in terms of the excess degree of the polytope, defined as…

Combinatorics · Mathematics 2024-05-28 Guillermo Pineda-Villavicencio , Jie Wang , David Yost

It is shown that any smooth strictly convex global solution of $$\det(\frac{\partial^{2}u}{\partial \xi_{i}\partial \xi_{j}}) = \exp \left\{-\sum_{i=1}^n d_i \frac{\partial u}{\partial \xi_{i}} - d_0\right\},$$ where $d_0$, $d_1$,...,$d_n$…

Differential Geometry · Mathematics 2007-10-22 An-Min Li , Ruiwei Xu

Given $d,n \in \mathbb{N}$, we write a polynomial $F \in \mathbb{C}[x_1,\dots,x_n]$ to be degenerate if there exist $P\in \mathbb{C}[y_1, \dots, y_{n-1}]$ and $m_j = x_1^{v_{j,1}}\dots x_n^{v_{j,n}}$ with $v_{j,1}, \dots, v_{j,n} \in…

Combinatorics · Mathematics 2023-08-09 Akshat Mudgal

We have proved the following Problem:{\it Let $R$ be a $\mathbb{C}$-affine domain, let $T$ be an element in $R \setminus \mathbb{C}$ and let $i : \mathbb{C}[T] \hookrightarrow R$ be the inclusion. Assume that $R/TR \cong_{\mathbb{C}}…

Commutative Algebra · Mathematics 2020-05-12 Sususu Oda

A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…

Combinatorics · Mathematics 2016-02-10 Steven Klee , Isabella Novik

In the first part of this article, we complete the program announced in the preliminary note [8] by proving a conjecture presented in [9] that states the equivalence of contractibility and p_{1}-stability for generalized spaces of formal…

Analysis of PDEs · Mathematics 2012-05-01 Alessandro Carlotto

We try to understand the geometric properties of $n$-manifolds ($n\geq 2$) with geometric structures modeled on $(\bR P^n, \PGL(n+1, \bR))$, i.e., $n$-manifolds with projectively flat torsion free affine connections. We define the notion of…

Geometric Topology · Mathematics 2007-05-23 Suhyoung Choi

A remarkable and important property of face numbers of simplicial polytopes is the generalized lower bound inequality, which says that the $h$-numbers of any simplicial polytope are unimodal. Recently, for balanced simplicial $d$-polytopes,…

Combinatorics · Mathematics 2015-03-24 Martina Juhnke-Kubitzke , Satoshi Murai

A well-known theorem of Blind and Mani says that every simple polytope is uniquely determined by its graph. Kalai gave a very short and elegant proof of this result using the concept of acyclic orientations. As it turns out, Kalai's proof…

Combinatorics · Mathematics 2007-05-23 Michael Joswig

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2014-05-05 Danko Adrovic , Jan Verschelde

Let $M^d$ be the spherical, Euclidean, or hyperbolic space of dimension $d\ge n+1$. Given any degenerate $(n+1)$-simplex $\mathbf{A}$ in $M^d$ with non-degenerate $n$-faces $F_i$, there is a natural partition of the set of $n$-faces into…

Metric Geometry · Mathematics 2019-11-07 Lizhao Zhang

Let $A,B \subseteq \mathbb{R}^d $ both span $\mathbb{R}^d$ such that $\langle a, b \rangle \in \{0,1\}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (d+1) 2^d $. This allows us to settle a conjecture by Bohn, Faenza,…

Combinatorics · Mathematics 2020-08-18 Andrey Kupavskii , Stefan Weltge

We study simply-laced simple affine Lie algebra bundles over complex surfaces X. Given any Kodaira curve C in X, we construct such a bundle over X. After deformations, it becomes trivial on every irreducible component of C provided that…

Algebraic Geometry · Mathematics 2013-03-25 Yunxia Chen , Naichung Conan Leung

Suppose that $C$ is a centrally symmetric $d$-dimensional convex polytope; in 1989 Kalai conjectured that $C$ has at least $3^d$ facets. We prove this result if there are $d$ hyperplanes with orthogonal normal vectors so that $C$ is…

Combinatorics · Mathematics 2023-08-08 Gregory R. Chambers , Elia Portnoy

For given integers $n$ and $d$, both at least 2, we consider a homogeneous multivariate polynomial $f_d$ of degree $d$ in variables indexed by the edges of the complete graph on $n$ vertices and coefficients depending on cardinalities of…

Combinatorics · Mathematics 2022-05-09 Sven Polak