Related papers: On The Effective Construction of Asymmetric Chudno…
We study systems of quadratic forms over fields and their isotropy over 2-extensions. We apply this to obtain particular splitting fields for quaternion algebras defined over a finite field extension. As a consequence, we obtain that every…
We prove bilinear inequalities for differential operators in $\mathbb{R}^2$. Such type inequalities turned out to be useful for anisotropic embedding theorems for overdetermined systems and the limiting order summation exponent. However,…
We establish fractional Leibniz rules in weighted settings for nonnegative self-adjoint operators on spaces of homogeneous type. Using a unified method that avoids Fourier transforms, we prove bilinear estimates for spectral multiplier on…
In this paper, we consider a proximal linearized alternating direction method of multipliers (PL-ADMM) for solving linearly constrained nonconvex and possibly nonsmooth optimization problems. The algorithm is generalized by using variable…
This paper presents new fast algorithms for Hermite interpolation and evaluation over finite fields of characteristic two. The algorithms reduce the Hermite problems to instances of the standard multipoint interpolation and evaluation…
The complex method of interpolation, going back to Calder\'on and Coifman et al., on the one hand, and the Alexander-Wermer-Slodkowski theorem on polynomial hulls with convex fibers, on the other hand, are generalized to a method of…
In a recent paper almost sure unisolvence of RBF interpolation at random points with no polynomial addition was proved, for Thin-Plate Splines and Radial Powers with noninteger exponent. The proving technique left unsolved the case of odd…
Primal-dual algorithms are frequently used for iteratively solving large-scale convex optimization problems. The analysis of such algorithms is usually done on a case-by-case basis, and the resulting guaranteed rates of convergence can be…
We extend the "method of multiplicities" to get the following results, of interest in combinatorics and randomness extraction. (A) We show that every Kakeya set (a set of points that contains a line in every direction) in $\F_q^n$ must be…
Iterative Fast Fourier Transform methods are useful for calculating the fields in composite materials and their macroscopic response. By iterating back and forth until convergence, the differential constraints are satisfied in Fourier…
In his work on singularities, expanders and topology of maps, Gromov showed, using isoperimetric inequalities in graded algebras, that every real valued map on the $n$-torus admits a fibre whose homological size is bounded below by some…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
We prove Chernoff style exponential concentration bounds for classical quantum soft covering generalising previous works which gave bounds only in expectation. Our first result is an exponential concentration bound for fully smooth…
With this paper we present an extension of our recent ISSAC paper about computations of Groebner(-Shirshov) bases over free associative algebras Z<X>. We present all the needed proofs in details, add a part on the direct treatment of the…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
This paper is a self-contained presentation of certain aspects of the theory of weighted Sobolev spaces and elliptic operators on non-compact Riemannian manifolds. Specifically, we discuss (i) the standard and weighted Sobolev Embedding…
We introduce a novel primal-dual flow for affine constrained convex optimization problems. As a modification of the standard saddle-point system, our primal-dual flow is proved to possess the exponential decay property, in terms of a…
We analyze a modified version of Nesterov accelerated gradient algorithm, which applies to affine fixed point problems with non self-adjoint matrices, such as the ones appearing in the theory of Markov decision processes with discounted or…
We present a probabilistic algorithm to compute the product of two univariate sparse polynomials over a field with a number of bit operations that is quasi-linear in the size of the input and the output. Our algorithm works for any field of…