Related papers: Cycles and 1-unconditional matrices

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

McDonald and Paparella [Linear Algebra Appl. 498 (2016), 145--159] gave a necessary condition on the structure of Jordan chains of $h$-cyclic matrices. In this work, that necessary condition is shown to be sufficient. As a consequence, we…

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.…

A $2t$-cycle system of order $v$ is a set $\mathcal{C}$ of cycles whose edges partition the edge-set of $K_v-I$ (i.e., the complete graph minus the $1$-factor $I$). If $v\equiv 0 \pmod{2t}$, a set of $v/2t$ vertex-disjoint cycles of…

Voiculescu's freeness emerges in computing the asymptotic of spectra of polynomials on $N\times N$ random matrices with eigenspaces in generic positions: they are randomly rotated with a uniform unitary random matrix $U_N$. In this article…

We formulate simple graphical rules which allow explicit calculation of nonperturbative $c=1$ $S$-matrices. This allows us to investigate the constraint of nonperturbative unitarity, which indeed rules out some theories. Nevertheless, we…

In this paper, we first present spectral conditions for the existence of $C_{n-1}$ in graphs (2-connected graphs) of order $n$, which are motivated by a conjecture of Erd\H{o}s. Then we prove spectral conditions for the existence of…

We study the initial value problem '$s\,' = c^{p - 1}, \; c\,' = -s^{p - 1}; \; \; s(0) = 0, \; c(0) = 1$' (both as a real system and as a complex system) for each integer $p > 2$, considering separately the cases '$p$ even' and '$p$ odd'.

Let $\mathcal{G}(n,r,s)$ denote a uniformly random $r$-regular $s$-uniform hypergraph on $n$ vertices, where $s$ is a fixed constant and $r=r(n)$ may grow with $n$. An $\ell$-overlapping Hamilton cycle is a Hamilton cycle in which…

Given a smooth and separated K(pi,1) variety X over a field k, we associate a "cycle class" in etale cohomology with compact supports to any continuous section of the natural map from the arithmetic fundamental group of X to the absolute…

In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item…

Let X be a smooth variety over a field k, and l be a prime number invertible in k. We study the (\'etale) unramified H^3 of X with coefficients Q_l/Z_l(2) in the style of Colliot-Th\'el\`ene and Voisin. If k is separably closed, finite or…

In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…

We consider three different models of sparse random graphs:~undirected and directed Erd\H{o}s-R\'{e}nyi graphs, and random bipartite graph with an equal number of left and right vertices. For such graphs we show that if the edge…

In Micchelli's paper "Interpolation of scattered data: distance matrices and conditionally positive functions", deep results were obtained concerning the invertibility of matrices arising from radial basis function interpolation. In…

Let $G$ be a graph and let $I = I(G)$ be its edge ideal. When $G$ is unicyclic, we give a decomposition of symbolic powers of $I$ in terms of its ordinary powers. This allows us to explicitly compute the Waldschmidt constant and the…

This article studies the equation $[A,B]^k = {\rm Id}_n$ for matrices over $\mathbb{C}$, characterizing the pairs $(k,n)$ for which solutions exist via a classical result of Lam and Leung on sums of roots of unity. The problem is next…

It is shown by Karp reduction that deciding the singularity of $(2^n - 1) \times (2^n - 1)$ sparse circulant matrices (SC problem) is NP-complete. We can write them only implicitly, by indicating values of the $2 + n(n + 1)/2$ eventually…

We prove that constant minimum degree already forces cycles with almost linearly many chords. Specifically, every graph $G$ with $\delta(G)\ge C$ contains a cycle of length $\ell\ge 4$ with $\Omega(\ell/\log^{C}\ell)$ chords for some…

An $n$-vertex graph is called pancyclic if it contains a cycle of length $t$ for all $3 \leq t \leq n$. In this paper, we study pancyclicity of random graphs in the context of resilience, and prove that if $p \gg n^{-1/2}$, then the random…