Related papers: On $p$-adic Gram-Schmidt Orthogonalization Process
Lattice-based cryptography is one of the leading proposals for post-quantum cryptography. The Shortest Vector Problem (SVP) is arguably the most important problem for the cryptanalysis of lattice-based cryptography, and many lattice-based…
We introduce $\varepsilon$-approximate versions of the notion of Euclidean vector bundle for $\varepsilon \geq 0$, which recover the classical notion of Euclidean vector bundle when $\varepsilon = 0$. In particular, we study \v{C}ech…
The purpose of this article is to define and study new invariants of topological spaces: the $p$-adic Betti numbers and the $p$-adic torsion. These invariants take values in the $p$-adic numbers and are constructed from a virtual pro-$p$…
For a polygon P with n vertices, the vertex guarding problem asks for the minimum subset G of P's vertices such that every point in P is seen by at least one point in G. This problem is NP-complete and APX-hard. The first approximation…
We introduce the notion of orthogonality in a vector space with a topology on it. To serve our purpose, we define orthogonality space for a given vector space X, using the topology on it. We show that for a suitable choice of orthogonality…
Lie symmetry transformations that leave a differential equation invariant play a fundamental role in science and mathematics. Such Lie symmetry groups uniquely determine their Lie symmetry algebras. Exact differential elimination algorithms…
This paper addresses the problem of finding a B-term wavelet representation of a given discrete function $f \in \real^n$ whose distance from f is minimized. The problem is well understood when we seek to minimize the Euclidean distance…
In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…
This work develops algorithms for non-parametric confidence regions for samples from a univariate distribution whose support is a discrete mesh bounded on the left. We generalize the theory of Learned-Miller to preorders over the sample…
The Gr\"obner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if "yes" find- a term order such that the set of polynomials is a Gr\"obner basis. This problem was shown to be NP-hard…
In this paper, we present a deterministic algorithm for the closest vector problem for all l_p-norms, 1 < p < \infty, and all polyhedral norms, especially for the l_1-norm and the l_{\infty}-norm. We achieve our results by introducing a new…
Discretizing Helmholtz problems via finite elements yields linear systems whose efficient solution remains a major challenge for classical computation. In this paper, we investigate how variational quantum algorithms could address this…
Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…
We define Weil spaces, Weil manifolds, Weil varieties and Weil Lie groups over an arbitrary commutative base ring K (in particular, over discrete rings such as the integers), and we develop the basic theory of such spaces, leading up the…
In this paper we address the problem of finding well approximating lattices for a given finite set $A$ of points in ${\mathbb R}^n$. More precisely, we search for $\v{o},\v{d_1}, \dots,\v{d_n}\in \mathbb{R}^n$ such that $\v{a}-\v{o}$ is…
The Chordal Vertex Deletion (ChVD) problem asks to delete a minimum number of vertices from an input graph to obtain a chordal graph. In this paper we develop a polynomial kernel for ChVD under the parameterization by the solution size, as…
This work aims to numerically construct exactly commuting matrices close to given almost commuting ones, which is equivalent to the joint approximate diagonalization problem. We first prove that almost commuting matrices generically have…
In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main…
We study the complexity of lattice problems in a world where algorithms, reductions, and protocols can run in superpolynomial time, revisiting four foundational results: two worst-case to average-case reductions and two protocols. We also…
We prove that the Gram--Schmidt orthogonalization process can be carried out in Hilbert modules over Clifford algebras, in spite of the un-invertibility and the un-commutativity of general Clifford numbers. Then we give two crucial…