Related papers: Counting solvable $\mathcal S$-unit equations and …
In this paper we study the modulus of continuity of weak solutions to a singular elliptic equation in the plane under very weak assumption on the integrability of the elliptic coefficients. Our investigation reveals that the modulus of…
Using a recent result of C. De Lellis and L. Sz\'{e}kelyhidi Jr. we show that, in the case of periodic boundary conditions and for dimension greater or equal 2, there exist infinitely many global weak solutions to the incompressible Euler…
In this paper, we show that the set of continuous functions defined on $\mathbb{R}^n$ that approach zero at infinity and attain their maximum at precisely one (and only one) point is $n$-lineable but not $(n+2)$-lineable. This result…
We investigate the generalized moment membership problem for matrices, a formulation equivalent to Skolem's problem for linear recurrence sequences. We show decidability for orthogonal, unitary, and real eigenvalue matrices, and…
We obtain a tight, up to a logarithmic factor, upper bound on the number of solutions to the equation $$ \sum_{j=1}^n a_j \frac{s_j}{r_j} =a_0, \qquad $$ with variables $r_1,...,r_n$ in an arbitrary box at the origin and variables $s_1,...,…
A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…
The paper considers computable Folner sequences in computably enumerable amenable groups. We extend some basic results of M. Cavaleri on existence of such sequences to the case of groups where finite generation is not assumed. We also…
A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a…
We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.
We introduce vector bundle techniques for finding equations of secant varieties. A test is established that determines when a secant variety is an irreducible component of the zero set of the equations found. We also prove an induction…
The initial-values problem of the following nonlinear autonomous recursion of order p , z (s + p) = c product of [z (s + l)]^a_l ; with p an arbitrary positive integer, z (s) the dependent variable (possibly a complex number), s the…
Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.
If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…
In this paper we consider a simple linear recurrence sequence $ G_n $ defined over a function field in one variable over the field of complex numbers. We prove an upper bound on the indices $ n $ and $ m $ such that $ G_n + G_m $ is an $ S…
For Latin squares the units (rows and columns) have fixed sum. The same holds for rows, columns, and blocks in Sudokus. Summing the elements of a unit yields a linear equation, and the set of all such equations forms a system of linear…
By introducing a new classification of the growth rate of exponential functions, singular solutions for semilinear elliptic equations in 2-dimensions with exponential nonlinearities are constructed. The strategy is to introduce a model…
We construct two finite groups of size $2^{365}\cdot 3^{105}\cdot 7^{104}$: a solvable group $G$ and a non-solvable group $H$, such that for every integer $n$ the groups have the same number of elements of order $n$. This answers a question…
The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding)…