Related papers: Rational Gluing in Edge Replacement Systems
In the 1980's Stallings showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse…
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…
We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction…
In the present paper, we prove the retract rationality of the classifying spaces $BG$ for several types of finite connected group schemes $G$ over algebraically closed fields of positive characteristic $p>0$. In particular, we prove the…
The higher-order autocorrelations of integer-valued or rational-valued gridded data sets appear naturally in X-ray crystallography, and have applications in computer vision systems, correlation tomography, correlation spectroscopy, and…
We study abstract intermediate justification logics, that is arbitrary intermediate propositional logics extended with a subset of specific axioms of (classical) justification logics. For these, we introduce various semantics by combining…
We streamline and generalize the recent progress in understanding entanglement between spatial regions in Abelian gauge theories. We provide an unambiguous and explicit prescription for calculating entanglement entropy in a $\mathbb Z_N$…
This paper proposes some efficient and accurate adaptive two-grid (ATG) finite element algorithms for linear and nonlinear partial differential equations (PDEs). The main idea of these algorithms is to utilize the solutions on the $k$-th…
This paper develops an algorithmic-based approach for proving inductive properties of propositional sequent systems such as admissibility, invertibility, cut-elimination, and identity expansion. Although undecidable in general, these…
We consider methods for connected reconfigurations by finite automate in the so-called \emph{hybrid} or \emph{Robot-on-Tiles} model of programmable matter, in which a number of simple robots move on and rearrange an arrangement of passive…
Key properties of a physical system depend on whether it is gapped, i.e. whether its spectral gap has a positive lower bound that is independent of system size. In quantum information theory, the question of whether a system is gapped has…
Completion is one of the most studied techniques in term rewriting and fundamental to automated reasoning with equalities. In this paper we present new correctness proofs of abstract completion, both for finite and infinite runs. For the…
The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups.…
We present a simple technique for semantic, open logical relations arguments about languages with recursive types, which, as we show, follows from a principled foundation in categorical semantics. We demonstrate how it can be used to give a…
In relational verification, judicious alignment of computational steps facilitates proof of relations between programs using simple relational assertions. Relational Hoare logics (RHL) provide compositional rules that embody various…
We set up a geometrical theory for the study of the dynamics of reducible Pisot substitutions. It is based on certain Rauzy fractals generated by duals of higher dimensional extensions of substitutions. We obtain under certain hypotheses…
Entity alignment (EA) seeks identical entities in different knowledge graphs, which is a long-standing task in the database research. Recent work leverages deep learning to embed entities in vector space and align them via nearest neighbor…
This paper studies the associativity of gluing of trajectories in Morse theory. We show that the associativity of gluing follows from of the existence of compatible manifold with face structures on the compactified moduli spaces. Using our…
The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable…
This paper concerns frames and equiangular lines over finite fields. We find a necessary and sufficient condition for systems of equiangular lines over finite fields to be equiangular tight frames (ETFs). As is the case over subfields of…