Related papers: The CLLC conjecture holds for cyclic outer permuta…

We prove an analogue of Jacquet's conjecture on the local converse theorem for \ell-adic families of co-Whittaker representations of GL_n(F), where F is a finite extension of Q_p and \ell does not equal p. We also prove an analogue of…

We prove a generalization of the Conley conjecture: Every Hamiltonian diffeomorphism of a closed symplectic manifold has infinitely many periodic orbits if the first Chern class vanishes over the second fundamental group. In particular, we…

Let $K$ be a local function field of characteristic $l$, $\mathbb{F}$ be a finite field over $\mathbb{F}_p$ where $l \ne p$, and $\overline{\rho}: G_K \rightarrow \text{GL}_n (\mathbb{F})$ be a continuous representation. We apply the…

We prove a conjecture by Shannon Starr regarding the asymptotics for the number of tuples of commuting permutations with given number of joint orbits. These numbers generalize unsigned Stirling numbers of the first kind which count how many…

Combining a selection of tools from modern algebraic geometry, representation theory, the classical invariant theory of binary forms, together with explicit calculations with hypergeometric series and Feynman diagrams, we obtain the…

In this article, we study the Beilinson-Bloch-Kato conjecture for motives corresponding to the Rankin-Selberg product of conjugate self-dual automorphic representations, within the framework of the Gan-Gross-Prasad conjecture. We show that…

In 1998, Reed conjectured that every graph $G$ satisfies $\chi(G) \leq \lceil \frac{1}{2}(\Delta(G) + 1 + \omega(G))\rceil$, where $\chi(G)$ is the chromatic number of $G$, $\Delta(G)$ is the maximum degree of $G$, and $\omega(G)$ is the…

We conjecture a formula for the generating function of genus one Gromov-Witten invariants of the local Calabi-Yau manifolds which are the total spaces of splitting bundles over projective spaces. We prove this conjecture in several special…

We develop a new toolbox for the analysis of the global behavior of stochastic discrete particle systems. We introduce and study the notion of the Schur generating function of a random discrete configuration. Our main result provides a…

A step forward is made in a long standing Lov\'{a}sz's problem regarding hamiltonicity of vertex-transitive graphs by showing that every connected vertex-transitive graph of order a product of two primes, other than the Petersen graph,…

In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…

We present a theory which predicts if the locus of a triangle center over certain Poncelet triangle families is a conic or not. We consider families interscribed in (i) the confocal pair and (ii) an outer ellipse and an inner concentric…

We show that the critical probability for percolation on a d-regular non-amenable graph of large girth is close to the critical probability for percolation on an infinite d-regular tree. This is a special case of a conjecture due to O.…

Let k be an algebraically closed subfield of the complex numbers, and X a variety defined over k. One version of the Beilinson-Hodge conjecture that seems to survive scrutiny is the statement that the Betti cycle class map cl_{r,m} :…

We present (bi-)symmetric generating functions for the joint distributions of Euler-Stirling statistics on permutations, including the number of descents ($\mathsf{des}$), inverse descents ($\mathsf{ides}$), the number of left-to-right…

We show how to construct an explicit Hamilton cycle in the directed Cayley graph Cay({\sigma_n, sigma_{n-1}} : \mathbb{S}_n), where \sigma_k = (1 2 >... k). The existence of such cycles was shown by Jackson (Discrete Mathematics, 149 (1996)…

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

A permutation $\sigma$ of a multiset is called Stirling permutation if $\sigma(s)\ge \sigma(i)$ as soon as $\sigma(i)=\sigma(j)$ and $i<s<j.$ In our paper we study Stirling polynomials that arise in the generating function for descent…

For Young systems, i.e. for hyperbolic systems without/with singularities satisfying Lai-Sang Young's axioms (which imply exponential decay of correlation and the CLT) a local CLT is proven. In fact, a unified version of the local CLT is…

Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between orbits of graphs and error-correcting codes. We define a new…