Related papers: Arithmetic, interpolation and factorization of ama…
The subject of this paper is regularity-preserving aggregation of regular norms on finite-dimensional linear spaces. Regular norms were introduced in [5] and are closely related to ``type 2'' spaces [9, Chapter 9] playing important role in…
The study of interlocking assemblies is an emerging field with applications in various disciplines. However, to this day, the mathematical treatment of these assemblies has been sparse. In this work, we develop a comprehensive mathematical…
This paper contains a review of available methods for establishing improved interpolation inequalities on the sphere for subcritical exponents. Pushing further these techniques we also establish some new results, clarify the range of…
We propose a novel factorization of a non-singular matrix $P$, viewed as a $2\times 2$-blocked matrix. The factorization decomposes $P$ into a product of three matrices that are lower block-unitriangular, upper block-triangular, and lower…
The purpose of this paper is to introduce the class of enriched interpolative Kannan type operators on Banach space that contains the classes of enriched Kannan operators, interpolative Kannan type contraction operators and some other…
We study numerical integration of Lipschitz functionals on a Banach space by means of deterministic and randomized (Monte Carlo) algorithms. This quadrature problem is shown to be closely related to the problem of quantization of the…
In this paper, we introduce a novel quantum algorithm for the factorization of composite odd numbers. This work makes two significant contributions. First, we present a new improvement to the classical Fermat method, fourfold reducing the…
We introduce the notion of common retraction and coretraction for families of Banach spaces, formulate a framework for identifying interpolation spaces, and apply it to modulation spaces with exponential weights $E^s_{p,q}$. By constructing…
Approximate computing is an emerging paradigm where design accuracy can be traded for improvements in design metrics such as design area and power consumption. In this work, we overview our open-source tool, BLASYS, for synthesis of…
This paper aims to generalize and unify classical criteria for comparisons of balanced lattice designs, including fractional factorial designs, supersaturated designs and uniform designs. We present a general majorization framework for…
We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…
Rational-function simplification is key bottlenecks in integration-by-parts (IBP) reduction of Feynman integrals. We study denominator factorization patterns appearing in IBP coefficients and develop practical algorithms for extracting and…
It is well known that many problems in image recovery, signal processing, and machine learning can be modeled as finding zeros of the sum of maximal monotone and Lipschitz continuous monotone operators. Many papers have studied…
Adem and Reichstein introduced the ideal of truncated symmetric polynomials to present the permutation invariant subring in the cohomology of a finite product of projective spaces. Building upon their work, I describe a generating set of…
The density matrix formalism is a fundamental tool in studying various problems in quantum information processing. In the space of density matrices, the most well-known measures are the Hilbert-Schmidt and Bures-Hall ensembles. In this…
This paper introduces a new definition of $\alpha$-monotone operators in real 2-uniformly convex and smooth Banach spaces. Based on this new definition, we establish several novel structural and analytical properties of such operators,…
Theory interpolation has found several successful applications in model checking. We present a novel method for computing interpolants for ground formulas in the theory of equality. The method produces interpolants from colored congruence…
Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…
In this paper, we build up a framework for sparse interpolation. We first investigate the theoretical limit of the number of unisolvent points for sparse interpolation under a general setting and try to answer some basic questions of this…
Block majorization-minimization (BMM) is a simple iterative algorithm for nonconvex optimization that sequentially minimizes a majorizing surrogate of the objective function in each block coordinate while the other block coordinates are…