English
Related papers

Related papers: Term rewriting on nestohedra

200 papers

In this paper we present a new termination proof and complexity analysis of unfolding graph rewriting which is a specific kind of infinite graph rewriting expressing the general form of safe recursion. We introduce a termination order over…

Logic in Computer Science · Computer Science 2014-06-23 Naohi Eguchi

We use the differential algebra of polytopes to explain the known remarkable relation of the combinatorics of the associahedra and permutohedra with the universal compositional and multiplicative inversion formulas for the formal power…

Combinatorics · Mathematics 2025-02-11 V. M. Buchstaber , A. P. Veselov

Deformation theory is treated for locally notherian formal schemes (non necessarily smooth). The cotangent complex is defined in the derived category through the homology localization functor. The basic properties and results of a…

Algebraic Geometry · Mathematics 2024-02-06 Marta Pérez Rodríguez

We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…

Combinatorics · Mathematics 2020-05-19 Sara C. Billey , Matjaž Konvalinka , Joshua P. Swanson

In (hyper)coherence semantics, proofs/terms are cliques in (hyper)graphs. Intuitively, vertices represent results of computations and the edge relation witnesses the ability of being assembled into a same piece of data or a same (strongly)…

Logic in Computer Science · Computer Science 2007-05-23 Pierre Boudes

Indexed symmetric monoidal categories are an important refinement of bicategories -- this structure underlies several familiar bicategories, including the homotopy bicategory of parametrized spectra, and its equivariant and fiberwise…

Category Theory · Mathematics 2023-06-21 Cary Malkiewich , Kate Ponto

Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…

General Topology · Mathematics 2023-06-27 Raushan Buzyakova

Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…

Logic in Computer Science · Computer Science 2019-05-14 Lê Thành Dũng Nguyên

We develop a class of algebraic interpretations for many-sorted and higher-order term rewriting systems that takes type information into account. Specifically, base-type terms are mapped to \emph{tuples} of natural numbers and higher-order…

Symbolic Computation · Computer Science 2021-05-05 Deivid Vale , Cynthia Kop

We provide a framework for abstract reconstruction problems using the $K$-theory of categories with covering families, which we then apply to reformulate the edge reconstruction conjecture in graph theory. Along the way, we state some…

K-Theory and Homology · Mathematics 2025-06-17 Maxine E. Calle , Julian J. Gould

We continue the development of the infinitesimal deformation theory of pasting diagrams of k-linear categories begun in Yetter, D.N. "On Deformations of Pasting Diagrams", Theory and Applications of Categories 22 (2009) 24-53. In that…

Category Theory · Mathematics 2013-03-15 Tej Shreshtha , D. N. Yetter

We prove, for an arbitrary finite root system, the periodicity conjecture of Al.B.Zamolodchikov concerning Y-systems, a particular class of functional relations arising in the theory of thermodynamic Bethe ansatz. Algebraically, Y-systems…

High Energy Physics - Theory · Physics 2007-05-23 Sergey Fomin , Andrei Zelevinsky

Caucal hierarchy is a well-known class of graphs with decidable monadic theories. It were proved by L. Braud and A. Carayol that well-orderings in the hierarchy are the well-orderings with order types less than $\varepsilon_0$. Naturally,…

Logic · Mathematics 2015-12-17 Fedor Pakhomov

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

Combinatorics · Mathematics 2025-06-30 Sean Mandrick

We prove that rigid cohomology can be computed as the cohomology of a site analogous to the crystalline site. Berthelot designed rigid cohomology as a common generalization of crystalline and Monsky-Washnitzer cohomology. Unfortunately,…

Algebraic Geometry · Mathematics 2007-07-13 Bernard Le Stum

An associahedron is a polytope whose vertices correspond to the triangulations of a convex polygon and whose edges correspond to flips between them. A particularly elegant realization of the associahedron, due to S. Shnider and S. Sternberg…

Combinatorics · Mathematics 2013-12-17 Vincent Pilaud

In this paper, the first in a projected two-part series, we describe an organizing framework for the study of infinitary combinatorics. This framework is \v{C}ech cohomology. We show in particular that the \v{C}ech cohomology groups of the…

Logic · Mathematics 2019-04-17 Jeffrey Bergfalk , Chris Lambie-Hanson

mu-constant families of holomorphic function germs with isolated singularities are considered from a global perspective. First, a monodromy group from all families which contain a fixed singularity is studied. It consists of automorphisms…

Algebraic Geometry · Mathematics 2011-08-03 Claus Hertling

We show how to use topological ideas, such as compactness, to establish orderability properties of infinite groups. A new application is to provide a left-ordering for the group of PL homeomorphisms of a connected surface with boundary…

Group Theory · Mathematics 2014-03-20 Dale Rolfsen

A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…

Combinatorics · Mathematics 2011-01-26 Matthew J. Samuel