English
Related papers

Related papers: Hjorth's reflection argument

200 papers

We prove that if an $n$-vertex graph with minimum degree at least $3$ contains a Hamiltonian cycle, then it contains another cycle of length $n-o(n)$; this implies, in particular, that a well-known conjecture of Sheehan from 1975 holds…

Combinatorics · Mathematics 2017-09-19 António Girão , Teeradej Kittipassorn , Bhargav Narayanan

Helfgott proved that there exists a $\delta>0$ such that if $S$ is a symmetric generating subset of $SL(2,p)$ containing 1 then either $S^3=SL(2,p)$ or $|S^3|\geq |S|^{1+\delta}$. It is known that $\delta\geq 1/3024$. Here we show that…

Group Theory · Mathematics 2014-11-24 Jack Button , Colva Roney-Dougal

We prove that for every $t \in \mathbb{N}$, prime-length cycles do not have the $\frac{1}{t}$-integral Erd\H{o}s-P\'osa property, even when restricted to planar graphs. We in fact prove a more general density result. For every $t \in…

Combinatorics · Mathematics 2026-05-07 Maximilian Gorsky , Kevin Hendrey , Tony Huynh

We consider non-Hermitian PT-symmetric deformation of $A_{N-1}$ type Calogero model without confining potential to investigate the possible existence of spectral singularity. By considering the Wronskian between asymptotic incoming and…

Mathematical Physics · Physics 2015-06-11 Bhabani Prasad Mandal , Ananya Ghatak

The Ohno-Nakagawa (O-N) reflection theorem is an unexpectedly simple identity relating the number of $\mathrm{GL}_2 \mathbb{Z}$-classes of binary cubic forms (equivalently, cubic rings) of two different discriminants $D$, $-27D$; it…

Number Theory · Mathematics 2022-02-18 Evan M. O'Dorney

Berstel proved that the Arshon sequence cannot be obtained by iteration of a morphism. An alternative proof of this fact is given here. The $\sigma$-sequence was constructed by Evdokimov in order to construct chains of maximal length in the…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev

We prove a conjecture of Boros, Caro, F\"uredi and Yuster on the maximum number of edges in a 2-connected graph without repeated cycle lengths, which is a restricted version of a longstanding problem of Erd\H{o}s. Our proof together with…

Combinatorics · Mathematics 2020-07-27 Jie Ma , Tianchi Yang

Using Cohen's classification of symplectic reflection groups, we prove that the parabolic subgroups, that is, stabilizer subgroups, of a finite symplectic reflection group are themselves symplectic reflection groups. This is the symplectic…

Group Theory · Mathematics 2022-12-05 Gwyn Bellamy , Johannes Schmitt , Ulrich Thiel

An even lattice $M$ of signature $(n,2)$ is called $2$-reflective if there is a non-constant modular form for the orthogonal group of $M$ which vanishes only on quadratic divisors orthogonal to $2$-roots of $M$. In [Amer. J. Math. 2017]…

Number Theory · Mathematics 2023-01-30 Haowu Wang

We compactify M(atrix) theory on Riemann surfaces Sigma with genus g>1. Following [1], we construct a projective unitary representation of pi_1(Sigma) realized on L^2(H), with H the upper half-plane. As a first step we introduce a suitably…

High Energy Physics - Theory · Physics 2018-06-20 G. Bertoldi , J. M. Isidro , M. Matone , P. Pasti

The purpose of this article is two-fold: We first give a more elementary proof of a recent theorem of Korkmaz, Monden, and the author, which states that the commutator length of the n-th power of a Dehn twist along a boundary parallel curve…

Geometric Topology · Mathematics 2013-05-03 R. Inanc Baykur

We prove a rank 1 version of the Hanna Neumann Theorem. This shows that every one-relator 2-complex without torsion has the nonpositive immersion property. The proof generalizes to staggered and reducible 2-complexes.

Group Theory · Mathematics 2015-08-26 Joseph Helfer , Daniel T. Wise

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Probability · Mathematics 2018-12-21 Volker Betz , Helge Schäfer , Dirk Zeindler

We prove a uniqueness result for limit cycles of the second order ODE $\ddot x + \dot x \phi(x,\dot x) + g(x) = 0$. Under mild additional conditions, we show that such a limit cycle attracts every non-constant solution. As a special case,…

Dynamical Systems · Mathematics 2015-05-19 Marco Sabatini

Let $n_{1}$ and $n_{2}$ be two integers with $n_{1},n_{2}\geq3$ and $G$ a graph of order $n=n_{1}+n_{2}$. As a generalization of Ore's degree condition for the existence of Hamilton cycle in $G$, El-Zahar proved that if $\delta(G)\geq…

Combinatorics · Mathematics 2019-05-02 Maoqun Wang , Jianguo Qian

The cycle set of a graph $G$ is the set consisting of all sizes of cycles in $G$. Answering a conjecture of Erd\H{o}s and Faudree, Verstra\"{e}te showed that there are at most $2^{n - n^{1/10}}$ different cycle sets of graphs with $n$…

Combinatorics · Mathematics 2025-09-23 Rajko Nenadov

Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…

Combinatorics · Mathematics 2019-01-21 David E Speyer

We describe all extensions of the Calogero Hamiltonian \[L=-\frac{d^2}{dr^2}+\frac{b}{r^2} \quad \text{in}\ L^2(\mathbb{R}_+), \quad b <-\frac{1}{4}\] having non empty resolvent and generating an analytic semigroup in $L^2(\mathbb{R}_+)$.

Analysis of PDEs · Mathematics 2017-11-06 G. Metafune , M. Sobajima

A classical theorem of Jordan asserts that if a group $G$ acts transitively on a finite set of size at least $2$, then $G$ contains a derangement (a fixed-point free element). Generalisations of Jordan's theorem have been studied…

Group Theory · Mathematics 2025-06-16 Melissa Lee , Tomasz Popiel , Gabriel Verret

We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequence of length $2^{2^{\theta (n)}}$. It perfectly match the…

Discrete Mathematics · Computer Science 2015-12-08 Wojciech Czerwinski , Tomasz Gogacz , Eryk Kopczynski
‹ Prev 1 3 4 5 6 7 10 Next ›