相关论文: A d-dimensional extension of Christoffel words
How does one determine if a collection of bars joined by freely rotating hinges cannot be deformed without changing the length of any of the bars? In other words, how does one determine if a bar-joint graph is rigid? This question has been…
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain…
We define Markoff words as certain factors appearing in bi-infinite words satisfying the Markoff condition. We prove that these words coincide with central words, yielding a new characterization of Christoffel words.
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
The classical Besicovitch-Federer projection theorem implies that the d-dimensional Hausdorff measure of a set in Euclidean space with non-negligible d-unrectifiable part will strictly decrease under orthogonal projection onto almost every…
We study the combinatorics of crystal graphs given by highest weight representations of types $A_{n}, B_{n}, C_{n}$, and $D_{n}$, uncovering new relations that exist among crystal operators. Much structure in these graphs has been revealed…
We prove that a fractional perfect matching in a non-bipartite graph can be written, in polynomial time, as a convex combination of perfect matchings. This extends the Birkhoff-von Neumann Theorem from bipartite to non-bipartite graphs. The…
In sparse signal representation, the choice of a dictionary often involves a tradeoff between two desirable properties -- the ability to adapt to specific signal data and a fast implementation of the dictionary. To sparsely represent…
A subfamily of Dyck words called tight Dyck words is seen to correspond, via a "castling" procedure, to the vertex set of an ordered tree $T$. From $T$, a "blowing" operation recreates the whole family ol Dyck words. The vertices of $T$ can…
Supersymmetry can be consistently generalized in one and two dimensional spaces, fractional supersymmetry being one of the possible extension. 2D fractional supersymmetry of arbitrary order $F$ is explicitly constructed using an adapted…
Any finite-dimensional quasitriangular Hopf algebra $H$ can be formally extended to a ribbon Hopf algebra $\tilde H$ of twice the dimension. We investigate this extension and its representations. We show that every indecomposable $H$-module…
The gauge symmetry and shift/translational symmetry of a 3D BF action, which are associated to a pair of dual Lie algebras, can be combined to form the Drinfel'd double. This combined symmetry is the gauge symmetry of the Chern-Simons…
In this paper, we prove that all but one of the components of the transfer digraph ${\cal D}^*_m$ needed for the enumeration of 2-factors in the rectangular, thick cylinder and Moebius strip grid graphs of the fixed width $m$ $(m \in N)$…
For a positive measure set of nonuniformly expanding quadratic maps on the interval we effect a multifractal formalism, i.e., decompose the phase space into level sets of time averages of a given observable and consider the associated {\it…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
Hyperedge-Replacement grammars (HR) have been introduced by Courcelle in order to extend the notion of context-free sets from words and trees to graphs of bounded tree-width. While for words and trees the syntactic restrictions that…
In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic…
We develop a discrete gauge-theoretic framework for superposition in large language models (LLMs) that replaces the single-global-dictionary premise with a sheaf-theoretic atlas of local semantic charts. Contexts are clustered into a…
We strengthen the standard bifurcation theorems for saddle-node, transcritical, pitchfork, and period-doubling bifurcations of maps. Our new formulation involves adding one or two extra terms to the standard truncated normal forms with…
Quite recently, Grabowska and Kaplan presented a 4-dimensional lattice formulation of chiral gauge theories based on the chiral overlap operator. We study this formulation from the perspective of the fermion number anomaly and possible…