English
Related papers

Related papers: A Universality Theorem for Nested Polytopes

200 papers

Let $\rho$ be a metric on the set $X=\{1,2,\dots,n+1\}$. Consider the $n$-dimensional polytope of functions $f:X\rightarrow \mathbb{R}$, which satisfy the conditions $f(n+1)=0$, $|f(x)-f(y)|\leq \rho(x,y)$. The question on classifying…

Combinatorics · Mathematics 2016-08-25 J. Gordon , F. Petrov

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

Combinatorics · Mathematics 2019-12-10 Bo Lin , Ngoc Mai Tran

We prove that a semiregular topological space $X$ is completely regular if and only if its topology is generated by a normal quasi-uniformity. This characterization implies that each regular paratopological group is completely regular. This…

General Topology · Mathematics 2021-11-01 Taras Banakh , Alex Ravsky

We extend some of the results of Agler, Knese, and McCarthy [1] to $n$-tuples of commuting isometries for $n>2$. Let $\mathbb{V}=(V_1,\dots,V_n)$ be an $n$-tuple of a commuting isometries on a Hilbert space and let Ann$(\mathbb{V})$ denote…

Functional Analysis · Mathematics 2016-04-26 Edward J. Timko

For a complete noncompact connected Riemannian manifold with bounded geometry, we prove a compactness result for sequences of finite perimeter sets with uniformly bounded volume and perimeter in a larger space obtained by adding limit…

Metric Geometry · Mathematics 2015-04-21 Abraham Enrique Muñoz Flores , Stefano Nardulli

Rado's theorem about permutahedra and dominance order on partitions reveals that each Schur polynomial is M-convex, or equivalently, it has a saturated Newton polytope and this polytope is a generalized permutahedron as well. In this paper…

Combinatorics · Mathematics 2024-01-29 Bo Wang , Candice X. T. Zhang , Zhong-Xue Zhang

Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…

Data Structures and Algorithms · Computer Science 2018-07-03 Matthew P. Johnson

According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of faces whose dimension is congruent to i modulo m with the…

Combinatorics · Mathematics 2011-07-11 Laszlo Major

Fagin defined the class $NP$ by the means of Existential Second-Order logic. Feder and Vardi expressed it (up to polynomial equivalence) by special fragments of Existential Second-Order logic (SNP), while the authors used forbidden expanded…

Computational Complexity · Computer Science 2026-01-09 Gábor Kun , Jaroslav Nešetřil

We consider parametrized systems of generalized polynomial equations (with real exponents) in $n$ positive variables, involving $m$ monomials with positive parameters; that is, $x\in\mathbb{R}^n_>$ such that ${A \, (c \circ x^B)=0}$ with…

Algebraic Geometry · Mathematics 2026-05-29 Abhishek Deshpande , Stefan Müller

For each $n$, we construct a separable metric space $\mathbb{U}_n$ that is universal in the coarse category of separable metric spaces with asymptotic dimension ($\mathop{asdim}$) at most $n$ and universal in the uniform category of…

Geometric Topology · Mathematics 2017-08-14 G. C. Bell , A. Nagórko

We extend Makkai duality between coherent toposes and ultracategories to a duality between toposes with enough points and ultraconvergence spaces. Our proof generalizes and simplifies Makkai's original proof. Our main result can also be…

Category Theory · Mathematics 2026-02-24 Sam van Gool , Jérémie Marquès , Umberto Tarantino

This paper belongs to a group of work in the intersection of symbolic computation and group analysis aiming for the symbolic analysis of differential equations. The goal is to extract important properties without finding the explicit…

Symbolic Computation · Computer Science 2024-01-31 Veronika Treumova , Dmitry A. Lyakhov , Dominik L. Michels

We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be…

Computer Science and Game Theory · Computer Science 2017-03-28 Linda Farczadi , Natália Guričanová

We consider a natural question: "Is it true that each homotopy domination of a polyhedron over itself is a homotopy equivalence?" and a strongly related problem of K. Borsuk (1967): "Is it true that two ANR's homotopy dominating each other…

Geometric Topology · Mathematics 2014-11-05 Danuta Kołodziejczyk

Let $X$ and $Y$ be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group $G$. Assuming that $Y$ is $d$-connected and $\dim X\le 2d$, for some $d\geq 1$, we provide an…

Algebraic Topology · Mathematics 2016-10-10 Martin Čadek , Marek Krčál , Lukáš Vokřínek

In this paper we study the ring $\mathcal{P}$ of combinatorial convex polytopes. We introduce the algebra of operators $\mathcal{D}$ generated by the operators $d_k$ that send an $n$-dimensional polytope $P^n$ to the sum of all its…

Combinatorics · Mathematics 2010-02-04 Victor M. Buchstaber , Nickolai Erokhovets

Working within the context of countable, superstable theories, we give many equivalents of a theory having NOTOP. In particular, NOTOP is equivalent to V-DI, the assertion that any type $V$-dominated by an independent triple is isolated…

Logic · Mathematics 2025-09-24 Michael C. Laskowski , Danielle S. Ulrich

In this paper we introduce a homotopy theoretic technique for proving that the $K$-theoretic assembly map is an equivalence. It is an extension of the methods used to prove split injectivity of the assembly and applies to any geometrically…

Algebraic Topology · Mathematics 2026-01-19 Gunnar Carlsson , Boris Goldfarb

In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…

Combinatorics · Mathematics 2024-01-01 Luca Ferrarini , Samuel Fiorini , Stefan Kober , Yelena Yuditsky