Related papers: Orientations and cycles in supersingular isogeny g…
Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…
We compute the eigenvalue fluctuations of uniformly distributed random biregular bipartite graphs with fixed and growing degrees for a large class of analytic functions. As a key step in the proof, we obtain a total variation distance bound…
In this paper we study for the incompressible Euler equations the global structure of the bifurcation diagram for the rotating doubly connected patches near the degenerate case. We show that the branches with the same symmetry merge forming…
Efficient techniques to navigate networks with local information are fundamental to sample large-scale online social systems and to retrieve resources in peer-to-peer systems. Biased random walks, i.e. walks whose motion is biased on…
In this paper we consider a semitopological $\alpha$-bicyclic monoid $\mathcal{B}_{\alpha}$ and prove that it is algebraically isomorphic to a semigroup of all order isomorphisms between the principal upper sets of the ordinal…
In this paper, we are concerned about smoothing of Filippov systems around homoclinic-like connections to regular-tangential singularities. We provide conditions to guarantee the existence of limit cycles bifurcating from such connections.…
We study cumulants of numbers of $q$-step walks on Erd\"os-R\'enyi-type random graphs of long-range percolation radius model in the limit when the number of vertices $N$, concentration $c$, and the interaction radius $R$ tend to infinity.…
In this article, we study the structure of the graph implied by a given map on the set $S_p=\{1,2,\dots,p-1\}$, where $p$ is an odd prime. The consecutive applications of the map generate an integer sequence, or in graph theoretical context…
The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$, denoted $\mathscr{I}(G)$, is the graph whose vertices correspond to the…
We consider the problem of designing succinct navigational oracles, i.e., succinct data structures supporting basic navigational queries such as degree, adjacency, and neighborhood efficiently for intersection graphs on a circle, which…
The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em…
Vertical thermal convection is a non-equilibrium system in which both buoyancy and shear forces play a role in driving the convective flow. Beyond the onset of convection, the driven dissipative system exhibits chaotic dynamics and…
We study the behavior of solutions of mutually coupled equations in heterogeneous random graphs. Heterogeneity means that some equations receive many inputs whereas most of the equations are given only with a few connections. Starting from…
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…
We characterise the respective semigroups of mappings that preserve, or that preserve or reverse orientation of a finite cycle, in terms of their actions on oriented triples and oriented quadruples. This leads to a proof that the latter…
A Poisson outdegree-one graph is an oriented graph based on a Poisson point process such that each vertex has only one outgoing edge. The paper focuses on the absence of percolation for such graphs. Our main result is based on two…
A systematic study of closed classical orbits of the hydrogen atom in crossed electric and magnetic fields is presented. We develop a local bifurcation theory for closed orbits which is analogous to the well-known bifurcation theory for…
We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…
Bipolar orientations of planar maps have recently attracted some interest in combinatorics, probability theory and theoretical physics. Plane bipolar orientations with $n$ edges are known to be counted by the $n$th Baxter number $b(n)$,…
We investigate the relation between simple random walks on repeated barycentric subdivisions of a triangle and a self-similar fractal, Strichartz hexacarpet, which we introduce. We explore a graph approximation to the hexacarpet in order to…