Related papers: H-Kernels by Walks

Consider $G=SL_2(\mathbb{Z})/\{\pm I\}$ acting on the complex upper half plane $H$ by $h_M(z)=\frac{az+b}{cz+d},$ for $M \in G$. Let $D=\{z \in H: |z|\geq 1, |\Re(z)|\leq 1/2\}$. We consider the set $\mathcal{E} \subset G$ with the $9$…

An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is pancyclic if it contains cycles of all lengths from $3$ up to $n$. In 1972, Erd\H{o}s conjectured that every Hamiltonian graph with…

We show that every $3$-uniform hypergraph $H=(V,E)$ with $|V(H)|=n$ and minimum pair degree at least $(4/5+o(1))n$ contains a squared Hamiltonian cycle. This may be regarded as a first step towards a hypergraph version of the P\'osa-Seymour…

We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of…

I prove that even $A$-cycles have the edge-Erd\H{o}s-P\'osa property.

We present a family of partitions of $W_\mathcal{G}$, the set of walks on a directed graph $\mathcal{G}$. Each partition in this family is identified by an integer sequence $K$, which specifies a collection of cycles on $\mathcal{G}$ with a…

An Euler tour in a hypergraph (also called a rank-2 universal cycle or 1-overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this paper, we define a covering $k$-hypergraph to be a non-empty…

We show that every $k$-uniform hypergraph on $n$ vertices whose minimum $(k-2)$-degree is at least $(5/9+o(1))n^2/2$ contains a Hamiltonian cycle. A construction due to Han and Zhao shows that this minimum degree condition is optimal. The…

For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…

A non-backtracking walk on a graph, $H$, is a directed path of directed edges of $H$ such that no edge is the inverse of its preceding edge. Non-backtracking walks of a given length can be counted using the non-backtracking adjacency…

Let $H^2_d$ be the Drury-Arveson space, and let $f\in H^2_d$ have bounded argument and no zeros in $\mathbb{B}_d$. We show that $f$ is cyclic in $H^2_d$ if and only if $\log f$ belongs to the Pick-Smirnov class $N^+(H^2_d)$. Furthermore,…

We prove that if $G$ is a $k$-partite graph on $n$ vertices in which all of the parts have order at most $n/r$ and every vertex is adjacent to at least a $1-1/r+o(1)$ proportion of the vertices in every other part, then $G$ contains the…

Suppose that D is an acyclic orientation of a graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let m and M denote the minimum and the maximum of the number of dependent arcs over all acyclic orientations of…

The rotor-router model on a graph describes a discrete-time walk accompanied by the deterministic evolution of configurations of rotors randomly placed on vertices of the graph. We prove the following property: if at some moment of time,…

For each $n\ge5$, we give an $S_n$-equivariant basis for $H_4(\overline{\mathcal{M}_{0,n}},\mathbb{Q})$, as well as for $H_{2(n-5)}(\overline{\mathcal{M}_{0,n}},\mathbb{Q})$. Such a basis exists for…

We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above…

Given a connected semisimple Lie group $G$, Monod has recently proved that the measurable cohomology of the $G$-action $H^*_m(G \curvearrowright G/P)$ on the Furstenberg boundary $G/P$, where $P$ is a minimal parabolic subgroup, maps…

We show that a $2k$-current $T$ on a complex manifold is a real holomorphic $k$-chain if and only if $T$ is locally real rectifiable, $d$-closed and has $\mathcal{H}^{2k}$-locally finite support. This result is applied to study homology…

Let $G$ be a connected linear algebraic group over a number field $K$, let $\Gamma$ be a finitely generated Zariski dense subgroup of $G(K)$ and let $Z\subseteq G(K)$ be a thin set, in the sense of Serre. We prove that, if…

We show that an edge-dominating cycle in a $2K_2$-free graph can be found in polynomial time; this implies that every 1/(k-1)-tough $2K_2$-free graph admits a k-walk, and it can be found in polynomial time. For this class of graphs, this…