English
Related papers

Related papers: Towards super-approximation in positive characteri…

200 papers

Let $G$ be a finite group and $G_p$ be a Sylow $p$-subgroup of $G$ for a prime $p$ in $\pi(G)$, the set of all prime divisors of the order of $G$. The automiser $A_p(G)$ is defined to be the group $N_G(G_p)/G_pC_G(G_p)$. We define the Sylow…

Group Theory · Mathematics 2009-12-16 L. S. Kazarin , A. Martínez-Pastor , M. D. Pérez-Ramos

We investigate prime character degree graphs of solvable groups. In particular, we consider a family of graphs $\Gamma_{k,t}$ constructed by adjoining edges between two complete graphs in a one-to-one fashion. In this paper we determine…

Group Theory · Mathematics 2018-03-15 Mark W. Bissler , Jacob Laubacher

A polynomial family $\{p_n(x)\}$ is Appell if it is given by $\frac{e^{xt}}{g(t)} = \sum_{n=0}^\infty p_n(x)t^n$ or, equivalently, $p_n'(x) = p_{n-1}(x)$. If $g(t)$ is an entire function, $g(0)\neq 0$, with at least one zero, the…

Combinatorics · Mathematics 2008-09-09 Robert P. Boyer William M. Y. Goh

A hereditary class of graphs $\mathcal{G}$ is \emph{$\chi$-bounded} if there exists a function $f$ such that every graph $G \in \mathcal{G}$ satisfies $\chi(G) \leq f(\omega(G))$, where $\chi(G)$ and $\omega(G)$ are the chromatic number and…

Let $n=2g+2$ be a positive even integer, $f(x)$ a degree $n$ complex polynomial without multiple roots and $C_f: y^2=f(x)$ the corresponding genus $g$ hyperelliptic curve over the field $\C$ of complex numbers. Let a $(g-1)$-dimensional…

Algebraic Geometry · Mathematics 2010-12-17 Yuri G. Zarhin

Let $\Z_n[i]$ be the ring of Gaussian integers modulo a positive integer $n$. Very recently, Camarero and Mart\'{i}nez [IEEE Trans. Inform. Theory, {\bf 62} (2016), 1183--1192], showed that for every prime number $p>5$ such that $p\equiv…

Information Theory · Computer Science 2020-10-13 Khodakhast Bibak , Bruce M. Kapron , Venkatesh Srinivasan

We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of $\mathbb{Z}[\zeta_m]/A$, with connection sets $\{\pm (\zeta_m^i + A): 0 \le i \le m-1\}$ and $\{\pm (\zeta_m^i + A): 0 \le…

Combinatorics · Mathematics 2018-09-27 Sanming Zhou

Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…

Group Theory · Mathematics 2025-11-21 Lucas Alland , Andrei Fridman , Thomas Michael Keller

Let $n$ be a positive integer, $q$ be a prime power, and $V$ be a vector space of dimension $n$ over $\mathbb{F}_q$. Let $G := V \rtimes G_0$, where $G_0$ is an irreducible subgroup of ${\rm GL}(V)$ which is maximal by inclusion with…

Combinatorics · Mathematics 2016-01-29 Carmen Amarra , Michael Giudici , Cheryl E. Praeger

The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…

Group Theory · Mathematics 2011-04-13 Khalid Bou-Rabee

It is known that the automorphism group of the elementary abelian $2$-group $Z_2^n$ is isomorphic to the general linear group $GL(n,F_2)$ of degree $n$ over $F_2$. Let $W$ be the collection of permutation matrices of order $n$. It is clear…

Combinatorics · Mathematics 2018-09-18 Lu Lu , Qiongxiang Huang , Jiangxia Hou

In this paper, the first of a series of two, we continue the study of higher index theory for expanders. We prove that if a sequence of graphs is an expander and the girth of the graphs tends to infinity, then the coarse Baum-Connes…

K-Theory and Homology · Mathematics 2010-12-21 Rufus Willett , Guoliang Yu

In this short note we answer a query of Brodzki, Niblo, \v{S}pakula, Willett and Wright by showing that all bounded degree uniformly locally amenable graphs have Property A. For the second result of the note recall that Kaiser proved that…

Metric Geometry · Mathematics 2021-04-20 Gábor Elek

We show that if a polynomial $f\in \mathbb{R}[x_1,\ldots,x_n]$ is nonnegative on a closed basic semialgebraic set $X=\{x\in\mathbb{R}^n:g_1(x)\ge 0,\ldots,g_r (x)\ge 0\}$, where $g_1,\ldots,g_r\in\mathbb{R}[x_1,\ldots,x_n]$, then $f$ can be…

Algebraic Geometry · Mathematics 2015-07-23 Krzysztof Kurdyka , Stanisław Spodzieja

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

Group Theory · Mathematics 2021-05-27 Arnbjörg Soffía Árnadóttir , Waltraud Lederle , Rögnvaldur G. Möller

We study some properties of the Cayley graph of the R.Thompson's group F in generators $x_0$, $x_1$. We show that the density of this graph, that is, the least upper bound of the average vertex degree of its finite subgraphs is at least 3.…

Group Theory · Mathematics 2007-05-23 Victor Guba

Let $\Gamma =(V,E)$ be a reflexive relation with a transitive automorphisms group. Let $v\in V$ and let $F$ be a finite subset of $V$ with $v\in F.$ We prove that the size of $\Gamma (F)$ (the image of $F$) is at least $$ |F|+ |\Gamma…

Combinatorics · Mathematics 2009-10-01 Y. O. Hamidoune

Let $\pi_1(C)$ be the algebraic fundamental group of a smooth connected affine curve, defined over an algebraically closed field of characteristic $p>0$ of countable cardinality. Let $N$ be a normal (resp. characteristic) subgroup of…

Algebraic Geometry · Mathematics 2013-12-03 Amilcar Pacheco , Pavel Zalesski , Katherine F. Stevenson

Motivated by the recent developments on the complexity of non-com\-mu\-ta\-tive determinant and permanent [Chien et al.\ STOC 2011, Bl\"aser ICALP 2013, Gentry CCC 2014] we attempt at obtaining a tight characterization of hard instances of…

Computational Complexity · Computer Science 2015-08-11 Christian Engels , B. V. Raghavendra Rao

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

Combinatorics · Mathematics 2020-06-05 C. Dalfó , M. A. Fiol , N. López , J. Ryan
‹ Prev 1 4 5 6 7 8 10 Next ›