Related papers: Critical Bridge Spheres for Links with Arbitrarily…

As a previous result, it has shown that every sphere-link consisting of trivial components is a ribbon sphere-link. In this note, it is shown that for every closed oriented disconnected surface F with just one non-sphere component, every…

We apply the twisting technique that was first introduced in \cite{CK} and later generalized in \cite{QCQ} to obtain an infinite family of adequate, homogeneous or alternative links from a given adequate, homogeneous or alternative link,…

If a knot K in a closed, orientable 3-manifold M has a bridge surface T with distance at least 3 in the curve complex of T - K, then the genus of any essential surface in its exterior with non-empty, non-meridional boundary gives rise to an…

In rotations with a binary symbolic dynamics, a critical curve is the locus of parameters for which the boundaries of the partition that defines the symbolic dynamics are connected via a prescribed number of iterations and symbolic…

We adapt Seifert's algorithm for classical knots and links to the setting of tri-plane diagrams for bridge trisected surfaces in the 4-sphere. Our approach allows for the construction of a Seifert solid that is described by a Heegaard…

If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a canonical decomposition into 2.5-connected components. These…

Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…

A finite graph is called a tricirculant if admits a cyclic group of automorphism which has precisely three orbits on the vertex-set of the graph, all of equal size. We classify all finite connected cubic vertex-transitive tricirculants. We…

For each rational homology 3-sphere $Y$ which bounds simply connected definite 4-manifolds of both signs, we construct an infinite family of irreducible rational homology 3-spheres which are homology cobordant to $Y$ but cannot bound any…

In this note we present a construction of an infinite family of diagonal quintic threefolds defined over $\Q$ each containing infinitely many rational points. As an application, we prove that there are infinitely many quadruples $B=(B_{0},…

Let $d\geq 2$. We consider an i.i.d. supercritical bond percolation on $\mathbb{Z}^d$, every edge is open with a probability $p>p_c(d)$, where $p_c(d)$ denotes the critical point. We condition on the event that $0$ belongs to the infinite…

For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. In this paper, for a sequence of integers $B=\{1<b_1<b_2<\cdots\}$ and $3b_1+5\leq b_2\leq 6b_1+10$, we determine the critical value for $b_3$ such that there exists an…

The kernel of analysis, to me anyway, is the following idea: A point is arbitrarily close to a set if every neighborhood of the point intersects the set. Defining ``arbitrarily close'' in this way provides a foundation for classical results…

The critical point between varieties A and B of algebras is defined as the least cardinality of the semilattice of compact congruences of a member of A but of no member of B, if it exists. The study of critical points gives rise to a whole…

We say that a digraph is essentially cyclic if its Laplacian spectrum is not completely real. The essential cyclicity implies the presence of directed cycles, but not vice versa. The problem of characterizing essential cyclicity in terms of…

We study bond percolation for a family of infinite hyperbolic graphs. We relate percolation to the appearance of homology in finite versions of these graphs. As a consequence, we derive an upper bound on the critical probabilities of the…

We prove that for 2-bridge knots, the diameter, D, of the set of boundary slopes is twice the crossing number, c. This constitutes partial verification of a conjecture that, for all knots in S^3, D is at most 2c.

We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely long overlap-free words that consist of a concatenation of…

We compute the chains associated to the left-invariant CR structures on the three-sphere. These structures are characterized by a single real modulus $a$. For the standard structure $a=1$, the chains are well-known and are closed curves. We…

We study site percolation on lattices confined to a semi-infinite strip. For triangular and square lattices we find that the probability that a cluster touches the three sides of such a system at the percolation threshold has the continuous…