Related papers: Diagrammatic sets and rewriting in weak higher cat…

Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…

We prove the first equivalence between a weak non-algebraic model and a semi-strict algebraic model of $(\infty, n)$-categories. This takes the form of a natural semi-strictification, whereby a weak $(\infty, n)$-category is embedded into a…

We develop the technique of compactified correspondences and homotopies over one-dimensional base schemes, and illuminate the perfectness and the inverting of characteristic assumptions from the celebrating Voevodsky's strict homotopy…

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…

In a previous work, we have introduced a weakening of Quillen model categories called weak model categories. They still allow all the usual constructions of model category theory, but are easier to construct and are in some sense better…

Borger's theory of $\Lambda$-spaces imbues algebraic spaces, which include schemes, with an additional structure defined by an extension of the Witt vector functor. Motivated by $\mathbb{F}_1$-geometry, we prove the existence of a weak…

We formulate a framework of polynomial diagrams, which are a generalisation of power diagrams (PDs) and anisotropic power diagrams (APDs) allowing for boundaries between cells to be algebraic curves of a prescribed degree. We show that they…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

We study the connections between three seemingly different combinatorial structures - "uniform" brackets in statistics and probability theory, "containers" in online and distributed learning theory, and "combinatorial Macbeath regions", or…

We introduce two families of diagrammatic monoidal supercategories. The first family, depending on an associative superalgebra, generalizes the oriented Brauer category. The second, depending on an involutive superalgebra, generalizes the…

Homotopy Type Theory may be seen as an internal language for the $\infty$-category of weak $\infty$-groupoids which in particular models the univalence axiom. Voevodsky proposes this language for weak $\infty$-groupoids as a new foundation…

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…

Let \(\T\) be a commutative ternary \(\Gm\)-semiring in the sense of the triadic, \(\Gm\)-parametrized multiplication \(\{a,b,c\}_{\gamma}\). Building on the affine \(\Gm\)-spectrum \(\SpecG(\T)\), the structure sheaf, and the equivalence…

In this paper, we study discrete Lyapunov models, which consist of steady-state distributions of first-order vector autoregressive models. The parameter matrix of such a model encodes a directed graph whose vertices correspond to the…

We propose a new class of hypertopologies, called here weak$^{\ast }$ hypertopologies, on the dual space $\mathcal{X}^{\ast }$ of a real or complex topological vector space $\mathcal{X}$. The most well-studied and well-known hypertopology…

In recent years, there have been intense research efforts to develop efficient methods for probabilistic inference in probabilistic influence diagrams or belief networks. Many people have concluded that the best methods are those based on…

Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…

Motivated by Kontsevich's graph complexes, this paper gives a systematic study of matroid complexes. We construct deletion and contraction bicomplexes on the vector space spanned by matroid classes equipped with ground-set orientations,…

We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definable families of sets on the plane in $o$-minimal expansions of fields. Using it, we…