English
Related papers

Related papers: On some polynomial version on the sum-product prob…

200 papers

Let $h$ be a positive integer and $A, B_1, B_2,\dots, B_h$ be finite sets in a commutative group. We bound $|A+B_1+...+B_h|$ from above in terms of $|A|, |A+B_1|,\dots,|A+B_h|$ and $h$. Extremal examples, which demonstrate that the bound is…

Combinatorics · Mathematics 2017-02-20 Brendan Murphy , Eyvindur Ari Palsson , Giorgis Petridis

The paper is devoted to some applications of Stepanov method. In the first part of the paper we obtain the estimate of the cardinality of the set, which is obtained as an intersection of additive shifts of some different subgroups of F^*_p.…

Number Theory · Mathematics 2015-05-07 Ilya D. Shkredov , Elena V. Solodkova , Ilya V. Vyugin

This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…

Combinatorics · Mathematics 2015-11-20 Sebastiano Ferraris , Alex Mendelson , Gerardo Ballesio , Tom Vercauteren

Let $a=(a_1,\ldots,a_n)$ and $b=(b_1,\ldots,b_n)$ be two $n$-tuples of positive integers, let $X$ be a set of positive integers, and let $g$ be a positive integer. In this work we show an algorithmic process in order to compute all the sets…

Combinatorics · Mathematics 2019-04-10 Aureliano M. Robles-Pérez , José Carlos Rosales

In a graph $G$, a set $D\subseteq V(G)$ is called 2-dominating set if each vertex not in $D$ has at least two neighbors in $D$. The 2-domination number $\gamma_2(G)$ is the minimum cardinality of such a set $D$. We give a method for the…

Combinatorics · Mathematics 2016-12-28 Csilla Bujtás , Szilárd Jaskó

Given a set $X$ of $n\times n$ matrices and a positive integer $m$, we consider the problem of estimating the cardinalities of the product sets $A_1 \dotsc A_m$, where $A_i\in X$. When $X=\mathcal M_n(\mathbb{Z};H)$, the set of $n\times n$…

Number Theory · Mathematics 2024-11-20 Muhammad Afifurrahman

As an extension of the classical irreducibility result of Dumas, a factorization result for polynomials over any valued field with a Krull valuation of arbitrary rank is proved. Further, a lower degree factor bound on factors of a given…

Number Theory · Mathematics 2025-11-27 Rishu Garg , Jitender Singh

We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…

Number Theory · Mathematics 2020-01-01 Vesselin Dimitrov

The `upper rank' of a group is the supremum of the (Pr\"{u}fer) ranks of its finite quotients, and for a prime $p$, the `upper $p$-rank' is the supremum of the sectional $p$-ranks of those quotients. The former is finite if and only if the…

Group Theory · Mathematics 2021-04-27 Dan Segal

We first obtain explicit upper bounds for the proportion of elements in a finite classical group G with a given characteristic polynomial. We use this to complete the proof that the proportion of elements of a finite classical group G which…

Group Theory · Mathematics 2026-03-23 Jason Fulman , Robert Guralnick

In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…

Group Theory · Mathematics 2014-02-26 Silvio Dolfi , Robert Guralnick , Marcel Herzog , Cheryl Praeger

In this paper, we proved that a group $G$ is supersoluble if and only if for any prime $p\in \pi (G)$ there exists a supersoluble subgroup of index $p$.

Group Theory · Mathematics 2019-01-18 V. S. Monakhov , A. A. Trofimuk

For every integer $k$ there exists a bound $B=B(k)$ such that if the characteristic polynomial of $g\in \operatorname{SL}_n(q)$ is the product of $\le k$ pairwise distinct monic irreducible polynomials over $\mathbb{F}_q$, then every…

Representation Theory · Mathematics 2024-09-19 Michael Larsen , Jay Taylor , Pham Tiep

We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.

Group Theory · Mathematics 2011-07-11 Igor Lysenok , Alexei Myasnikov

Let R be a unitary ring of finite cardinality P^k, where p is a prime number and $p\nmid k$. We show that if the group of units of $R$ has at most one subgroup of order $p$, then $R\cong A\bigoplus B,$ where $B$ is a finite ring of order…

Rings and Algebras · Mathematics 2021-05-31 Mostafa Amini , Mohsen Amiri

If E is a locally convex topological vector space, let P(E) be the pre-ordered set of all continuous seminorms on E. We study, on the one hand, for g an infinite cardinal those locally convex spaces E which have the g-neighbourhood property…

Functional Analysis · Mathematics 2012-05-18 Helge Glockner

A remarkable result of Thompson states that a finite group is soluble if and only if its two-generated subgroups are soluble. This result has been generalized in numerous ways, and it is in the core of a wide area of research in the theory…

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

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of $G$, we prove that if $\sigma_1(G)<\frac{117}{20}\,$, then $G$ is…

Group Theory · Mathematics 2024-09-23 Marius Tărnăuceanu

In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must…

Logic in Computer Science · Computer Science 2015-07-01 Andrei A. Bulatov , Daniel Marx

We study the preorder $\le_p$ on the family of subsets of an algebraically closed field of characteristic $0$ defined by letting $A\le_pB $ if there exists a polynomial $P$ such that $A=P^{-1}(B)$.

Commutative Algebra · Mathematics 2023-01-31 Riccardo Camerlo , Carla Massaza
‹ Prev 1 4 5 6 7 8 10 Next ›