Related papers: Dotted $2$-limits
We study the directed maximum common edge subgraph problem (DMCES) for the class of directed graphs that are finite, weakly connected, oriented, and simple. We use DMCES to define a metric on partially ordered sets that can be represented…
This paper provides an abstract definition of some kinds of logics, called diagrammatic logics, together with a definition of morphisms and of 2-morphisms between diagrammatic logics. The definition of the 2-category of diagrammatic logics…
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…
Extensions of dual definite subspaces to dual maximal definite ones are described. The concepts of dual quasi maximal subspaces and quasi basis are introduced and studied. The obtained results are applied to the classification of…
Given a finite directed graph with $n$ vertices, we define a metric $d_G$ on $\mathbb{F}_q^n$, where $\mathbb{F}_q$ is the finite field with $q$ elements. The weight of a word is defined as the number of vertices that can be reached by a…
We consider the extension of the two-variable guarded fragment logic with local Presburger quantifiers. These are quantifiers that can express properties such as "the number of incoming blue edges plus twice the number of outgoing red edges…
Structured and decorated cospans are broadly applicable frameworks for building bicategories or double categories of open systems. We streamline and generalize these frameworks using central concepts of double category theory. We show that,…
We establish a relation between fully extended $2$-dimensional TQFTs and recognisable weighted formal languages, rational biprefix codes and lattice TFTs. We show the equivalence of $2D$ closed TFTs and rational exchangeable series and we…
Over an algebraically closed fields, an alternative to the method due to Kostrikin and Shafarevich was recently suggested. It produces all known simple finite dimensional Lie algebras in characteristic p>2. For p=2, we investigate one of…
The past few years have witnessed a remarkable crossover of string theoretical ideas from the abstract world of geometrical forms to the concrete experimental realm of condensed matter physics. The basis for this --- variously known as…
This work provides the general framework for obtaining strong Szeg\H{o} limit theorems for multi-bordered, semi-framed, framed, and multi-framed Toeplitz determinants, extending the results of Basor et al. (2022) beyond the (single)…
We show that every nontrivial finite or infinite connected directed graph with loops and at least one vertex without a loop is uniquely representable as a Cartesian or weak Cartesian product of prime graphs. For finite graphs the…
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…
The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and \v{Z}ivkovi\'{c}. The application of this problem in chemistry, as well as its interesting theoretical aspects, made this subject very active. In this…
A quasi-schemoid is a small category whose morphisms are colored with appropriate combinatorial data. In this note, Mitchell's embedding theorem for a tame schemoid is established. The result allows us to give a cofibrantly generated model…
We introduce a new family of graded 2-categories generalizing the 2-quantum groups introduced by Khovanov, Lauda and Rouquier. We use them to categorify quasi-split iquantum groups in all symmetric types.
Symmetric Positive Definite (SPD) matrices have been used in many fields of medical data analysis. Many Riemannian metrics have been defined on this manifold but the choice of the Riemannian structure lacks a set of principles that could…
A finite metric space is called here distance degree regular if its distance degree sequence is the same for every vertex. A notion of designs in such spaces is introduced that generalizes that of designs in $Q$-polynomial distance-regular…
We prove annealed central limit theorems for finite pattern counts in the measurement record of discrete-time quantum trajectories generated by repeated measurements in a disordered environment. Under summable mixing assumptions on the…
Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in…