相关论文: Spider Evaluation and Representations of Web Group…

In this study, we present and analyze a framework for geometric and topological estimation for mapping of unknown environments. We consider agents mimicking motion behaviors of cyborg insects, known as biobots, and exploit coordinate-free…

A weighted bicolored plane tree is a bicolored plane tree whose edges are endowed with positive integral weights. The degree of a vertex is defined as the sum of the weights of the edges incident to this vertex. Using the theory of dessins…

We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…

A $k$-ranking of a graph $G$ is a labeling of its vertices from $\{1,\ldots,k\}$ such that any nontrivial path whose endpoints have the same label contains a larger label. The least $k$ for which $G$ has a $k$-ranking is the ranking number…

In this paper, we examine roots of graph polynomials where those roots can be considered as structural graph measures. More precisely, we prove analytical results for the roots of certain modified graph polynomials and also discuss…

We define pullback and separated presentations of modules over pullback rings, and, if the ring is a pullback of epimorphisms over a semisimple ring, an algorithm reducing such a presentation of a module to an $R$-diagram. The latter is the…

Recently, graph neural networks have been widely used for network embedding because of their prominent performance in pairwise relationship learning. In the real world, a more natural and common situation is the coexistence of pairwise…

Let $G(V,E)$ be a simple graph with $m$ edges. For a given integer $k$, a $k$-shifted antimagic labeling is a bijection $f: E(G) \to \{k+1, k+2, \ldots, k+m\}$ such that all vertices have different vertex-sums, where the vertex-sum of a…

We introduce the notion of a "graded topological space": a topological space endowed with a sheaf of abelian groups which we think of as a sheaf of gradings. Any object living on a graded topological space will be graded by this sheaf of…

Linear spinor fields are a generalization of the Dirac field that have direct correspondence with the known physics of fermions, inherent causality properties in their most fundamental constructions, and positive mass eigenvalues for all…

We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…

Generic smooth plane-to-plane map germs are topologically equivalent to cones of mappings of the circle. We carry out a complete topological classification of smooth stable mappings of the circle and show how this classification leads, via…

Sigma models effectively describe ordered phases of systems with spontaneously broken symmetries. At low energies, field configurations fall into solitonic sectors, which are homotopically distinct classes of maps. Depending on context,…

Analogous to the sl(n) case, we address the computation of the index of seaweed subalgebras of sp(2n) by introducing graphical representations called symplectic meanders. Formulas for the algebra's index may be computed by counting the…

We study the topology of the Megaparsec Cosmic Web on the basis of the Alpha Shapes of the galaxy distribution. The simplicial complexes of the alpha shapes are used to determine the set of Betti numbers ($\beta_{\rm k},k=1,...,D$), which…

We study the portraits of isometries of rooted trees - the labelling of the tree, at each vertex, by the permutation of its descendants - in terms of languages. We characterize regularly branched self-similar groups in terms of…

Embeddings of graphs into distributions of trees that preserve distances in expectation are a cornerstone of many optimization algorithms. Unfortunately, online or dynamic algorithms which use these embeddings seem inherently randomized and…

We continue our work on lattice models of webs, which generalise the well-known loop models to allow for various kinds of bifurcations [arXiv:2101.00282, arXiv:2107.10106]. Here we define new web models corresponding to each of the rank-two…

A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…

Observations reveal that on large scales the universe is spanned by a percolating network of superclusters interspersed with large and almost empty regions -- voids. This thesis reports the construction of a sophisticated computational…