English
Related papers

Related papers: Combinatorial construction of toric residues

200 papers

We prove that every mapping torus of any free group endomorphism is residually finite. We show how to use a not yet published result of E. Hrushovski to extend our result to arbitrary linear groups. The proof uses algebraic self-maps of…

Group Theory · Mathematics 2009-11-10 Alexander Borisov , Mark Sapir

In this article we prove that the adjoint polynomial of arbitrary convex polytopes is up to scaling uniquely determined by vanishing to the right order on the polytopes residual arrangement. This answers a problem posed by Kohn and Ranestad…

Combinatorics · Mathematics 2025-11-18 Clemens Brüser , Julian Weigert

A hypertoric variety is a quaternionic analogue of a toric variety. Just as the topology of toric varieties is closely related to the combinatorics of polytopes, the topology of hypertoric varieties interacts richly with the combinatorics…

Algebraic Geometry · Mathematics 2021-06-18 Nicholas Proudfoot , Ben Webster

In this paper we study a new combinatorial invariant of simple polytopes, which comes from toric topology. With each simple n-polytope P with m facets we can associate a moment-angle complex Z_P with a canonical action of the torus T^m.…

Algebraic Topology · Mathematics 2017-10-27 Nickolai Erokhovets

In this paper, cylindric partitions into profiles $c=(1,1)$ and $c=(2,0)$ are considered. The generating functions into unrestricted cylindric partitions and cylindric partitions into distinct parts with these profiles are constructed. The…

Combinatorics · Mathematics 2023-02-06 Kağan Kurşungöz , Halime Ömrüuzun Seyrek

A polytrope is a tropical polytope which at the same time is convex in the ordinary sense. A $d$-dimensional polytrope turns out to be a tropical simplex, that is, it is the tropical convex hull of $d+1$ points. This statement is equivalent…

Combinatorics · Mathematics 2010-03-24 Michael Joswig , Katja Kulas

In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As…

Information Theory · Computer Science 2015-06-26 Ivan Soprunov

We construct a collection of matrices defined by quadratic residue symbols, termed "quadratic residue matrices", associated to the splitting behavior of prime ideals in a composite of quadratic extensions of $\mathbb{Q}$, and prove a simple…

Number Theory · Mathematics 2015-12-22 David S. Dummit , Evan P. Dummit , Hershy Kisilevsky

The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of…

Algebraic Topology · Mathematics 2007-05-23 Victor M. Buchstaber , Taras E. Panov

We review, from a didactic point of view, the definition of a toric section and the different shapes it can take. We'll then discuss some properties of this curve, investigate its analogies and differences with the most renowned conic…

History and Overview · Mathematics 2017-08-28 Luca Moroni

Given a set $\mathcal A = \{a_1,\ldots,a_n\} \subset \mathbb{N}^m$ of nonzero vectors defining a simplicial toric ideal $I_{\mathcal A} \subset k[x_1,...,x_n]$, where $k$ is an arbitrary field, we provide an algorithm for checking whether…

Commutative Algebra · Mathematics 2017-01-17 Isabel Bermejo , Ignacio García-Marco

A map Y -> P^n is determined by a line bundle quotient of (O_Y)^{n+1}. In this paper, we generalize this description to the case of maps from Y to an arbitrary smooth toric variety. The data needed to determine such a map consists of a…

alg-geom · Mathematics 2008-02-03 David A. Cox

This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…

Combinatorics · Mathematics 2014-12-02 Michael Gene Dobbins

The problem of finding independent components of an indexed object (e.g., a tensor) with arbitrary number of indices and arbitrary linear symmetries is discussed. It is proved that the number of independent components $f(k)$ is a polynomial…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Sergei A. Klioner

Our aim is to bring the theory of analogous polytopes to bear on the study of quasitoric manifolds, in the context of stably complex manifolds with compatible torus action. By way of application, we give an explicit construction of a…

Algebraic Topology · Mathematics 2011-11-09 Victor M. Buchstaber , Taras E. Panov , Nigel Ray

In this paper we investigate iteration of maps on lattices and the corresponding polynomial-like iterative equation. Since a lattice need not have a metric space structure, neither the Schauder fixed point theorem nor the Banach fixed point…

Dynamical Systems · Mathematics 2021-05-10 Chaitanya Gopalakrishna , Weinian Zhang

An $(n+1)$-toroid is a quotient of a tessellation of the $n$-dimensional Euclidean space with a lattice group. Toroids are generalizations of maps in the torus on higher dimensions and also provide examples of abstract polytopes. Equivelar…

Combinatorics · Mathematics 2018-02-23 José Collins , Antonio Montero

Using equivariant localization formulas we give a formula for conformal blocks at level one on the sphere as suitable polynomials. Using this presentation we give a generating set in the space of conformal blocks at any level if the marked…

Quantum Algebra · Mathematics 2009-11-18 R. Rimanyi , A. Varchenko

This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…

Algebraic Geometry · Mathematics 2009-09-25 J. Maurice Rojas

We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…

Combinatorics · Mathematics 2014-03-06 William Kuszmaul