Related papers: A counterexample to Feit's Problem VIII on decompo…
We study the decomposition of real numbers into sums of L\"uroth sets, which are defined by numbers whose L\"uroth expansions have prescribed digit constraints. We establish several results on the congruence modulo 1 of sums of L\"uroth…
The decomposition problem of the enveloping algebra of a simple Lie algebra is reconsidered combining both the analytical and the algebraic approach, showing its relation with the internal labelling problem with respect to a nilpotent…
Assuming GRH, we prove an explicit upper bound for the number of zeros of a Dedekind zeta function having imaginary part in $[T-a,T+a]$. We also prove a bound for the multiplicity of the zeros.
We exhibit several counterexamples showing that the famous Serrin's symmetry result for semilinear elliptic overdetermined problems may not hold for partially overdetermined problems, that is when both Dirichlet and Neumann boundary…
Lower bounds for some explicit decision problems over the complex numbers are given.
A well-known result of von zur Gathen asserts that a non-exceptional permutation polynomial of degree $n$ over $\mathbb{F}_{q}$ exists only if $q<n^{4}$. With the help of the Weil bound for the number of $\mathbb{F}_{q}$-points on an…
In this short note we give counterexamples to several results related to extension theorems published recently.
Additive deformations of bialgebras in the sense of Wirth are deformations of the multiplication map of the bialgebra fulfilling a compatibility condition with the coalgebra structure and a continuity condition. Two problems concerning…
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…
Some new Frobenius norm bounds of the unique solution to certain structured Sylvester equation are derived. Based on the derived norm upper bounds, new multiplicative perturbation bounds are provided both for subunitary polar factors and…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…
In this paper we obtain bounds for integer solutions of quadratic polynomials in two variables that represent a natural number. Also we get some results on twin prime numbers. In addition, we use linear functionals to prove some results of…
We prove various low-energy decomposition results, showing that we can decompose a finite set $A\subset \mathbb{F}_p$ satisfying $|A|<p^{5/8}$, into $A = S\sqcup T$ so that, for a non-degenerate quadratic $f\in \mathbb{F}_p[x,y]$, we have…
We give an upper bound on the number of extensions of a fixed number field of prescribed degree and discriminant less than X; these bounds improve on work of Schmidt. We also prove various related results, such as lower bounds for the…
By using the intertwiner and face-vertex correpondence relation, we obtain the Bethe ansatz equation of eight vertex model with open boundary condtitions in the framework of algebraic Bethe ansatz method. The open boundary condition under…
In a prime number decomposition of integers in a given set, the occurrence frequencies of prime numbers are shown to satisfy a general forms of Zipf's law.
We present new counterexamples, which provide stronger limitations to sums-differences statements than were previously known. The main idea is to consider non-uniform probability measures.
Motivated by a problem of Halmos, we obtain a canonical decomposition for complex matrices which are unitarily equivalent to their transpose (UET). Surprisingly, the naive assertion that a matrix is UET if and only if it is unitarily…