Related papers: On $p$-adic Gram-Schmidt Orthogonalization Process
The approximate joint diagonalization of a set of matrices consists in finding a basis in which these matrices are as diagonal as possible. This problem naturally appears in several statistical learning tasks such as blind signal…
A new way of orthogonalizing ensembles of vectors by "lifting" them to higher dimensions is introduced. This method can potentially be utilized for solving quantum decision and computing problems.
Complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we study such lattices and their reduction algorithms. Firstly, when the lattice is spanned over a two…
In this paper we deal with a best approximation of a vector with respect to a closed semi-algebraic set $C$ in the space $\mathbb{R}^n$ endowed with a semi-algebraic norm $\nu$. Under additional assumptions on $\nu$ we prove…
The paper is a survey of some results about Weil algebras applicable in differential geometry, especially in some classification questions on bundles of generalized velocities and contact elements. Mainly, a number of claims concerning a…
In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gr\"obner bases in reduction rings. We describe how the algorithm can be…
The proximal point algorithm (PPA) has been developed to solve the monotone variational inequality problem. It provides a theoretical foundation for some methods, such as the augmented Lagrangian method (ALM) and the alternating direction…
Let E be a Dedekind complete Riesz space with weak unit e, equipped with a conditional expectation operator T. We prove that the spaces Lp(T), with their natural vector-valued norms, are strongly complete, extending the p=2 case of Kuo,…
Variational quantum algorithms involve training parameterized quantum circuits using a classical co-processor. An important variational algorithm, designed for combinatorial optimization, is the quantum approximate optimization algorithm.…
We use recent results about linking the number of zeros on algebraic varieties over $\mathbb{C}$, defined by polynomials with integer coefficients, and on their reductions modulo sufficiently large primes to study congruences with products…
The embedding theorem arises in several problems from analysis and geometry. The purpose of this paper is to provide a deeper understanding of analysis and geometry with a particular focus on embedding theorems on spaces of homogeneous type…
The emergence of massive graph data sets requires fast mining algorithms. Centrality measures to identify important vertices belong to the most popular analysis methods in graph mining. A measure that is gaining attention is forest…
In this paper we discuss a general notion of Weil cohomology theories, both in algebraic geometry and in rigid analytic geometry. We allow our Weil cohomology theories to have coefficients in arbitrary commutative ring spectra. Using the…
The problem of finding short vectors in Euclidean lattices is a central hard problem in complexity theory. The case of module lattices (i.e., lattices which are also modules over a number ring) is of particular interest for cryptography and…
In this paper we provide an approximation \`a la Ambrosio-Tortorelli of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two. We introduce…
This article presets a review of lattice problems. Paper contains the main eighteen problems with their reductions and referents to his cryptography application. As an example of reduction, we detail analyze connection between SVP and CVP.…
In this paper we study subsequences of random numbers. In Kamae (1973), selection functions that depend only on coordinates are studied, and their necessary and sufficient condition for the selected sequences to be normal numbers is given.…
We give a deterministic O(log n)^n algorithm for the {\em Shortest Vector Problem (SVP)} of a lattice under {\em any} norm, improving on the previous best deterministic bound of n^O(n) for general norms and nearly matching the bound of…
At the end of the twentieth century, J.-B. Bost developped a slope theory of hermitian vector bundles over number fields. A new method of diophantine approximation, the so-called slope method, has emerged from his research. Our article…
In this paper, we show that the classical discrete orthogonal univariate polynomials (namely, Hahn polynomials on an equidistant lattice with unit weights) of sufficiently high degrees have extremely small values near the endpoints (we call…