English
Related papers

Related papers: Linear equations with unknowns from a multiplicati…

200 papers

For nonnegative real numbers $\alpha$, $\beta$, $\gamma$, $A$, $B$ and $C$ such that $B+C>0$ and $\alpha+\beta+\gamma >0$, the difference equation \begin{equation*} x_{n+1}=\displaystyle\frac{\alpha +\beta x_{n}+\gamma x_{n-1}}{A+B x_{n}+C…

Dynamical Systems · Mathematics 2008-12-18 Sukanya Basu , Orlando Merino

We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1. The least nonnegative solution, say mu, of such equation systems is…

Data Structures and Algorithms · Computer Science 2010-02-03 Javier Esparza , Andreas Gaiser , Stefan Kiefer

For any field k and any integers m,n with 0 <= 2m <= n+1, let W_n be the k-vector space of sequences (x_0,...,x_n), and let H_m be the subset of W_n consisting of the sequences that satisfy a degree-m linear recursion, that is, for which…

Combinatorics · Mathematics 2007-05-23 Noam D. Elkies

Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…

Number Theory · Mathematics 2021-11-23 Attila Pethő

In the first part, in the local non archimedean case, we consider distributions on GL(n+1) which are invariant under the adjoint action of GL(n). We conjecture that such distributions are invariant by transposition. This would imply…

Representation Theory · Mathematics 2007-05-23 Steve Rallis , Gérard Schiffmann

The main point of this paper is to present a class of equations over integers that one can check if they have a solution by checking a set of inequalities. The prototype of such equations is the equations appearing in the well-known…

Combinatorics · Mathematics 2014-06-18 Masood Aryapoor

The number of Monotone Triangles with bottom row k1 < k2 < ... < kn is given by a polynomial alpha(n; k1,...,kn) in n variables. The evaluation of this polynomial at weakly decreasing sequences k1 >= k2 >= ... >= kn turns out to be…

Combinatorics · Mathematics 2011-11-14 Ilse Fischer , Lukas Riegler

In this article, we show a new general linear independence criterion related to values of $G$-functions, including the linear independence of values at algebraic points of contiguous hypergeometric functions, which is not known before. Let…

Number Theory · Mathematics 2022-03-02 Sinnou David , Noriko Hirata-Kohno , Makoto Kawashima

Let $N_a$ be the number of solutions to the equation $x^{2^k+1}+x+a=0$ in $\GF {n}$ where $\gcd(k,n)=1$. In 2004, by Bluher \cite{BLUHER2004} it was known that possible values of $N_a$ are only 0, 1 and 3. In 2008, Helleseth and Kholosha…

Information Theory · Computer Science 2019-03-19 Kwang Ho Kim , Sihem Mesnager

Let $M_n$ be an $n\times n$ signed random combinatorial matrix whose rows are independent and uniformly distributed over the set of $\{-1,0,1\}$-vectors with exactly $n/2$ zero coordinates. Despite the dependence induced by the row…

Probability · Mathematics 2026-04-14 Kexin Yu

Let $n$ be an arbitrary integer, let $p$ be a prime factor of $n$. Denote by $\omega_1$ the $p^{th}$ primitive unity root, $\omega_1:=e^{\frac{2\pi i}{p}}$. Define $\omega_i:=\omega_1^i$ for $0\leq i\leq p-1$ and…

Combinatorics · Mathematics 2016-10-10 Gábor Hegedüs

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…

Group Theory · Mathematics 2013-01-30 Daniela Bubboloni , Cheryl E. Praeger , Pablo Spiga

Each positive increasing integer sequence $\{a_n\}_{n\geq 0}$ can serve as a numeration system to represent each non-negative integer by means of suitable coefficient strings. We analyse the case of $k$-generalized Fibonacci sequences…

Combinatorics · Mathematics 2022-04-22 Elena Barcucci , Antonio Bernini , Renzo Pinzani

Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^{n-k+1} \equiv a \pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient…

Number Theory · Mathematics 2021-03-09 Yongyi Chen , Tae Kyu Kim

A matching from a finite subset $A$ of an abelian group to another subset $B$ is a bijection $f:A\rightarrow B$ with the property that $a+f(a)$ never lies in $A$. A matching is called acyclic if it is uniquely determined by its multiplicity…

Combinatorics · Mathematics 2023-08-30 Mohsen Aliabadi , Khashayar Filom

Let $\{U_n\}_{n \geqslant 0}$ and $\{G_m\}_{m \geqslant 0}$ be two linear recurrence sequences defined over the integers. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as…

Number Theory · Mathematics 2020-06-18 Daodao Yang

Let $n$ be a positive integer. An $n$-cycle of linear mappings is an $n$-tuple $(u_1,\dots,u_n)$ of linear maps $u_1 \in \mathrm{Hom}(U_1,U_2),u_2 \in \mathrm{Hom}(U_2,U_3),\dots,u_n \in \mathrm{Hom}(U_n,U_1)$, where $U_1,\dots,U_n$ are…

Representation Theory · Mathematics 2022-08-10 Clément de Seguins Pazzis

In a joint work with Palmer we have formulated sufficient conditions under which there exist continuous and invertible transformations of the form $H_n(x,y)$ taking solutions of a coupled system \begin{equation*} x_{n+1} =A_nx_n+f_n(x_n,…

Dynamical Systems · Mathematics 2023-02-27 Lucas Backes , Davor Dragičević

Let K be an arbitrary (commutative) field with at least three elements. It was recently proven that an affine subspace of M_n(K) consisting only of non-singular matrices must have a dimension lesser than or equal to n(n-1)/2. Here, we…

Rings and Algebras · Mathematics 2013-02-25 Clément de Seguins Pazzis

Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…

Formal Languages and Automata Theory · Computer Science 2013-10-28 Artur Jeż , Alexander Okhotin