English
Related papers

Related papers: A cubical Squier's theorem

200 papers

We prove a theorem relating torus-equivariant coherent sheaves on toric varieties to polyhedrally-constructible sheaves on a vector space. At the level of K-theory, the theorem recovers Morelli's description of the K-theory of a smooth…

Algebraic Geometry · Mathematics 2011-09-23 Bohan Fang , Chiu-Chu Melissa Liu , David Treumann , Eric Zaslow

In this semi-expository paper we review the notion of a spherical space. In particular we present some recent results of Wedhorn on the classification of spherical spaces over arbitrary fields. As an application, we introduce and classify…

Algebraic Geometry · Mathematics 2018-08-17 Mahir Bilen Can

The so-called algebraic approach to the constraint satisfaction problem (CSP) has been a prevalent method of the study of complexity of these problems since early 2000's. The core of this approach is the notion of polymorphisms which…

Logic in Computer Science · Computer Science 2026-05-15 Maximilian Hadek , Tomáš Jakl , Jakub Opršal

String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as…

Logic in Computer Science · Computer Science 2022-02-04 Filippo Bonchi , Fabio Gadducci , Aleks Kissinger , Pawel Sobocinski , Fabio Zanasi

We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…

Combinatorics · Mathematics 2008-04-08 Hjalmar Rosengren

We propose a new cubical type theory, termed (self-deprecatingly) the naive cubical type theory, and study its semantics using the universe category framework, which is similar to Uemura's categories with representable morphisms. In…

Logic in Computer Science · Computer Science 2025-12-22 Chris Kapulkin , Yufeng Li

In this article we construct a categorical resolution of singularities of an excellent reduced curve $X$, introducing a certain sheaf of orders on $X$. This categorical resolution is shown to be a recollement of the derived category of…

Algebraic Geometry · Mathematics 2016-04-26 Igor Burban , Yuriy Drozd , Volodymyr Gavran

Gillespie's Theorem gives a systematic way to construct model category structures on $\mathscr{C}( \mathscr{M} )$, the category of chain complexes over an abelian category $\mathscr{M}$. We can view $\mathscr{C}( \mathscr{M} )$ as the…

Representation Theory · Mathematics 2019-09-13 Henrik Holm , Peter Jorgensen

The authors developed in a recent paper natural dualities for finitely generated quasivarieties of Sugihara algebras. They thereby identified the admissibility algebras for these quasivarieties which, via the Test Spaces Method devised by…

Rings and Algebras · Mathematics 2019-03-12 L. M. Cabrer , H. A. Priestley

A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…

Computational Complexity · Computer Science 2018-10-30 Manuel Bodirsky , Marcello Mamino

We show here that the refined theorems for both lecture hall partitions and anti-lecture hall compositions can be obtained as straightforward consequences of two q-Chu Vandermonde identities, once an appropriate recurrence is derived. We…

Combinatorics · Mathematics 2007-05-23 S. Corteel , C. D. Savage

The functions satisfying the mean value property for an n-dimensional cube are determined explicitly. This problem is related to invariant theory for a finite reflection group, especially to a system of invariant differential equations.…

Combinatorics · Mathematics 2011-10-26 Katsunori Iwasaki

Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…

Logic in Computer Science · Computer Science 2023-02-15 Nicolai Kraus , Jakob von Raumer

In constructive recognition of a representation of a Classical group $G$, much attention has been paid to the natural representation as well as to generic (Black Box) algorithms that treat all representations uniformly. There are…

Group Theory · Mathematics 2015-07-22 Brian Philip Corr

A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

Optimization and Control · Mathematics 2013-03-07 Peter Seiler , Qian Zheng , Gary Balas

We develop a categorical approach to quivers and their modules. Naturally this leads to a notion of an action of a monoidal category on quivers. Using this, we construct for a large class of quivers rigid monoidal structures on their…

Quantum Algebra · Mathematics 2026-05-07 Gregor Schaumann

This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…

Geometric Topology · Mathematics 2025-02-11 Daniel An , Ruth Lawrence , Dennis Sullivan

Our paper originated from a generalization of the Volume Conjecture to multisums of $q$-hypergeometric terms. This generalization was sketched by Kontsevich in a problem list in Aarhus University in 2006; \cite{Ko}. We introduce the notion…

Algebraic Geometry · Mathematics 2010-09-02 Stavros Garoufalidis

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

Logic in Computer Science · Computer Science 2016-11-14 Cyril Cohen , Thierry Coquand , Simon Huber , Anders Mörtberg

We define a computational type theory combining the contentful equality structure of cartesian cubical type theory with internal parametricity primitives. The combined theory supports both univalence and its relational equivalent, which we…

Logic in Computer Science · Computer Science 2023-06-22 Evan Cavallo , Robert Harper