English
Related papers

Related papers: Quadratic Gr\"obner bases arising from partially o…

200 papers

Let $n\le 5$ be an integer, and let $\Gamma$ be a finite group. We prove that if $\rho , \rho': \Gamma \to O(n)$ are two representations that are conjugate by an orientation-preserving diffeomorphism, then they are conjugate by an element…

Group Theory · Mathematics 2024-04-03 Luis Eduardo García-Hernández , Ben Williams

Let $P$ be a set of $n$ points on the plane in general position. We say that a set $\Gamma$ of convex polygons with vertices in $P$ is a convex decomposition of $P$ if: Union of all elements in $\Gamma$ is the convex hull of $P,$ every…

Computational Geometry · Computer Science 2012-07-19 Mario Lomeli-Haro

Given a graph $G$, its genus polynomial is $\Gamma_G(x) = \sum_{k\geq 0} g_k(G)x^k$, where $g_k(G)$ is the number of 2-cell embeddings of $G$ in an orientable surface of genus $k$. The Log-Concavity Genus Distribution (LCGD) Conjecture…

Combinatorics · Mathematics 2022-12-21 MacKenzie Carr , Varpreet Dhaliwal , Bojan Mohar

Let $\Gamma$ be a finite group acting faithfully and linearly on a vector space $V$. Let $T(V)$ ($S(V)$) be the tensor (symmetric) algebra associated to $V$ which has a natural $\Gamma$ action. We study generalized quadratic relations on…

Quantum Algebra · Mathematics 2008-07-02 Gilles Halbout , Jean-Michel Oudom , Xiang Tang

We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…

Combinatorics · Mathematics 2008-06-14 Yuri Faenza , Volker Kaibel

We give two new constructions of the harmonic algebra of a lattice polytope $P$, a bigraded algebra whose character is the $q$-Ehrhart series of $P$ defined by Reiner and Rhoades. First, we show that the harmonic algebra is the associated…

Combinatorics · Mathematics 2025-08-27 Ian Cavey

Given a set $\Gamma$ of low-degree k-dimensional varieties in $\mathbb{R}^n$, we prove that for any $D \ge 1$, there is a non-zero polynomial $P$ of degree at most $D$ so that each component of $\mathbb{R}^n \setminus Z(P)$ intersects…

Algebraic Geometry · Mathematics 2015-10-28 Larry Guth

We study singularities obtained by the contraction of the maximal divisor in compact (non kaehlerian) surfaces which contain global spherical shells. These singularities are of genus 1 or 2, may be Q-Gorenstein, numerically Gorenstein or…

Complex Variables · Mathematics 2008-01-07 Georges Dloussky

This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…

Optimization and Control · Mathematics 2022-09-28 Jong-Shi Pang , Shaoning Han

The matching polytope of a graph $G$ is the convex hull of the indicator vectors of the matchings on $G$. We characterize the graphs whose associated matching polytopes are Gorenstein, and then prove that all Gorenstein matching polytopes…

Combinatorics · Mathematics 2024-07-15 Benjamin Eisley , Koji Matsushita , Andrés R. Vindas-Meléndez

We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute…

Combinatorics · Mathematics 2024-12-20 Marco Barbieri , Valentina Grazian , Pablo Spiga

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Combinatorics · Mathematics 2025-01-30 Boris Bukh , Zichao Dong

We explore in this paper some orthogonal polynomials which are naturally associated to certain families of coherent states, often referred to as nonlinear coherent states in the quantum optics literature. Some examples turn out to be known…

Mathematical Physics · Physics 2015-06-03 S. Twareque Ali , Mourad E. H. Ismail

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

Combinatorics · Mathematics 2026-04-21 Ahmad Abdi , Gérard Cornuéjols , Daniel Dadush , Mahsa Dalirrooyfard

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

Combinatorics · Mathematics 2025-10-17 C. Terry , J. Wolf

Let $\Gamma$ be a connected, triangle-free, planar graph with at least five vertices that has no separating vertices or edges. If the graph $\Gamma$ is $\mathcal{CFS}$, we prove that the right-angled Coxeter group $G_\Gamma$ is virtually a…

Group Theory · Mathematics 2019-10-30 Hoang Thanh Nguyen , Hung Cong Tran

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Category Theory · Mathematics 2007-05-23 Roman R. Zapatrin

We introduce the reverse Chv\'atal-Gomory rank r*(P) of an integral polyhedron P, defined as the supremum of the Chv\'atal-Gomory ranks of all rational polyhedra whose integer hull is P. A well-known example in dimension two shows that…

Optimization and Control · Mathematics 2014-09-29 Michele Conforti , Alberto Del Pia , Marco Di Summa , Yuri Faenza , Roland Grappe

The type-PQ adjacency polytope associated to a simple graph is a $0/1$-polytope containing valuable information about an underlying power network. Chen and the first author have recently demonstrated that, when the underlying graph $G$ is…

Combinatorics · Mathematics 2024-07-17 Robert Davis , Joakim Jakovleski , Qizhe Pan

We define a new variety of loops we call $\Gamma$-loops. After showing $\Gamma$-loops are power associative, our main goal will be showing a categorical isomorphism between Bruck loops of odd order and $\Gamma$-loops of odd order. Once this…

Group Theory · Mathematics 2013-02-12 Mark Greer
‹ Prev 1 3 4 5 6 7 10 Next ›