English
Related papers

Related papers: Rational Weyl group elements of odd type D

200 papers

We prove that for any given $\varepsilon>0$ and $d\in [0,1]$, every sufficiently large $(\varepsilon, d)$-dense graph $G$ contains for each odd integer $r$ at least $(d^r-\varepsilon)|V(G)|^r$ cycles of length $r$. Here, $G$ being…

Combinatorics · Mathematics 2016-04-26 Christian Reiher

The periodic system of chemical elements is represented within the framework of the weight diagram of the Lie algebra of the fourth rank of the rotation group of an eight-dimensional pseudo-Euclidean space. The hydrogen realization of the…

Mathematical Physics · Physics 2025-01-31 V. V. Varlamov

Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…

Group Theory · Mathematics 2015-03-05 Van Minh Nguyen

Let $G$ be a group and $m$ a positive integer. We say an $m$-Cayley digraph $\Gamma$ over $G$ is a digraph that admits a group of automorphisms isomorphic to $G$ acting semiregularly on the vertex set with $m$ orbits. The digraph $\Sigma$…

Group Theory · Mathematics 2025-07-22 Songnian Xu , Dein Wong , Chi Zhang , Jinxing Zhao

By a classic result of Gessel, the exponential generating functions for $k$-regular graphs are D-finite. Using Gr\"obner bases in Weyl algebras, we compute the linear differential equations satisfied by the generating function for 5-, 6-,…

Combinatorics · Mathematics 2025-06-30 Frédéric Chyzak , Marni Mishna

We study substructures of the Weyl group of conformal transformations of the metric of (pseudo)Riemannian manifolds. These substructures are identified by differential constraints on the conformal factors of the transformations which are…

High Energy Physics - Theory · Physics 2024-07-10 Riccardo Martini , Gregorio Paci , Dario Sauro , Gian Paolo Vacca , Omar Zanusso

In 1990, D.Snow proposed an effective algorithm for computing the orbits of finite Weyl groups. Snow's algorithm is designed for computation of weights, $W$-orbits and elements of the Weyl group. An extension of Snow's algorithm is…

Representation Theory · Mathematics 2023-11-21 Rafael Stekolshchik

It is shown that the generators of two discrete Heisenberg-Weyl groups with irrational rotation numbers $\theta$ and $-1/ \theta$ generate the whole algebra $\cal B$ of bounded operators on $L_2(\bf R)$. The natural action of the modular…

High Energy Physics - Theory · Physics 2009-10-28 L. Faddeev

We continue the study of separable elements in finite Weyl groups. These elements generalize the well-studied class of separable permutations. We show that the multiplication map $W/U \times U \to W$ is a length-additive bijection, or…

Combinatorics · Mathematics 2020-11-03 Christian Gaetz , Yibo Gao

In this paper we construct all strongly regular graphs, with at most 600 vertices, admitting a transitive action of the orthogonal group $O^+(6,2)$ or $O^-(6,2)$. Consequently, we prove the existence of strongly regular graphs with…

Combinatorics · Mathematics 2016-12-06 Dean Crnković , Sanja Rukavina , Andrea Švob

We determine several generalised Ramsey numbers for two sets $\Gamma_1$ and $\Gamma_2$ of cycles, in particular, all generalised Ramsey numbers $R(\Gamma_1,\Gamma_2)$ such that $\Gamma_1$ or $\Gamma_2$ contains a cycle of length at most…

Combinatorics · Mathematics 2016-05-16 Mikael Hansson

An important aspect of Weyl anomalies is that they encode information on the irreversibility of the renormalisation group flow. We consider, $\Delta \bar b = \bar{b}^{\textrm{UV}} - \bar{b}^{\textrm{IR}}$, the difference of the ultraviolet…

High Energy Physics - Theory · Physics 2017-08-23 Vladimir Prochazka , Roman Zwicky

A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…

Combinatorics · Mathematics 2023-12-13 Michael Krivelevich , Alan Lew , Peleg Michaeli

The wheel $W_{k}$ is the graph on $k+1$ vertices consisting of a vertex joined to a cycle of length $k$, and we say that $W_k$ is an even wheel if $k$ is even. Mao, Wang, Magnant, Schiermeyer proved that the Ramsey number of $W_{2n}$ is…

Combinatorics · Mathematics 2026-04-20 Louis DeBiasio , Tucker Wimbish

A doubly group-labeled graph is an oriented graph with its edges labeled by elements of the direct sum of two groups $\Gamma_1,\Gamma_2$. A cycle in a doubly group-labeled graph is $(\Gamma_1,\Gamma_2)$-non-zero if it is non-zero in both…

Combinatorics · Mathematics 2019-03-29 Tony Huynh , Felix Joos , Paul Wollan

Building on work of Doyle and Hyde on polynomial maps in one variable, we produce for each odd integer $d \geq 2$ a H\'enon map of degree $d$ defined over $\mathbb{Q}$ with at least $(d-4)^2$ integral periodic points. This provides a…

Dynamical Systems · Mathematics 2025-07-09 Hyeonggeun Kim , Holly Krieger , Mara-Ioana Postolache , Vivian Szeto

We classify the simple modules for the rational Cherednik algebra that are irreducible when restricted to W, in the case when W is a finite Weyl group. The classification turns out to be closely related to the cuspidal two-sided cells in…

Representation Theory · Mathematics 2015-03-31 Dan Ciubotaru

In this paper, we consider a one-parameter family of degree $d\ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. We construct a polynomial whose roots correspond to parameter values for which the…

Number Theory · Mathematics 2021-01-26 Minsik Han

In this paper, we classify connected amply regular graphs with diameter $d \geq 4$ and parameters $(v, k, \lambda, \mu)$ satisfying $\mu = \frac{k-1}{2}$, where $k\geq 5$ is odd. We prove that such a graph must be exactly one of the…

Combinatorics · Mathematics 2026-05-26 Wei Jin , Jack H. Koolen , Chenhui Lv

Let $H_{\mathrm{WR}}$ be the path on $3$ vertices with a loop at each vertex. D. Galvin conjectured, and E. Cohen, W. Perkins and P. Tetali proved that for any $d$-regular simple graph $G$ on $n$ vertices we have…

Combinatorics · Mathematics 2017-02-03 Emma Cohen , Péter Csikvári , Will Perkins , Prasad Tetali