English
Related papers

Related papers: Sharp hypercontractivity for symmetric groups and …

200 papers

We provide the spectral expansion in a weighted Hilbert space of a substantial class of invariant non-self-adjoint and non-local Markov operators which appear in limit theorems for positive-valued Markov processes. We show that this class…

Probability · Mathematics 2022-03-08 Pierre Patie , Mladen Savov

We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…

Geometric Topology · Mathematics 2022-11-17 Tarik Aougab , Jonah Gaster

A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…

Combinatorics · Mathematics 2024-10-02 So Hirata

An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…

Combinatorics · Mathematics 2021-08-02 Fu-Gang Yin , Yan-Quan Feng , Jin-Xin Zhou , A-Hui Jia

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…

Combinatorics · Mathematics 2020-05-20 C. Dalfó , M. A. Fiol , N. López

The purpose of this article is to expose an algebraic closure property of supersolutions to certain diffusion equations. This closure property quickly gives rise to a monotone quantity which generates a hypercontractivity inequality. Our…

Functional Analysis · Mathematics 2019-05-21 Yosuke Aoki , Jonathan Bennett , Neal Bez , Shuji Machihara , Kosuke Matsuura , Shobu Shiraki

Subject to suitable boundary conditions being imposed, sharp inequalities are obtained on integrals over a region $\Omega$ of certain special quadratic functions $f(\bf{E})$ where $\bf{E}(\bf{x})$ derives from a potential $\bf{U}(\bf{x})$.…

Analysis of PDEs · Mathematics 2014-11-14 Graeme W. Milton

Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…

Combinatorics · Mathematics 2022-10-04 Siqi Liu , Sidhanth Mohanty , Tselil Schramm , Elizabeth Yang

This paper is the second in a series of studies on developing efficient artificial intelligence-based approaches to pathfinding on extremely large graphs (e.g. $10^{70}$ nodes) with a focus on Cayley graphs and mathematical applications.…

We introduce a new notion of "regularity structure" that provides an algebraic framework allowing to describe functions and / or distributions via a kind of "jet" or local Taylor expansion around each point. The main novel idea is to…

Analysis of PDEs · Mathematics 2015-06-15 Martin Hairer

A group $G$ is complete group if it satisfies $Z(G)=e$ and $Aut(G)=Inn(G)$. In this paper, on the one hand, we study the basic properties of generalized Cayley graphs and characterize two classes isomorphic generalized generalized Cayley…

Combinatorics · Mathematics 2024-05-07 Qianfen Liao , Liu Weijun

We prove a variant of the multidimensional polynomial Szemer\'edi theorem of Bergelson and Leibman where one replaces polynomial sequences with other sparse sequences defined by functions that belong to some Hardy field and satisfy certain…

Dynamical Systems · Mathematics 2012-02-23 Nikos Frantzikinakis

We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator…

Combinatorics · Mathematics 2024-02-16 Martin Otto

An important approach for efficient inference in probabilistic graphical models exploits symmetries among objects in the domain. Symmetric variables (states) are collapsed into meta-variables (meta-states) and inference algorithms are run…

Artificial Intelligence · Computer Science 2016-07-01 Ankit Anand , Aditya Grover , Mausam , Parag Singla

A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…

Combinatorics · Mathematics 2025-09-30 Sean Dewar , Georg Grasegger , Eleftherios Kastis , Anthony Nixon

We derive an asymptotic expansion for the subgroup of arbitrary Fuchsian groups and some other classes of large groups. Moreover, the main conjecture for Random Walks on symmetric groups is established in full generality. Both problems…

Group Theory · Mathematics 2007-05-23 Thomas W. Mueller , Jan-Christoph Schlage-Puchta

We give an introduction to the Cayley-Abels graph for a totally disconnected, locally compact (tdlc) group. It is a generalization of the Cayley graph. We illustrate that on the one hand, Cayley-Abels graphs are useful tools to extend…

Group Theory · Mathematics 2022-10-31 Waltraud Lederle

We show that pseudo-Anosov mapping classes are generic in every Cayley graph of the mapping class group of a finite-type hyperbolic surface. Our method also yields an analogous result for rank-one CAT(0) groups and hierarchically hyperbolic…

Geometric Topology · Mathematics 2025-10-21 Inhyeok Choi

Statistical models that possess symmetry arise in diverse settings such as random fields associated to geophysical phenomena, exchangeable processes in Bayesian statistics, and cyclostationary processes in engineering. We formalize the…

Statistics Theory · Mathematics 2011-12-01 Parikshit Shah , Venkat Chandrasekaran

We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph…

Combinatorics · Mathematics 2019-12-03 Simon Schmidt , Chase Vogeli , Moritz Weber