Related papers: Soficity, short cycles and the Higman group

For piecewise-smooth differential systems, in this paper we focus on crossing limit cycles and sliding loops bifurcating from a grazing loop connecting one high multiplicity tangent point. For the low multiplicity cases considered in…

In two papers published in 1979, R. Bowen and C. Series defined a dynamical system from a Fuchsian group, acting on the hyperbolic plane $\mathbb{H}^2$. The dynamics is given by a map on $S^1$ which is, in particular, an expanding piecewise…

This is an expository paper about iterations of a smooth real function $f$ on $[0,\varepsilon)$ such that $f(0)=0$, $f'(0)=1$, and $f(x)<x$ for $x>0$, i.e., the sequence defined by $x_{n+1}=f(x_n)$. This sequence has interesting…

We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any $\gamma>0$ and $k\ge3$, we show that asymptotically almost surely, every subgraph of the binomial random $k$-uniform hypergraph…

There are few examples of non-autonomous vector fields exhibiting complex dynamics that may be proven analytically. We analyse a family of periodic perturbations of a weakly attracting robust heteroclinic network defined on the two-sphere.…

We present a memetic algorithm (\maa) approach for finding a Hamiltonian cycle in a Hamiltonian graph. The \ma is based on a proven approach to the Asymmetric Travelling Salesman Problem (\atspp) that, in this contribution, is boosted by…

We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences…

We use assembly maps to study $\mathbf{TC}(\mathbb{A}[G];p)$, the topological cyclic homology at a prime $p$ of the group algebra of a discrete group $G$ with coefficients in a connective ring spectrum $\mathbb{A}$. For any finite group, we…

Every topological group $G$ has some natural compactifications which can be a useful tool of studying $G$. We discuss the following constructions: (1) the greatest ambit $S(G)$ is the compactification corresponding to the algebra of all…

We associate a graph $\Gamma_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | \left<x,y\right> \text{is cyclic for all} y\in G\}$, and…

This paper investigates the exact number of limit cycles given by the averaging theory of first order for the piecewise smooth integrable non-Hamiltonian system \begin{eqnarray*} (\dot{x},\ \dot{y})=\begin{cases} (-y(x+a)^2+\varepsilon…

The paper has two parts. First we prove that the specialization maps on R-equivalence and on the Chow group of zero cycles are isomorphisms for families over a local, Henselian, Dedekind ring when the special fiber is smooth and separably…

For a given finite dimensional Hopf algebra $H$ we describe the set of all equivalence classes of cocycle deformations of $H$ as an affine variety, using methods of geometric invariant theory. We show how our results specialize to the…

In this paper, we show that any knot group maps onto at most finitely many knot groups. This gives an affirmative answer to a conjecture of J. Simon. We also bound the diameter of a closed hyperbolic 3-manifold linearly in terms of the…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

In this series of papers, the primary goal is to enumerate Hamiltonian cycles (HC's) on the grid cylinder graphs $P_{m+1}\times C_n$, where $n$ is allowed to grow whilst $m$ is fixed. In Part~I, we studied the so-called non-contractible…

Finding a Hamiltonian cycle in a given graph is computationally challenging, and in general remains so even when one is further given one Hamiltonian cycle in the graph and asked to find another. In fact, no significantly faster algorithms…

A graph on n vertices is called pancyclic if it contains a cycle of length l for all 3 \le l \le n. In 1972, Erdos proved that if G is a Hamiltonian graph on n > 4k^4 vertices with independence number k, then G is pancyclic. He then…

Given a prime $p$, we consider the dynamical system generated by repeated exponentiations modulo $p$, that is, by the map $u \mapsto f_g(u)$, where $f_g(u) \equiv g^u \pmod p$ and $0 \le f_g(u) \le p-1$. This map is in particular used in a…

In this paper we study cycles in random bipartite graph $G(n,n,p)$. We prove that if $p\gg n^{-2/3}$, then $G(n,n,p)$ a.a.s. satisfies the following. Every subgraph $G'\subset G(n,n,p)$ with more than $(1+o(1))n^2p/2$ edges contains a cycle…