Related papers: Rational Gluing in Edge Replacement Systems
Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…
An efficient scheme to compute the geometric entanglement per lattice site for quantum many-body systems on a periodic finite-size chain is proposed in the context of a tensor network algorithm based on the matrix product state…
Reversible weighted automata are introduced and considered in a specific setting where the weights are taken from a nontrivial locally finite commutative ring such as a finite field. It is shown that the supports of series realised by such…
In this article, we develop a general technique for gluing subcategories of $\infty$-categories. We obtain categorical equivalences between simplicial sets associated to certain multisimplicial sets. Such equivalences can be used to…
We give a simple approximation algorithm for a common generalization of many previously studied extensions of the maximum size stable matching problem with ties. These generalizations include the existence of critical vertices in the graph,…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…
Box folding represents a crucial challenge for automated packaging systems. This work bridges the gap between existing methods for folding sequence extraction and approaches focused on the adaptability of automated systems to specific box…
As two fundamental problems, graph cuts and graph matching have been investigated over decades, resulting in vast literature in these two topics respectively. However the way of jointly applying and solving graph cuts and matching receives…
We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…
We give sufficient conditions for some underdetermined elliptic PDE of any order to construct smooth compactly supported solutions. In particular we show that two smooth elements in the kernel of certain underdetermined linear elliptic…
A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Aside from exchangeable random partitions, examples include edge…
In this contribution I discuss a recent proposal of a novel action for lattice gauge theory for finite systems, which accommodates non-periodic spatial boundary conditions. Drawing on the summation-by-parts formulation of finite differences…
In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language.
Engelfriet and Vereijken have shown that linear graph grammars based on hyperedge replacement generate graph languages that can be considered as interpretations of regular string languages over typed symbols. In this paper we show that…
We provide a technique to glue simple-minded collections along a recollement of Hom-finite Krull-Schmidt triangulated categories over a field. This gluing technique for simple-minded collections is shown to be compatible with those for…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…
Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…