English
Related papers

Related papers: On terms in a dynamical divisibility sequence havi…

200 papers

Let A,B be finite dimensional G-graded algebras over an algebraically closed field K with char(K)=0, where G is an abelian group, and let Id_G(A) be the set of graded identities of A (res. Id_G(B)). We show that if A,B are G-simple then…

Rings and Algebras · Mathematics 2012-12-04 Ofir David

We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…

Number Theory · Mathematics 2011-11-24 Lola Thompson

We use the convolution method for arithmetic functions of several variables to deduce an asymptotic formula for the number of $k$-tuples of positive integers with components which are pairwise non-coprime and $\le x$. More generally, we…

Number Theory · Mathematics 2024-12-09 László Tóth

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…

Number Theory · Mathematics 2023-12-05 William Banks , Igor E. Shparlinski

Let G be a connected reductive group defined over a non-archimedean local field of characteristic 0. We assume G is quasi-split, adjoint and absolutly simple. Let g be the Lie algebra of G. We consider the space of the invariant…

Representation Theory · Mathematics 2025-09-15 Jean-Loup Waldspurger

We asymptotically determine the maximum density of subgraphs isomorphic to $H$, where $H$ is any graph containing a dominating vertex, in graphs $G$ on $n$ vertices with bounded maximum degree and bounded clique number. That is, we…

Combinatorics · Mathematics 2025-08-18 Rachel Kirsch

We prove necessary and sufficient conditions for a finite group $G$ with an ordering of $G$-extensions to satisfy the following property: for every positive density set of places $A$ of a number field $K$ and every splitting type given by a…

Number Theory · Mathematics 2023-09-25 Brandon Alberts

Let $F(\boldsymbol x)$ be a homogeneous polynomial in $n \ge 1$ variables of degree $1 \leq d \leq n$ with integer coefficients so that its degree in every variable is equal to $1$. We give some sufficient conditions on $F$ to ensure that…

Number Theory · Mathematics 2020-07-16 Albrecht Boettcher , Lenny Fukshansky

In this paper we prove that for every $s\geq 2$ and every graph $H$ the following holds. Let $G$ be a graph with average degree $\Omega_H(s^{C|H|^2})$, for some absolute constant $C>0$, then $G$ either contains a $K_{s,s}$ or an induced…

Combinatorics · Mathematics 2024-01-18 António Girão , Zach Hunter

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. Suppose the characteristic of $\mathbb{F}_q$ is not $2$ or $3$. In this paper, we prove an $\mathbb{F}_q[t]$-analogue of results…

Number Theory · Mathematics 2015-10-26 Wentang Kuo , Shuntaro Yamagishi

Let $\mathcal{I} \subset \mathbb{N}$ be an infinite subset, and let $\{a_i\}_{i \in \mathcal{I}}$ be a sequence of nonzero real numbers indexed by $\mathcal{I}$ such that there exist positive constants $m, C_1$ for which $|a_i| \leq C_1…

Number Theory · Mathematics 2023-10-03 Evan Chen , Peter S. Park , Ashvin Swaminathan

Let $F_k$ be the set of graphs on $k$ vertices. For a graph $G$, a $k$-decomposition is a set of induced subgraphs of $G$, each isomorphic to an element of $F_k$, such that each pair of vertices of $G$ is in exactly one element of the set.…

Combinatorics · Mathematics 2019-02-05 Raphael Yuster

Let $f(n)$ and $g(n)$ be the number of unordered and ordered factorizations of $n$ into integers larger than one. Let $F(n)$ and $G(n)$ have the additional restriction that the factors are coprime. We establish the asymptotic bounds for the…

Number Theory · Mathematics 2021-02-02 Matthew Just , Noah Lebowitz-Lockard

The density property for a Stein manifold X implies that the group of holomorphic diffeomorphisms of X is infinite-dimensional and, in a certain well-defined sense, as large as possible. We prove that if G is a complex semisimple Lie group…

Complex Variables · Mathematics 2007-05-23 Arpad Toth , Dror Varolin

We study the density of the weights of Generalized Reed--Muller codes. Let $RM_p(r,m)$ denote the code of multivariate polynomials over $\F_p$ in $m$ variables of total degree at most $r$. We consider the case of fixed degree $r$, when we…

Information Theory · Computer Science 2009-04-07 Shachar Lovett

Let P a locally finite partially ordered set, F a field, G a group, and I(P,F) the incidence algebra of P over F. We describe all the inequivalent elementary G-gradings on this algebra. If P is bounded, F is a infinite field of…

Rings and Algebras · Mathematics 2021-02-03 Humberto Luiz Talpo , Waldeck Schützer

For each nonnegative integer $i$, let $a_i$ be the number of $i$-subsets of $V(G)$ that induce an acyclic subgraph of a given graph $G$. We define $A(G,x) = \sum_{i \geq 0} a_i x^i$ (the generating function for $a_i$) to be the acyclic…

Combinatorics · Mathematics 2022-02-07 Caroline Barton , Jason I. Brown , David A. Pike

For integers $k,t \geq 2$ and $1\leq r \leq t$ let $D_k(r,t;n)$ be the number of parts among all $k$-regular partitions (i.e., partitions of $n$ where all parts have multiplicity less than $k$) of $n$ that are congruent to $r$ modulo $t$.…

Combinatorics · Mathematics 2022-07-12 Faye Jackson , Misheel Otgonbayar

Let $K$ be an algebraically closed field of characteristic zero and let $G$ be a finitely generated subgroup of the multiplicative group of $K$. We consider $K$-valued sequences of the form $a_n:=f(\varphi^n(x_0))$, where $\varphi\colon…

Number Theory · Mathematics 2021-11-03 Jason P. Bell , Shaoshi Chen , Ehsaan Hossain

Let $v(F)$ denote the number of vertices in a fixed connected pattern graph $F$. We show an infinite family of patterns $F$ such that the existence of a subgraph isomorphic to $F$ is expressible by a first-order sentence of quantifier depth…

Computational Complexity · Computer Science 2018-02-08 Oleg Verbitsky , Maksim Zhukovskii