Related papers: The equivalence between many-to-one polygraphs and…
We define a notion on preadditive categories which plays a role similar to the notion of a Grothendieck pretopology on an unenriched category. Each such additive pretopology defines an additive Grothendieck topology and suffices to define…
We show that the free construction from multicategories to permutative categories is a categorically-enriched non-symmetric multifunctor. Our main result then shows that the induced functor between categories of algebras is an equivalence…
Following the recent survey by the same author of Szeg\"o's theorem and orthogonal polynomials on the unit circle (OPUC) in the scalar case, we survey the corresponding multivariate prediction theory and matrix OPUC (MOPUC).
The goal of this paper is to prove an equivalence between the model categorical approach to pro-categories, as studied by Isaksen, Schlank and the first author, and the $\infty$-categorical approach, as developed by Lurie. Three…
We introduce tropical analogues of the notion of volume of polytopes, leading to a tropical version of the (discrete) classical isoperimetric inequality. The planar case is elementary, but a higher-dimensional generalization leads to an…
A k-valuation is a special type of edge k-colouring of a medial graph. Various graph polynomials, such as the Tutte, Penrose, Bollob\'as-Riordan, and transition polynomials, admit combinatorial interpretations and evaluations as weighted…
This is an introductory textbook to univalent mathematics and homotopy type theory, a mathematical foundation that takes advantage of the structural nature of mathematical definitions and constructions. It is common in mathematical practice…
Edge polytopes is a class of interesting polytope with rich algebraic and combinatorial properties, which was introduced by Ohsugi and Hibi. In this papar, we follow a previous study on cutting edge polytopes by Hibi, Li and Zhang. Instead…
We introduce the notion of a majority category --- the categorical counterpart of varieties of universal algebras admitting a majority term. This notion can be thought to capture properties of the category of lattices, in a way that…
The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.
We define a formal algebraic analogue of hypertoric Hitchin systems, whose complex-analytic counterparts were defined by Hausel-Proudfoot. These are algebraic completely integrable systems associated to a graph. We study the variation of…
We prove that every primary basic semialgebraic set is homotopy equivalent to the set of inscribed realizations (up to M\"obius transformation) of a polytope. If the semialgebraic set is moreover open, then, in addition, we prove that (up…
Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…
We prove several positive results regarding representation of homotopy classes of spheres and algebraic groups by regular mappings. Most importantly we show that every mapping from a sphere to an orthogonal or a unitary group is homotopic…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They…
We introduce two applications of polygraphs to categorification problems. We compute first, from a coherent presentation of an $n$-category, a coherent presentation of its Karoubi envelope. For this, we extend the construction of Karoubi…
Self-polar polytopes are convex polytopes that are equal to an orthogonal transformation of their polar sets. These polytopes were first studied by Lov\'{a}sz as a means of establishing the chromatic number of distance graphs on spheres,…
The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…