相关论文: A d-dimensional extension of Christoffel words

Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange…

Let $D=(V,A)$ be a digraph. For an integer $k\geq 1$, a $k$-arc-connected flip is an arc subset of $D$ such that after reversing the arcs in it the digraph becomes (strongly) $k$-arc-connected. The first main result of this paper introduces…

We propose a new approach to text semantic analysis and general corpus analysis using, as termed in this article, a "bi-gram graph" representation of a corpus. The different attributes derived from graph theory are measured and analyzed as…

We show that all finite dimensional pointed Hopf algebras with the same diagram in the classification scheme of Andruskiewitsch and Schneider are cocycle deformations of each other. This is done by giving first a suitable characterization…

The generalized curvature tensor and Christoffel symbols are determined in AdS_{d+1} background by a modified ansatz of the de Wit - Freedman type by imposing gauge invariance. The resulting set of recurrence relations and difference…

We show that all finite dimensional pointed Hopf algebras with the same diagram in the classification scheme of Andruskiewitsch and Schneider are cocycle deformations of each other. This is done by giving first a suitable characterization…

Fibonacci word fractals are a class of fractals that have been studied recently, though the word they are generated from is more widely studied in combinatorics. The Fibonacci word can be used to draw a curve which possesses…

A cocomparability graph is a graph whose complement admits a transitive orientation. An interval graph is the intersection graph of a family of intervals on the real line. In this paper we investigate the relationships between interval and…

In two seminal papers M. Kontsevich introduced graph homology as a tool to compute the homology of three infinite dimensional Lie algebras, associated to the three operads `commutative,' `associative' and `Lie.' We generalize his theorem to…

In this note, we define a new graph $\Gamma_d(G)$ on a finite group $G$, where $d$ is a divisor of $|G|$. The vertices of $\Gamma_d(G)$ are the subgroups of $G$ of order $d$ and two subgroups $H_1$ and $H_2$ of $G$ are said to be adjacent…

The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…

For finite reflection groups of types A and B, we determine the diameter of the graph whose vertices are reduced words for the longest element and whose edges are braid relations. This is deduced from a more general theorem that applies to…

We develop a theory of rewriting for structured cospans in order to extend compositional methods for modeling open networks. First, we introduce a category whose objects are structured cospans, and establish conditions under which it is…

Given an infinite word over the alphabet $\{0,1,2,3\}$, we define a class of bipartite hereditary graphs $\mathcal{G}^\alpha$, and show that $\mathcal{G}^\alpha$ has unbounded clique-width unless $\alpha$ contains at most finitely many…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

In this addendum, we give a differential form interpretation of the proof of the main theorem of arXiv:1812.02448, which gives lower bounds of the dimensions of $\pi_k(B\mathrm{Diff}(D^4,\partial))\otimes\mathbb{Q}$ in terms of the…

Given a finite simple connected graph $\Gamma$, the graphical configuration space $\mathrm{Conf}_{\Gamma}(X)$ is the space of collections of points in $X$ indexed by the vertices of $\Gamma$, where points corresponding to adjacent vertices…

A d-dimensional framework is an embedding of the vertices and edges of a graph in Euclidean space. A d-dimensional framework is globally rigid if every other d-dimensional framework with the same edge lengths has the same pairwise distances…

In this work we apply the Drinfel'd twist of Hopf algebras to the study of deformed quantum theories. We prove that, by carefully considering the role of the central extension, it is indeed possible to construct the universal enveloping…

Classical Hamming graphs are Cartesian products of complete graphs, and two vertices are adjacent if they differ in exactly one coordinate. Motivated by connections to unitary Cayley graphs, we consider a generalization where two vertices…