English
Related papers

Related papers: Linear equations with unknowns from a multiplicati…

200 papers

Let $C_{n}$ be a cycle of length $n$. As an application of Szemer\'{e}di's regularity lemma, {\L}uczak ($R(C_n,C_n,C_n)\leq (4+o(1))n$, J. Combin. Theory Ser. B, 75 (1999), 174--187) in fact established that…

Combinatorics · Mathematics 2018-09-21 Meng Liu , Yusheng Li , Qizhong Lin , Chunlin You

Let $K$ be a perfect field, $L$ be an extension field of $K$ and $A,B\in\mathcal{M}_n(K)$. If $A$ has $n$ distinct eigenvalues in $L$ that are explicitly known, then we can check if $A,B$ are simultaneously triangularizable over $L$. Now we…

Rings and Algebras · Mathematics 2012-11-01 Gerald Bourgeois

When studying the least common multiple of some finite sequences of integers, the first author introduced the interesting arithmetic functions $g_k$ $(k \in \mathbb{N})$, defined by $g_k(n) := \frac{n (n + 1) ... (n + k)}{\lcm(n, n + 1,…

Number Theory · Mathematics 2008-08-12 Bakir Farhi , Daniel Kane

An $n$-poised node set $\mathcal X$ in the plane is called $GC_n$ set if the (bivariate) fundamental polynomial of each node is a product of n linear factors. A line is called $k$-node line if it passes through exactly $k$-nodes of…

Combinatorics · Mathematics 2018-01-23 Hakop Hakopian , Vahagn Vardanyan

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

Number Theory · Mathematics 2025-03-07 Alina Ostafe , Carl Pomerance , Igor E. Shparlinski

In this paper, the connections between model theory and the theory of infinite permutation groups are used to study the n-existence and the n-uniqueness for n-amalgamation problems of stable theories. We show that, for any n>1, there exists…

Logic · Mathematics 2010-07-06 Elisabetta Pastori , Pablo Spiga

For $n$ positive numbers ($a_k$, $1\leq k \leq n$), enhanced inequalities about the arithmetic mean ($A_n \equiv \frac{\sum_ka_k}{n}$) and the geometric mean ($G_n\equiv \sqrt[n]{\Pi_ka_k}$) are found if some numbers are known, namely,…

General Mathematics · Mathematics 2020-08-11 Fang Dai , Li-Gang Xia

Let ${\mathbf{F}}_q$ be the finite field with $q=p^m$ elements and $G$ be a subgroup of ${\rm{GL}}_n({\mathbf{F}}_q)$. A famous theorem of Nori published in 1987 states that there exists a (non-effective) constant $c(n)$, depending only on…

Number Theory · Mathematics 2023-04-18 Davide Lombardo , Laura Paladino

The paper deals with a problem of Additive Combinatorics. Let ${\mathbf G}$ be a finite abelian group of order $N$. We prove that the number of subset triples $A,B,C\subset {\mathbf G}$ such that for any $x\in A$, $y\in B$ and $z\in C$ one…

Number Theory · Mathematics 2020-12-29 Aliaksei Semchankau , Dmitry Shabanov , Ilya Shkredov

Let $G$ be a group, $m\geq2$ and $n\geq1$. We say that $G$ is an $\mathcal{T}(m,n)$-group if for every $m$ subsets $X_1, X_2, \dots, X_m$ of $G$ of cardinality $n$, there exists $i\neq j$ and $x_i \in X_i, x_j \in X_j$ such that…

Group Theory · Mathematics 2018-01-03 A. Ahmadkhah , S. Marzang , M. Zarrin

For a fixed unit vector $a=(a_1,a_2,\ldots,a_n)\in S^{n-1}$, we consider the $2^n$ sign vectors $\varepsilon=(\varepsilon^1,\varepsilon^2,\ldots,\varepsilon^n)\in \{+1,-1\}^n$ and the corresponding scalar products $\varepsilon\cdot…

Combinatorics · Mathematics 2017-03-22 Harrie Hendriks , Martien C. A. van Zuijlen

Given a positive integer $ r $, the $ r $-color size-Ramsey number of a graph $ H $, denoted by $ \hat{R}(H, r) $, is the smallest integer $ m $ for which there exists a graph $ G $ with $ m $ edges such that, in any edge coloring of $ G $…

Combinatorics · Mathematics 2021-07-01 Ramin Javadi , Meysam Miralaei

Let $(m, n, k)$ be a tuple of integers with the property that if $i \leq k$, then $m + i$ and $n + i$ have the same radical. Using a result on the abc Conjecture, we bound $k$ from above, improving a result of Balasubramanian, Shorey, and…

Number Theory · Mathematics 2025-07-15 Noah Lebowitz-Lockard

An element $x$ of a group $G$ is a commutator if it can be expressed in the form $x = a^{-1}b^{-1}ab$ for some $a, b \in G$. In 2010 MacHale posed the following problem in the Kourovka notebook: does there exist a finite group $G$, with…

Group Theory · Mathematics 2025-09-23 Saveliy V. Skresanov

Let G be a finite additive abelian group with exponent exp(G)=n>1 and let A be a nonempty subset of {1,...,n-1}. In this paper, we investigate the smallest positive integer $m$, denoted by s_A(G), such that any sequence {c_i}_{i=1}^m with…

Combinatorics · Mathematics 2011-12-02 Sukumar Das Adhikari , David J. Grynkiewicz , Zhi-Wei Sun

Let $f(n)$ be the smallest number such that every collection of $n$ matchings, each of size at least $f(n)$, in a bipartite graph, has a full rainbow matching. Generalizing famous conjectures of Ryser, Brualdi and Stein, Aharoni and Berger…

Combinatorics · Mathematics 2017-02-24 Ron Aharoni , Dani Kotlar , Ran Ziv

Assume $\mathcal{C}$ is the class of all linear orders $L$ such that $L$ is not a countable union of well ordered sets, and every uncountable subset of $L$ contains a copy of $\omega_1$. We show it is consistent that $\mathcal{C}$ has…

Logic · Mathematics 2020-10-29 Hossein Lamei Ramandi

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several interesting identities involving this sequence such as $F_n^2+F_{n+1}^2=F_{2n+1}$, for all $n\geq…

Number Theory · Mathematics 2023-09-18 Ana Paula Chaves , Carlos Gustavo Moreira , Eduardo Henrique no Nascimento

In 1955 Dye proved that two von Neumann factors not of type I_2n are isomorphic (via a linear or a conjugate linear *-isomorphism) if and only if their unitary groups are isomorphic as abstract groups. We consider an analogue for…

Operator Algebras · Mathematics 2016-08-26 Thierry Giordano , Adam Sierakowski

We prove that many sequences of positive numbers $(a_n)$ defined by finite linear difference equations $a_{n+k}=c_{k-1}a_{n+k-1}+...+c_0a_n$ with suitable non negative reals coefficients $c_i$ satisfy Bendford's Law on the first digit in…

Dynamical Systems · Mathematics 2010-08-18 Hugues Deligny , Paul Jolissaint