English
Related papers

Related papers: Tame automorphisms with multidegrees in the form o…

200 papers

Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a…

Number Theory · Mathematics 2020-10-14 William D. Banks

We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…

Combinatorics · Mathematics 2017-12-12 Lutz Warnke

Let $D$ be a strong balanced digraph on $2a$ vertices. Adamus et al. have proved that $D$ is hamiltonian if $d(u)+d(v)\ge 3a$ whenever $uv\notin A(D)$ and $vu\notin A(D)$. The lower bound $3a$ is tight. In this paper, we shall show that the…

Combinatorics · Mathematics 2023-06-22 Ruixia Wang , Linxin Wu , Wei Meng

Let $m\geq 3$. Suppose that $$ 1-2^{-2^{m^24^m}}<\gamma<1. $$ Then the set $$ \{p\text{ prime}:\, p=[n^{\frac1\gamma}]\text{ for some }n\in{\mathbb N}\} $$ contains infinitely many non-trivial $m$-term arithmetic progressions.

Number Theory · Mathematics 2019-01-29 Hongze Li , Hao Pan

We study the structure of length four polynomial automorphisms of $R[X,Y]$ when $R$ is a UFD. The results from this study are used to prove that if $\text{SL}_m(R[X_1,X_2,..., X_n]) = \text{E}_m(R[X_1,X_2,..., X_n])$ for all $n, m \ge 0$…

Algebraic Geometry · Mathematics 2008-09-01 Sooraj Kuttykrishnan

For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…

Number Theory · Mathematics 2009-06-16 Shaofang Hong , Scott D. Kominers

We have primarily obtained three results on numbers of the form $p + 2^k$. Firstly, we have constructed many arithmetic progressions, each of which does not contain numbers of the form $p + 2^k$, disproving a conjecture by Erd\H{o}s as Chen…

Number Theory · Mathematics 2024-02-13 Yuda Chen , Xiangjun Dai , Huixi Li

Let $A$ be an elementary abelian group of order $p^{k}$ with $k\geq 3$ acting on a finite $p'$-group $G$. The following results are proved. If $\gamma_{k-2}(C_{G}(a))$ is nilpotent of class at most $c$ for any $a\in A^{#}$, then…

Group Theory · Mathematics 2011-12-30 Cristina Acciarri , Pavel Shumyatsky

Fix a positive integer $g$ and rational prime $p$. We prove the existence of a genus $g$ curve $C/\mathbb{Q}$ such that the mod $p$ representation of its Jacobian is tame by imposing conditions on the endomorphism ring. As an application,…

Number Theory · Mathematics 2020-06-09 Matthew Bisatt

We construct an Anick type wild automorphism $\delta$ in a 3-generated free Poisson algebra which induces a tame automorphism in a 3-generated polynomial algebra. We also show that $\delta$ is stably tame. Dedicated to the memory of…

Rings and Algebras · Mathematics 2024-07-09 Ivan Shestakov , Zerui Zhang

Ramsey theory is a central and active branch of combinatorics. Although Ramsey numbers for graphs have been extensively investigated since Ramsey's work in the 1930s, there is still an exponential gap between the best known lower and upper…

Combinatorics · Mathematics 2025-01-03 António Girão , Gal Kronenberg , Alex Scott

We show that for some constant $\beta > 0$, any subset $A$ of integers $\{1,\ldots,N\}$ of size at least $2^{-O((\log N)^\beta)} \cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic…

Number Theory · Mathematics 2024-10-30 Zander Kelley , Raghu Meka

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

Combinatorics · Mathematics 2025-12-09 Guillermo Pineda-Villavicencio , Jie Wang

Let $T$ be a tree with $t$ edges. We show that the number of isomorphic (labeled) copies of $T$ in a graph $G = (V,E)$ of minimum degree at least $t$ is at least \[2|E| \prod_{v \in V} (d(v) - t + 1)^{\frac{(t-1)d(v)}{2|E|}}.\]…

Combinatorics · Mathematics 2015-11-24 Dhruv Mubayi , Jacques Verstraete

The subject matter of this work is the set of integral points(i.e. points with both coordinates integers) on the graphs of rational functions of the form f(x)=(x^2+bx+c)/(x+a), with a,b,c,being integers.Following the introduction, we…

General Mathematics · Mathematics 2013-01-07 Konstantine Zelator

The principal filtration of the infinite-dimensional odd Contact Lie superalgebra over a field of characteristic $p>2$ is proved to be invariant under the automorphism group by investigating ad-nilpotent elements and determining certain…

Rings and Algebras · Mathematics 2018-07-27 Jixia Yuan , Wende Liu

Let K[x,y] be the algebra of two-variable polynomials over a field K. A polynomial p=p(x, y) is called a test polynomial (for automorphisms) if, whenever \phi(p)=p for a mapping \phi of K[x,y], this \phi must be an automorphism. Here we…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Shpilrain , Jie-Tai Yu

Fix integers $d,r\ge 2$ and suppose that the edge set of the $d$-fold Cartesian product of the $N$-clique $K_N^d$ is $r$-colored. We show that there is a copy of $K_n^d$ whose edges in each direction are monochromatic provided $N > 2^{2^{c…

Combinatorics · Mathematics 2025-01-15 Dhruv Mubayi

To solve Nagata's conjecture, Shestakov-Umirbaev constructed a theory for deciding wildness of polynomial automorphisms in three variables. Recently, Kara\'s and others study multidegrees of polynomial automorphisms as an application of…

Commutative Algebra · Mathematics 2013-03-18 Shigeru Kuroda

The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…

Logic · Mathematics 2018-11-06 Rumen Dimitrov , Valentina Harizanov , Andrey Morozov
‹ Prev 1 4 5 6 7 8 10 Next ›