Related papers: Rational Gluing in Edge Replacement Systems

A novel and deterministic algorithm is presented to detect whether two given rational plane curves are related by means of a similarity, which is a central question in Pattern Recognition. As a by-product it finds all such similarities, and…

We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such…

State redistribution is an algorithm that stabilizes cut cells for embedded boundary grid methods. This work extends the earlier algorithm in several important ways. First, state redistribution is extended to three spatial dimensions.…

In systems removed from equilibrium, intrinsic microscopic fluctuations become correlated over distances comparable to the characteristic macroscopic length over which the external constraint is exerted. In order to investigate this…

We show that a vast class of finitary fragments of geometric logic admit a form of Craig interpolation property. In doing so, we provide a new dictionary to import technology from algebraic logic to categorical logic.

We address the problem of analytically extracting a countable infinity of flat, non-dispersive bands in a periodic array of cells that comprise branching Vicsek geometries of higher and higher generations. Through a geometric construction,…

This paper explores alternative statements of the axioms for lattice gluing, focusing on lattices that are modular, locally finite, and have finite covers, but may have infinite height. We give a set of "maximal" axioms that maximize what…

In this article we define the semigroup associated to a substitution. We use it to construct a minimal automaton which generates a substitution sequence u in reverse reading. We show, in the case where the substitution has a coincidence,…

Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on…

In this chapter we describe a selection of mathematical techniques and results that suggest interesting links between the theory of gratings and the theory of homogenization, including a brief introduction to the latter. By no means do we…

In this paper we develop the theory of Artin-Wraith glueings for topological spaces. As an application, we show that some categories of compactifications of coarse spaces that agree with the coarse structures are invariant under coarse…

Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that…

We investigate the decidability of the emptiness problem for three classes of distributed automata. These devices operate on finite directed graphs, acting as networks of identical finite-state machines that communicate in an infinite…

Motivated by the idea of using simple macroscopic examples to illustrate the physics of complex systems, we modify a historic experimental setup in which interacting floating magnets spontaneously self-assemble into ordered clusters. By…

The paper presents two edge grouping algorithms for finding a closed contour starting from a particular edge point and enclosing a fixation point. Both algorithms search a shortest simple cycle in \textit{an angularly ordered graph} derived…

In this chapter, we introduce a new dialogical system for first order classical logic which is close to natural language argumentation, and we prove its completeness with respect to usual classical validity. We combine our dialogical system…

Many graph algorithms can be viewed as sets of rules that are iteratively applied, with the number of iterations dependent on the size and complexity of the input graph. Existing machine learning architectures often struggle to represent…

In this paper we introduce an effective method to construct rational deformations between couples of Borel-fixed ideals. These deformations are governed by flat families, so that they correspond to rational curves on the Hilbert scheme.…

In this paper we consider interpolation problem connected with series by integer shifts of Gaussians. Known approaches for these problems met numerical difficulties. Due to it another method is considered based on finite-rank approximations…

In this paper, we present an algorithmic approach to design and construct planar truss structures based on symmetric lattices using modular elements. The method of assembly is similar to Leonardo grids as they both rely on the property of…