Related papers: Soficity, short cycles and the Higman group

We present an approach for the traveling salesman problem with graph metric based on Steiner cycles. A Steiner cycle is a cycle that is required to contain some specified subset of vertices. For a graph $G$, if we can find a spanning tree…

In 1999, Jacobson and Lehel conjectured that for $k \geq 3$, every $k$-regular Hamiltonian graph has cycles of at least linearly many different lengths. This was further strengthened by Verstra\"{e}te, who asked whether the regularity can…

A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer,…

Inspired by the Stochastic processes described by the Feller Coupling and Chinese Restaurant Processes, we create four different bijections from words in the set $[1]\times [2] \times\cdot \times[n]$ to $S_n$. We then compose these maps…

We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…

We show that if $n$ is odd and $p \ge C \log n / n$, then with high probability Hamilton cycles in $G(n,p)$ span its cycle space. More generally, we show this holds for a class of graphs satisfying certain natural pseudorandom properties.…

Let p be an odd prime number. We show that there exists a finite group of order p^{p+3} whose the mod p cycle map from the mod p Chow ring of its classifying space to its ordinary mod p cohomology is not injective.

In this paper we consider the existence of Hamilton cycles in the random graph $G=G_{n,m}^{\delta\geq 3}$. This a random graph chosen uniformly from the set of graphs with vertex set $[n]$, $m$ edges and minimum degree at least 3. Our…

We investigate the notion of soficity for monoids. A group is sofic as a group if and only if it is sofic as a monoid. All finite monoids, all commutative monoids, all free monoids, all cancellative one-sided amenable monoids, all…

The aim of this book is to show that the use of f-analytic families of finite type cycles (cycles having finitely many irreducible components, but not compact in general) in a given complex space may be useful in complex geometry, despite…

Let $X$ be a hyperk\"ahler variety, and assume $X$ has a non-symplectic automorphism $\sigma$ of order $>{1\over 2}\dim X$. Bloch's conjecture predicts that the quotient $X/<\sigma>$ should have trivial Chow group of $0$-cycles. We verify…

We classify compact Riemann surfaces of genus $g$, where $g-1$ is a prime $p$, which have a group of automorphisms of order $\rho(g-1)$ for some integer $\rho\ge 1$, and determine isogeny decompositions of the corresponding Jacobian…

Let $\mathscr{G}$ be the class of plane graphs without triangles normally adjacent to $8^{-}$-cycles, without $4$-cycles normally adjacent to $6^{-}$-cycles, and without normally adjacent $5$-cycles. In this paper, it is shown that every…

Let $X$ be a hyperk\"ahler variety, and assume that $X$ admits a non-symplectic automorphism $\sigma$ of order $k>{1\over 2}\dim X$. Bloch's conjecture predicts that the quotient $X/<\sigma>$ should have trivial Chow group of $0$-cycles. We…

Consider a random three-coordinate lattice of spherical topology having 2v vertices and being densely covered by a single closed, self-avoiding walk, i.e. being equipped with a Hamiltonian cycle. We determine the number of such objects as a…

Planar piecewise linear systems with two linearity zones separated by a straight line and with a periodic orbit at infinity are considered. By using some changes of variables and parameters, a reduced canonical form with five parameters is…

A non-planar graph is almost-planar if either deleting or contracting any edge makes it planar. A graph with $n$ vertices is pancyclic if it contains a cycle of every length from $3$ to $n$, and it is Hamiltonian if it contains a cycle of…

Let $\pi$ be a finitely presented group. If h is a non trivial homology class in Hn($\pi$; Z), a theorem of Gromov (see [Gro83], 6) asserts the existence of regular geometric cycles which represent h, whose relative systolic volume is as…

We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2^{n/3}) ~= 1.260^n and linear space. Our algorithm can find the minimum weight Hamiltonian cycle (traveling salesman problem), in the…

The goal of this article is to try understand where Hodge cycles on a singular complex projective variety X come from. As a first step we consider Hodge cycles on the maximal pure quotient $H^{2p}(X)/W_{2p-1}$, and introduce a class of…