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

In this work we propose a generalization of the concept of Ruelle operator for one dimensional lattices used in thermodynamic formalism and ergodic optimization, which we call generalized Ruelle operator, that generalizes both the Ruelle…

It is well-known that for every set $U$ of vertices in a connected graph $G$ there is either a subdivided star in $G$ with a large number of leaves in $U$, or a comb in $G$ with a large number of teeth in $U$. In this paper we extend this…

Discovering the underlying structures present in large real world graphs is a fundamental scientific problem. In this paper we show that a graph's clique tree can be used to extract a hyperedge replacement grammar. If we store an ordering…

A central role in topological dimension theory is played by Lipscomb's space $J_{A}$ since it is a universal space for metric spaces of weight $|A|\geq \aleph _{0}$. On the one hand, Lipscomb's space is the attractor of a possibly infinite…

Recently, a large class of 3d $\mathcal{N} = 2$ gauge theories with mixed Chern-Simons levels, corresponding to plumbing 3-manifolds, has been identified. In this paper we generalize these theories by including in their content chiral…

Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…

A $d$-dimensional bar-and-joint framework $(G,p)$ with underlying graph $G$ is called universally rigid if all realizations of $G$ with the same edge lengths, in all dimensions, are congruent to $(G,p)$. A graph $G$ is said to be…

This is a motivating tutorial introduction to a semantic analysis of programming languages using a graphical language as the representation of terms, and graph rewriting as a representation of reduction rules. We show how the graphical…

Dictionaries are inherently circular in nature. A given word is linked to a set of alternative words (the definition) which in turn point to further descendants. Iterating through definitions in this way, one typically finds that…

We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

The de Bruijn-Erd\H{o}s theorem states that the chromatic number of an infinite graph equals the maximum of the chromatic numbers of finite subgraphs. Such a determinativeness by finite subobjects appears in the definition of a phantom map…

We study families of diffeomorphisms detected by trivalent graphs via the Kontsevich classes. We specify some recent results and constructions of the second named author to show that those non-trivial elements in homotopy groups…

Crum's theorem and its modification a la Krein-Adler are formulated for the discrete quantum mechanics with real shifts, whose eigenfunctions consist of orthogonal polynomials of a discrete variable. The modification produces the associated…

Diamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families of graphs are parallel to each other, for example…

When a space in which Christoffel symbols of the second kind are symmetrical in lower indices exists, it makes for a supplement to the standard procedure when a 2D surface is normally induced from the geometry of the surrounding 3D space in…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

We introduce two families of two-generator one-relator groups called primitive extension groups and show that a one-relator group is hyperbolic if its primitive extension subgroups are hyperbolic. This reduces the problem of characterising…

Let H be any reductive p-adic group. We introduce a notion of cuspidality for enhanced Langlands parameters for H, which conjecturally puts supercuspidal H-representations in bijection with such L-parameters. We also define a cuspidal…

Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…