Related papers: New results on quasi-subfield polynomials
The Restricted Assignment Problem is a prominent special case of Scheduling on Parallel Unrelated Machines. For the strongest known linear programming relaxation, the configuration LP, we improve the non-constructive bound on its…
We introduce the quasi-Hopf superalgebras which are $Z_2$ graded versions of Drinfeld's quasi-Hopf algebras. We describe the realization of elliptic quantum supergroups as quasi-triangular quasi-Hopf superalgebras obtained from twisting the…
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…
In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method of strongly sub-feasible directions, a new superlinearly…
The characteristic polynomial plays an important role in study of hyperplane arrangements. There are several refinements of the characteristic polynomial. One of them is the coboundary polynomial defined by Crapo. Another refinement is the…
We describe some recent computer investigations with the `Constraint Logic Programming over Finite Domains' -- CLP(FD) -- library in the Prolog programming environment to search for new simple Lie algebras over the field $\GF(2)$ of $2$…
We present a classical algorithm that, for any 3D geometrically-local, polylogarithmic-depth quantum circuit $C$ acting on $n$ qubits, and any bit string $x\in\{0,1\}^n$, can compute the quantity $|< x |C|0^{\otimes n}>|^2$ to within any…
In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…
We study a class of systems of quasilinear differential inequalities associated to weakly coercive differential operators and power reaction terms. The main model cases are given by the $p$-Laplacian operator as well as the mean curvature…
Our goal in this paper is to extend the theory of quasi-exactly solvable Schrodinger operators beyond the Lie-algebraic class. Let $\cP_n$ be the space of n-th degree polynomials in one variable. We first analyze "exceptional polynomial…
In this paper, we introduce a quasi-Newton method optimized for efficiently solving quasi-linear elliptic equations and systems, with a specific focus on GPU-based computation. By approximating the Jacobian matrix with a combination of…
We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p^n elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the…
The purpose of this paper is to prove some existence and non-existence theorems for the nonlinear elliptic problems of the form -{\Delta}_{p}u={\lambda}k(x)u^{q}\pmh(x)u^{{\sigma}} if x\in{\Omega}, subject to the Dirichlet conditions…
An equivariant characteristic quasi-polynomial is a quasi-polynomial in $q$ consisting of the permutation character on the mod $q$ complement of the corresponding Coxeter arrangement. This concept is a refinement of the conventional…
Quadratically constrained quadratic programs (QCQPs) are an expressive family of optimization problems that occur naturally in many applications. It is often of interest to seek out sparse solutions, where many of the entries of the…
Quasi branch and bound is a recently introduced generalization of branch and bound, where lower bounds are replaced by a relaxed notion of quasi-lower bounds, required to be lower bounds only for sub-cubes containing a minimizer. This paper…
We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP), which is a generalization of the well-studied Hidden…
This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…
In this paper, we establish an improved coefficient bounds for quasiregular and elliptic harmonic mappings and using these bounds we establish Landau-Bloch type theorem for $(K,K')$-elliptic and K-quasiregular harmonic mappings in plane.…
We discuss recent advances in the theory of quasilinear equations of the type $ -\Delta_{p} u = \sigma u^{q} \; \; \text{in} \;\; \mathbb{R}^n, $ in the case $0<q< p-1$, where $\sigma$ is a nonnegative measurable function, or measure, for…