相关论文: On the g.c.d. of an infinite number of integers

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…

In this paper we generalize the notion of a $k$-graph into (countable) infinite rank. We then define our $C^*$-algebra in a similar way as in $k$-graph $C^*$-algebras. With this construction we are able to find analogues to the Gauge…

Let $\Gamma$ be an infinite discrete subgroup of Gl$_n(\mathbb{C})$. Then either $(\mathbb{R}, <, +, \cdot, \Gamma)$ is interdefinable with $(\mathbb{R}, <, +, \cdot, \lambda^\mathbb{Z})$ for some $\lambda \in \mathbb{R}$, or $(\mathbb{R},…

We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such…

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

We prove that bounded conciseness is a closed property in the space of marked groups. As a consequence, we reformulate a conjecture of Fern\'andez-Alcober and Shumyatsky [7] about conciseness in the class of residually finite groups.

We consider the algebra of invariants of $d$-tuples of $n\times n$ matrices under the action of the orthogonal group by simultaneous conjugation over an infinite field of characteristic $p$ different from two. It is well-known that this…

We find upper bounds that are sharp for the number of $k$th powers inside arbitrary arithmetic progressions whose step has $O(1)$ many divisors.

We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…

The paper suggests the use of Multi-Valued Decision Diagrams (MDDs) as the supporting data structure for a generic global constraint. We give an algorithm for maintaining generalized arc consistency (GAC) on this constraint that amortizes…

We derive a general upper bound for the number of incidences with $k$-dimensional varieties in ${\mathbb R}^d$. The leading term of this new bound generalizes previous bounds for the special cases of $k=1, k=d-1,$ and $k= d/2$, to every…

For g,n coprime integers, let l_g(n) denote the multiplicative order of g modulo n. Motivated by a conjecture of Arnold, we study the average of l_g(n) as n <= x ranges over integers coprime to g, and x tending to infinity. Assuming the…

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…

Given a graded ideal $I$ in a polynomial ring over a field $K$ it is well known, that the number of distinct generic initial ideals of $I$ is finite. While it is known that for a given $d\in\N$ there is a global upper bound for the number…

We show that the space of harmonic functions on a finitely generated infinite group G is finite dimensional if, and only if, G has a finite-index subgroup isomorphic to the integers. A key tool is Wilkie and van den Dries's quantitative…

We summarize what is currently known about ed$(G)$ and RD$(G)$ for finite groups $G$ over $\mathbb{C}$ (i.e. in characteristic 0). In Appendix A, we also give an argument which improves the known bound on RD(PSL$(2,\mathbb{F}_{11})$).

We show the existence of several infinite monochromatic patterns in the integers obtained as values of suitable symmetric polynomials. The simplest example is the following. For every finite coloring of the natural numbers…

Using the algebraic structure of the Stone-Cech compactification of the integers, Furstenberg and Glasner proved that for arbitrary k, every piecewise syndetic set contains a piecewise syndetic set of k-term arithmetic progressions. We…