Related papers: Spider's webs of doughnuts
We define commutator of a transcendental semigroup, and on the basis of this concept, we define conjugate semigroup. We prove that the conjugate semigroup is nearly abelian if and only if the given semigroup is nearly abelian. We also prove…
The aim of this article is to give several results related to Walsh's spider diffusions living on a star-shaped network that have a spinning measure selected from the own local time of the motion at the vertex (cf.[17]). We prove the…
Let $f$ be a transcendental entire function. The quite fast escaping set, $Q(f)$, and the set $Q_2(f),$ which was defined recently, are equal to the fast escaping set, $A(f),$ under certain conditions. In this paper we generalise these sets…
A subset $S$ of vertices in a graph $G$ is a secure total dominating set of $G$ if $S$ is a total dominating set of $G$ and, for each vertex $u \not\in S$, there is a vertex $v \in S$ such that $uv$ is an edge and $(S \setminus \{v\}) \cup…
The sl_3 spider is a diagrammatic category used to study the representation theory of the quantum group U_q(sl_3). The morphisms in this category are generated by a basis of non-elliptic webs. Khovanov- Kuperberg observed that non-elliptic…
Synthetic bio-molecular spiders with "legs" made of single-stranded segments of DNA can move on a surface covered by single-stranded segments of DNA called substrates when the substrate DNA is complementary to the leg DNA. If the motion of…
A theorem of Ritt states the a linearizer of a holomorphic function at a repelling fixed point is periodic only if the holomorphic map is conjugate to a power of $z$, a Chebyshev polynomial or a Latt\`es map. The converse, except for some…
Let $G$ be a classical group defined over a local field $F$ of characteristic zero. Let $\pi$ be an irreducible admissible representation $\pi$ of $G(F)$, which is of Casselman-Wallach type if $F$ is archimedean. If $\pi$ has a generic…
A spidernet is a graph obtained by adding large cycles to an almost regular tree and considered as an example having intermediate properties of lattices and trees in the study of discrete-time quantum walks on graphs. We introduce the…
We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a…
In this paper we study the homotopical rotation vectors and the homotopical rotation sets for the billiard flow on the unit flat torus with three, mutually intersecting and mutually orthogonal cylindrical scatterers removed from it. The…
A permutation graph $G_\pi$ is a simple graph with vertices corresponding to the elements of $\pi$ and an edge between $i$ and $j$ when $i$ and $j$ are inverted in $\pi$. A set of vertices $D$ is said to dominate a graph $G$ when every…
Let G be a reductive affine group scheme defined over a semilocal ring k. Assume that either G is semisimple or k is normal and noetherian. We show that G has a finite k-subgroup S such that the natural map H^1(R, S) --> H^1(R, G) is…
The present paper proves that a Sleptsov net (SN) is Turing-complete, that considerably improves, with a brief construct, the previous result that a strong SN is Turing-complete. Remind that, unlike Petri nets, an SN always fires enabled…
We show that the union of two or more independent uniform spanning forests (USF) on $\mathbb{Z}^d$ with $d\geq 3$ almost surely forms a connected transient graph. In fact, this also holds when taking the union of a deterministic everywhere…
A graph $G=(V,E)$ is strongly antimagic, if there is a bijective mapping $f: E \to \{1,2,\ldots,|E|\}$ such that for any two vertices $u\neq v$, not only $\sum_{e \in E(u)}f(e) \ne \sum_{e\in E(v)}f(e)$ and also $\sum_{e \in E(u)}f(e) <…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
In this paper we show that the sets of $F$-jumping coefficients of ideals form discrete sets in certain graded $F$-finite rings. We do so by giving a criterion based on linear bounds for the growth of the Castelnuovo-Mumford regularity of…
We study the set--theoretic combinatorics underlying the following two algebraic phenomena. (1) A subgroup G leq Z^omega exhibits the Specker phenomenon iff every homomorphism G to Z maps almost all unit vectors to 0. Let se be the size of…
We show the existence of transcendental entire functions $f: \mathbb{C} \rightarrow \mathbb{C}$ with Hausdorff-dimension $1$ Julia sets, such that every Fatou component of $f$ has infinite inner connectivity. We also show that there exist…