Related papers: Tame automorphisms with multidegrees in the form o…
Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…
We prove, for the form of unitary group in three variables attached to a CM extension which is compact at infinity, a level-raising theorem analogous to the one of Taylor (inv. math. 98, 265-280) in the case of a quaternion algebra. We give…
Let $AP_k=\{a,a+d,\ldots,a+(k-1)d\}$ be an arithmetic progression. For $\epsilon>0$ we call a set $AP_k(\epsilon)=\{x_0,\ldots,x_{k-1}\}$ an $\epsilon$-approximate arithmetic progression if for some $a$ and $d$, $|x_i-(a+id)|<\epsilon d$…
Using $n$ finite order automorphisms on a simple complex Lie algebra we construct twisted $n$-toroidal Lie algebras. Thus obtaining Lie algebras wich have a rootspace decomposition. For the case $n=2$ we list certain simple Lie algebras and…
For each odd integer $k\ge 5$, we prove that, if $M$ is a simple rank-$r$ binary matroid with no odd circuit of length less than $k$ and with $|M| > k 2^{r-k+1}$, then $M$ is isomorphic to a restriction of the rank-$r$ binary affine…
Let $F=(F_1,F_2):C^2 ---> C^2 be a polynomial automorphism. It is well know that deg F_1 | deg F_2 or deg F_2 | deg F_1. On the other hand, if (d_1,d_2) \in (N\{0})^2 is such that d_1 | d_2 or d_2 | d_1, then one can construct a polynomial…
Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…
We give a simpler proof as well as a generalization of the main result of an article of Shestakov and Umirbaev. This latter article being the first of two that solve a long-standing conjecture about the non-tameness, or "wildness", of…
For $k\geq 2$, we derive an asymptotic formula for the number of zeros of the forms $\prod_{i=1}^{k}(x_{2i-1}^2+x_{2i}^2)+\prod_{i=1}^{k}(x_{2k+2i-1}^2+x_{2k+2i}^2)-x_{4k+1}^{2k}$ and…
Let $E$ be a CM number field and $F$ its maximal real subfield. We prove a level-raising result for regular algebraic conjugate self-dual automorphic representations of $GL_n(\mathbb{A}_E)$. This generalizes previously known results of…
Denote by C_{n,d} the nilpotency degree of a relatively free algebra generated by d elements and satisfying the identity x^n=0. Under assumption that the characteristic p of the base field is greater than n/2, it is shown that…
We provide upper bounds for the size of subsets of finite fields lacking the polynomial progression $$ x, x+y, ..., x+(m-1)y, x+y^m, ..., x+y^{m+k-1}.$$ These are the first known upper bounds in the polynomial Szemer\'{e}di theorem for the…
We consider the set of monic real univariate polynomials of a given degree $d$ with non-vanishing coefficients, with given signs of the coefficients and with given quantities $pos$ of their positive and $neg$ of their negative roots (all…
We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…
Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\subset{\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever…
We show that a tilted algebra $A$ is tame if and only if for each generic root $\dd$ of $A$ and each indecomposable irreducible component $C$ of $\module(A,\dd)$, the field of rational invariants $k(C)^{\GL(\dd)}$ is isomorphic to $k$ or…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…
A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…
In this paper, we study a Ramsey-type problem for equations of the form $ax+by=p(z)$. We show that if certain technical assumptions hold, then any 2-colouring of the positive integers admits infinitely many monochromatic solutions to the…
Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…