English
Related papers

Related papers: Computing The Extension Complexities of All 4-Dime…

200 papers

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

Computational Geometry · Computer Science 2026-03-20 Alexander Munteanu , Simon Omlor , Jeff M. Phillips

This work solves an open question in finite-state compressibility posed by Lutz and Mayordomo about compressibility of real numbers in different bases. Finite-state compressibility, or equivalently, finite-state dimension, quantifies the…

Information Theory · Computer Science 2022-09-30 Satyadev Nandakumar , Subin Pulari

We study values of generalized polylogarithms at various points and relationships among them. Polylogarithms of small weight at the points 1/2 and -1 are completely investigated. We formulate a conjecture about the structure of the linear…

Number Theory · Mathematics 2012-04-17 S. A. Zlobin

It is known that every lattice polytope is unimodularly equivalent to a face of some reflexive polytope. A stronger question is to ask whether every $(0,1)$-polytope is unimodularly equivalent to a facet of some reflexive polytope. A large…

Combinatorics · Mathematics 2020-09-08 Takahiro Nagaoka , Akiyoshi Tsuchiya

Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…

Functional Analysis · Mathematics 2024-08-14 Jonas Knoerr , Jacopo Ulivelli

In this paper, we present upper bounds for the depth of some classes of polyhedra, including: polyhedra with finite fundamental group, polyhedra $P$ with abelian or free $\pi_1(P)$ and finitely generated $H_i(tilde{P};\mathbb{Z}$,…

Algebraic Topology · Mathematics 2023-08-01 Mojtaba Mohareri , Behrooz Mashayekhy

We prove that, for every norm on $\mathbb{R}^d$ and every $E \subseteq \mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\dim_{\mathrm{H}} E - (d-1)$. An explicit construction follows,…

Classical Analysis and ODEs · Mathematics 2024-11-05 Iqra Altaf , Ryan Bushling , Bobby Wilson

The groundbreaking work of Rothvo{\ss} [arxiv:1311.2369] established that every linear program expressing the matching polytope has an exponential number of inequalities (formally, the matching polytope has exponential extension…

Computational Complexity · Computer Science 2016-10-26 Gábor Braun , Sebastian Pokutta

Polygon spaces have been studied extensively, and yet missing from the literature is a simple property that every polygon has: dimension. This is distinct (possibly) from the dimension of the ambient space in which the polygon lives. A…

General Topology · Mathematics 2020-09-17 Jack Love

We show that there exists a family of Knapsack polytopes such that, for each polytope P from this family and each {\epsilon} > 0, any {\epsilon}-approximated formulation of P in the original space R^n requires a number of inequalities that…

Optimization and Control · Mathematics 2015-03-18 Yuri Faenza , Laura Sanità

A tensor extension of the Poincar\'e algebra is proposed for the arbitrary dimensions. Casimir operators of the extension are constructed. A possible supersymmetric generalization of this extension is also found in the dimensions $D=2,3,4$.

High Energy Physics - Theory · Physics 2009-11-10 Dmitrij V. Soroka , Vyacheslav A. Soroka

We study polynomial growth holomorphic functions and forms on complete gradient shrinking Ricci solitons. By relating to the spectral data of the $f$-Laplacian, we show that the dimension of the space of polynomial growth holomorphic…

Differential Geometry · Mathematics 2026-05-12 Fei He , Jianyu Ou

We give an upper bound on the topological complexity of varieties $\mathcal{V}$ obtained as complements in $\mathbb{C}^m$ of the zero locus of a polynomial. As an application, we determine the topological complexity of unordered…

Algebraic Topology · Mathematics 2020-10-20 Andrea Bianchi

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Discrete Mathematics · Computer Science 2018-04-26 David Avis , David Bremner , Hans Raj Tiwary , Osamu Watanabe

We determine the minimal volume of arithmetic hyperbolic orientable n-dimensional orbifolds (compact and non-compact) for every odd dimension n>3. Combined with the previously known results it solves the minimal volume problem for…

Group Theory · Mathematics 2014-02-26 Mikhail Belolipetsky , Vincent Emery

Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2,…

Metric Geometry · Mathematics 2007-05-23 Greg Martin

Let $X$ be a normal projective variety of dimension $d$, and let $f$ be a zero-entropy automorphism of $X$. Denote by $k$ the first-degree growth rate of $f$, so that $\deg_1(f^n) \asymp n^{k}$. We prove the sharp lower bound for the…

Algebraic Geometry · Mathematics 2026-05-12 Fei Hu , Chen Jiang

Possible short and semi-short representations for $\N=2$ and $\N=4$ superconformal symmetry in four dimensions are discussed. For $\N=4$ the well known short supermultiplets whose lowest dimension conformal primary operators correspond to…

High Energy Physics - Theory · Physics 2009-11-07 F. A. Dolan , H. Osborn

In this paper we develop methods to extend the minimal hypersurface approach to positive scalar curvature problems to all dimensions. This includes a proof of the positive mass theorem in all dimensions without a spin assumption. It also…

Differential Geometry · Mathematics 2017-04-20 Richard Schoen , Shing-Tung Yau

Given a chiral d-polytope K with regular facets, we describe a construction for a chiral (d + 1)-polytope P with facets isomorphic to K. Furthermore, P is finite whenever K is finite. We provide explicit examples of chiral 4-polytopes…

Combinatorics · Mathematics 2014-04-08 Gabe Cunningham , Daniel Pellicer
‹ Prev 1 8 9 10 Next ›