Related papers: Seven mutually touching infinite cylinders
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…
We develop a geometric mechanism to prove the existence of orbits that drift along a prescribed sequence of cylinders, under some general conditions on the dynamics. This mechanism can be used to prove the existence of Arnold diffusion for…
We present simulations of self-avoiding random walks on 2-d lattices with the topology of an infinitely long cylinder, in the limit where the cylinder circumference L is much smaller than the Flory radius. We study in particular the…
The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…
Given a normed plane $\mathcal{P}$, we call $\mathcal{P}$-cycloids the planar curves which are homothetic to their double $\mathcal{P}$-evolutes. It turns out that the radius of curvature and the support function of a $\mathcal{P}$-cycloid…
We introduce a robust numerical method for determining intersection numbers of Lefschetz thimbles in multivariable settings. Our approach employs the multiple shooting method to solve the upward flow equations from the saddle points to the…
Let $X$ be a two-sided subshift on a finite alphabet endowed with a mixing probability measure which is positive on all cylinders in $X$. We show that there exist arbitrarily small finite overlapping union of shifted cylinders which…
In this paper, applying a canonical system with field rotation parameters and using geometric properties of the spirals filling the interior and exterior domains of limit cycles, we solve first the problem on the maximum number of limit…
We establish, utilizing the Hardy-Littlewood Circle Method, an asymptotic formula for the number of pairs of primes whose differences lie in the image of a fixed polynomial. We also include a generalization of this result where differences…
Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…
Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$…
In this paper we consider the direct scattering problem of obliquely incident time-harmonic electromagnetic plane waves by an infinitely long dielectric cylinder. We assume that the cylinder and the outer medium are homogeneous and…
The classical Helmholtz problem is applied for modelling and numerical investigation of inviscid cusp-ended separated flow around circular cylinder. Two coordinate systems are used: polar for initial calculations and parabolic as…
We study the drift induced by the passage of two cylinders through an unbounded extent of inviscid incompressible fluid under the assumption that the flow is two-dimensional and steady in the moving frame of reference. The goal is to assess…
This is a computational study of bottlenecks on algebraic varieties. The bottlenecks of a smooth variety $X \subseteq \mathbb{C}^n$ are the lines in $\mathbb{C}^n$ which are normal to $X$ at two distinct points. The main result is a…
In this paper, the global qualitative analysis of planar quadratic dynamical systems is established and a new geometric approach to solving Hilbert's Sixteenth Problem in this special case of polynomial systems is suggested. Using geometric…
For a Hamilton cycle in a rectangular $m \times n$ grid, what is the greatest number of turns that can occur? We give the exact answer in several cases and an answer up to an additive error of $2$ in all other cases. In particular, we give…
We develop a new purely combinatorial approach to N. Steenrod's problem on realisation of cycles. We prove that every n-dimensional homology class of every topological space can be realised with some multiplicity by an image of a…
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
We give a self-contained presentation and comparison of two different algorithms to explicitly solve quantum many body models of indistinguishable particles moving on a circle and interacting with two-body potentials of $1/\sin^2$-type. The…