相关论文: Treelike snarks
In the search for transverse-universal knots in the standard contact structure on $\mathbb{S}^3$, we present a classification of the transverse twist knots with maximal self-linking number, that admit only overtwisted contact branched…
A skew brace is a triplet $(A,\cdot,\circ)$, where $(A,\cdot)$ and $(A,\circ)$ are groups such that the brace relation $x\circ (y\cdot z) = (x\circ y)\cdot x^{-1}\cdot (x\circ z)$ holds for all $x,y,z\in A$. In this paper, we study the…
We investigate the profinite completions of a certain family of groups acting on trees. It turns out that for some of the groups considered, the completions coincide with the closures of the groups in the full group of tree automorphisms.…
We provide a characterization of infinite frieze patterns of positive integers via triangulations of an infinite strip in the plane. In the periodic case, these triangulations may be considered as triangulations of annuli. We also give a…
Tree-child networks are one of the most prominent network classes for modeling evolutionary processes which contain reticulation events. Several recent studies have addressed counting questions for {\it bicombining tree-child networks}…
Pairing-based cryptographic schemes require so-called pairing-friendly elliptic curves, which have special properties. The set of pairing-friendly elliptic curves that are generated by given polynomials form a complete family. Although a…
The singularities of network flow are modeled by self-similarly shrinking solutions called regular shrinkers. In this paper, we study the stability of regular shrinkers. We show that all regular shrinkers with two or more enclosed regions…
One of the main characteristics of real-world networks is their large clustering. Clustering is one aspect of a more general but much less studied structural organization of networks, i.e. edge multiplicity, defined as the number of…
Motivated by a conjecture of Gy\'arf\'as, recently B\"ottcher, Hladk\'y, Piguet, and Taraz showed that every collection $T_1,\dots,T_t$ of trees on $n$ vertices with $\sum_{i=1}^te(T_i)\leq \binom{n}{2}$ and with bounded maximum degree, can…
A clutter is \emph{$k$-wise intersecting} if every $k$ members have a common element, yet no element belongs to all members. We conjecture that, for some integer $k\geq 4$, every $k$-wise intersecting clutter is non-ideal. As evidence for…
This paper is composed of two main results concerning chains of infinite order which are not necessarily continuous. The first one is a decomposition of the transition probability kernel as a countable mixture of unbounded probabilistic…
The Cycle double cover (CDC) conjecture states that for every bridgeless graph $G$, there exists a family $\mathcal{F}$ of cycles such that each edge of the graph is contained in exactly two members of $\mathcal{F}$. Given an embedding of a…
For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching. There is extensive literature…
Generalising a recent work of Dequ\^ene et al. on the connection between perfectly clustering words and band bricks over a particular family of gentle algebras, we characterise band bricks over string algebras whose underlying quiver is…
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three classes of the 3-net comprises concurrent lines, and irregular…
We study the Lipschitz Geometry of Complex Algebraic Singularities. For this purpose we introduce the notion of choking horns. A Choking horn is a family of cycles on the family of the sections of an algebraic variety by very small spheres…
For fixed large genus, we construct families of complete immersed minimal surfaces in R3 with four ends and dihedral symmetries. The families exist for all large genus and at an appropriate scale degenerate to the plane.
A \emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential…
We show that every bridgeless cubic graph $G$ on $n$ vertices other than the Petersen graph has a 2-factor with at most $2(n-2)/15$ circuits of length $5$. An infinite family of graphs attains this bound. We also show that $G$ has a…
We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We…