相关论文: Spider Evaluation and Representations of Web Group…
Phylogenetic tree shapes capture fundamental signatures of evolution. We consider ``ranked'' tree shapes, which are equipped with a total order on the internal nodes compatible with the tree graph. Recent work has established an elegant…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…
Building on recent work by Rippon and Stallard, we explore the intricate structure of the spider's web fast escaping sets associated with certain transcendental entire functions. Our results are expressed in terms of the components of the…
Centrality describes the importance of nodes in a graph and is modeled by various measures. Its global analogue, called centralization, is a general formula for calculating a graph-level centrality score based on the node-level centrality…
Webs yield an especially important realization of certain Specht modules, irreducible representations of symmetric groups, as they provide a pictorial basis with a convenient diagrammatic calculus. In recent work, the last three authors…
This survey gives an overview of three central algebraic themes related to the study of splines: duality, group actions, and homology. Splines are piecewise polynomial functions of a prescribed order of smoothness on some subdivided domain…
The Alexander polynomial in several variables is defined for links in three-dimensional homology spheres, in particular, in the Poincar\'e sphere: the intersection of the surface $S=\{(z_1,z_2,z_3)\in {\mathbb C}^3: z_1^5+z_2^3+z_3^2=0\}$…
We show that, if the Julia set of a transcendental entire function is locally connected, then it takes the form of a spider's web in the sense defined by Rippon and Stallard. In the opposite direction, we prove that a spider's web Julia set…
Scaffolds are the one-dimensional skeleta of high-dimensional flag simplicial complexes of nonpositive curvature. They generalize the phylogenetic trees of Trop G(2,n) to arbitrary $k$, drawing together SL(k)-web bases, affine buildings,…
PageRank for Semi-Supervised Learning has shown to leverage data structures and limited tagged examples to yield meaningful classification. Despite successes, classification performance can still be improved, particularly in cases of fuzzy…
The Erd\"os-S\'os conjecture states that if $G$ is a graph with average degree more than $k-1$, then G contains every tree of $k$ edges. A spider is a tree with at most one vertex of degree more than 2. In this paper, we prove that…
The modular decomposition of a symmetric map $\delta\colon X\times X \to \Upsilon$ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features…
We introduce the notion of wide representation of an inverse semigroup and prove that with a suitably defined topology there is a space of germs of such a representation which has the structure of an etale groupoid. This gives an elegant…
Let $\mathcal{C}$ be a smooth, projective and geometrically integral curve defined over a finite field $\mathbb{F}$. Let $A$ be the ring of function of $\mathcal{C}$ that are regular outside a closed point $P$ and let $k=\mathrm{Quot}(A)$.…
Webs are combinatorial diagrams used to encode homomorphisms between representations of Lie (super)algebras and related objects. This paper extends the theory of webs to the quantum group of type Q. We define a monoidal supercategory of…
The $SU_3$-skein algebra of a surface $F$ is spanned by isotopy classes of certain framed graphs in $F\times I$ called $3$-webs subject to the skein relations encapsulating relations between $U_q(sl(3))$-representations. These skein…
In this paper we consider so-called Google matrices and show that all eigenvalues ($\lambda$) of them have a fundamental property $|\lambda|\leq 1$. The stochastic eigenvector corresponding to $\lambda=1$ called the PageRank vector plays a…
The proposal is to use clusters, graphs and networks as models in order to analyse the Web structure. Clusters, graphs and networks provide knowledge representation and organization. Clusters were generated by co-site analysis. The sample…
Spatial networks are ubiquitous in social, geographical, physical, and biological applications. To understand the large-scale structure of networks, it is important to develop methods that allow one to directly probe the effects of space on…