Related papers: Linear estimates for solutions of quadratic equati…
We provide an algorithm which, for a given quadratic equation in the Grigorchuk group determines if it has a solution. As a corollary to our approach, we prove that the group has a finite commutator width.
In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…
We show that if $G$ is a gap-free and diamond-free graph, then $I(G)^s$ has a linear minimal free resolution for every $s\geq 2$.
Define a natural number $n$ as a \textit{square-full} integer if for every prime $p$ such that $p|n$, we have $p^2|n$. In this paper, we establish an upper bound on the variance of square-full integers in short intervals of an expected…
A Lie-algebraic classification of the variable coefficient cubic-quintic nonlinear Schr\"odinger equations involving 5 arbitrary functions of space and time is performed under the action of equivalence transformations. It is shown that…
For ordinary differential equations in the complex domain, a central problem is to understand, in a given equation or class of equations, those whose solutions do not present multivaluedness. We consider autonomous, first-order, quadratic…
This paper is concerned with the density of rational points of bounded height lying on a variety defined by an integral quadratic form Q. In the case of four variables, we give an estimate that does not depend on the coefficients of Q. For…
Many combinatorial optimisation problems can be modelled as valued constraint satisfaction problems. In this paper, we present a polynomial-time algorithm solving the valued constraint satisfaction problem for a fixed number of variables…
Quadratic Unconstrained Binary Optimization models are useful for solving a diverse range of optimization problems. Constraints can be added by incorporating quadratic penalty terms into the objective, often with the introduction of slack…
We use the Weil bound of multiplicative character sums together with some recent results of N. Boston and R. Jones, to show that the critical orbit of quadratic polynomials over a finite field of $q$ elements is of length $O(q^{3/4})$,…
An abstract indefinite least squares problem with a quadratic constraint is considered. This is a quadratic programming problem with one quadratic equality constraint, where neither the objective nor the constraint are convex functions.…
We show that for any finite-rank free group $\Gamma$, any word-equation in one variable of length $n$ with constants in $\Gamma$ fails to be satisfied by some element of $\Gamma$ of word-length $O(\log (n))$. By a result of the first…
For $S_k$, the space of cusp forms of weight $k$ for the full modular group, we first introduce periods on $S_k$ associated to symmetric square $L$-functions. We then prove that for a fixed natural number $n$, if $k$ is sufficiently large…
We examine the solubility of a diagonal, translation invariant, quadratic equation system in arbitrary (dense) subsets A \subset Z and show quantitative bounds on the size of A if there are no non-trivial solutions. We use the circle method…
We investigate quadrature rules for measures supported on real algebraic and rational curves, focusing on the {odd-degree} case \(2s-1\). Adopting an optimization viewpoint, we minimize suitable penalty functions over the space of…
The stable torsion length in a group is the stable word length with respect to the set of all torsion elements. We show that the stable torsion length vanishes in crystallographic groups. We then give a linear programming algorithm to…
Closed formulae for all Gaussian or optimal, 1-parameter quadrature rules in a compact interval [a, b] with non uniform, asymmetric subintervals, arbitrary number of nodes per subinterval for the spline classes $S_{2N, 0}$ and $S_{2N+1,…
We give an algorithm to compute stable commutator length in free products of cyclic groups which is polynomial time in the length of the input, the number of factors, and the orders of the finite factors. We also describe some experimental…
In this paper, using Euler's function, we give a formula of all integral solutions to linear indeterminate equation with $s$-variables $a_1x_1+a_2x_2+...+a_sx_s=n$. It is a explicit formula of the coefficients $a_1$, $a_2$,..., $a_s$ and…
There are perfect Bieberbach groups of Hirsch length 15, but none in lower dimensions. We shall show that a nonsolvable, torsion free, virtually solvable group $S$ must have Hirsch length $h(S)\geq10$. If $h(S)\leq13$ then we may assume…