Related papers: Rational Weyl group elements of odd type D

We unify results of Artin, Brieskorn, Slodowy and others by showing that, in all characteristics, the Artin component of the deformation space of a rational surface singularity has a ramified cover where simultaneous resolution exists and…

For a graph $G$, the $k$-colour Ramsey number $R_k(G)$ is the least integer $N$ such that every $k$-colouring of the edges of the complete graph $K_N$ contains a monochromatic copy of $G$. Let $C_n$ denote the cycle on $n$ vertices. We show…

This paper introduces and studies a class of Weyl-type algebras \(A_{p,t,\cA} = \Weyl{e^{\pm x^{p} e^{t x}},\; e^{\cA x},\; x^{\cA}}\) constructed over exponential-polynomial rings, where \(\FF\) is a field of characteristic zero, \(\cA\)…

Given a group $G$, an {\em $m$-Cayley digraph $\G$ over $G$} is a digraph that has a group of automorphisms isomorphic to $G$ acting semiregularly on the vertex set with $m$ orbits. We say that $G$ admits an {\em oriented $m$-semiregular…

Every simple finite graph $G$ has an associated Lov\'asz-Saks-Schrijver ring $R_G(d)$ that is related to the $d$-dimensional orthogonal representations of $G$. The study of $R_G(d)$ lies at the intersection between algebraic geometry,…

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

Let Phi be a reduced root system of rank r. A Weyl group multiple Dirichlet series for Phi is a Dirichlet series in r complex variables s_1,...,s_r, initially converging for Re(s_i) sufficiently large, that has meromorphic continuation to…

The sandpile group of a connected graph is the group of recurrent configurations in the abelian sandpile model on this graph. We study the structure of this group for the case of regular trees. A description of this group is the following:…

For graphs $H_1,H_2$ by $r^*(H_1,H_2)$ we denote the minimum number of edges in a graph $G$ on $r(H_1,H_2)$ vertices such that $G\to (H_1,H_2)$. We show that for each pair of natural numbers $k,n$, $k\le n$, where $k$ is odd and $n$ is…

A conjecture of Birmel\'e, Bondy and Reed states that for any integer $\ell\geq 3$, every graph $G$ without two vertex-disjoint cycles of length at least $\ell$ contains a set of at most $\ell$ vertices which meets all cycles of length at…

The Kohayakawa-Nagle-R\"odl-Schacht conjecture roughly states that every sufficiently large locally $d$-dense graph $G$ on $n$ vertices must contain at least $(1-o(1))d^{|E(H)|}n^{|V(H)|}$ copies of a fixed graph $H$. Despite its important…

For a graph $G$, we write $G\rightarrow \big(K_{r+1},\mathcal{T}(n,D)\big)$ if every blue-red colouring of the edges of $G$ contains either a blue copy of $K_{r+1}$, or a red copy of each tree with $n$ edges and maximum degree at most $D$.…

Let $G=(V,E)$ be a graph and let $r\ge 1$ be an integer. For a set $D \subseteq V$, define $N_r[x] = \{y \in V: d(x, y) \leq r\}$ and $D_r(x) = N_r[x] \cap D$, where $d(x,y)$ denotes the number of edges in any shortest path between $x$ and…

A longstanding conjecture of Erd\H{o}s and Simonovits states that for every rational $r$ between $1$ and $2$ there is a graph $H$ such that the largest number of edges in an $H$-free graph on $n$ vertices is $\Theta(n^r)$. Answering a…

Introduced by Albertson et al. \cite{albertson}, the distinguishing number $D(G)$ of a graph $G$ is the least integer $r$ such that there is a $r$-labeling of the vertices of $G$ that is not preserved by any nontrivial automorphism of $G$.…

We prove that the Weyl algebra over $\mathbb{C}$ cannot be a fixed ring of any domain under a nontrivial action of a finite group by algebra automorphisms, thus settling a 30-year old problem. In fact, we prove the following much more…

Let $W$ be a simply laced Weyl group of finite type and rank $n$. If $W$ has type $E_7$, $E_8$, or $D_n$ for $n$ even, then the root system of $W$ has subsystems of type $nA_1$. This gives rise to an irreducible Macdonald representation of…

Let $G$ be a finite group and $K$ a normal subset consisting of odd-order elements. The rational closure of $K$, denoted $\mathbf D_K$, is the set of elements $x \in G$ with the property that $\langle x \rangle = \langle y \rangle$ for some…

We associate a graph $\mathcal{C}_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | < x,y> \text{is cyclic for all} y\in G\}$ is called…

Given a polynomial of degree d over a number field, the image of the associated arboreal representation of the absolute Galois group of the field is a profinite group acting on the d-ary tree. Boston and Jones conjectured that for a…