Related papers: On $p$-adic Gram-Schmidt Orthogonalization Process

In this paper, we draw connections between ideal lattices and multivariate polynomial rings over integers using Gr\"obner bases. Ideal lattices are ideals in the residue class ring, $\mathbb{Z}[x]/\langle f \rangle$ (here $f$ is a monic…

This paper belongs to a series devoted to the study of the cohomology of classifying spaces. Generalizing the Weil algebra of a Lie algebra and Kalkman's BRST model, here we introduce the Weil algebra $W(A)$ associated to any Lie algebroid…

In his 1999 preprint "Universal Lie Algebra", P. Vogel put forward a hypothesis on the existence of a universal Lie algebra. Although this hypothesis remains open, it is known that many quantities in Lie theory admit universal descriptions.…

Within the last fifteen years, a program of establishing relationships between algorithmic randomness and almost-everywhere theorems in analysis and ergodic theory has developed. In harmonic analysis, Franklin, McNicholl, and Rute…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

In the 1970s, Gy\H{o}ri and Lov\'{a}sz showed that for a $k$-connected $n$-vertex graph, a given set of terminal vertices $t_1, \dots, t_k$ and natural numbers $n_1, \dots, n_k$ satisfying $\sum_{i=1}^{k} n_i = n$, a connected vertex…

Approximate proof labeling schemes were introduced by \\Censor-Hillel, Paz and Perry \cite{CPP}. Roughly speaking, a graph property~$\cP$ can be verified by an approximate proof labeling scheme in constant-time if the vertices of a graph…

Goldwasser et al. (2021) recently proposed the setting of PAC verification, where a hypothesis (machine learning model) that purportedly satisfies the agnostic PAC learning objective is verified using an interactive proof. In this paper we…

Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…

We study the problem of releasing the weights of all-pair shortest paths in a weighted undirected graph with differential privacy (DP). In this setting, the underlying graph is fixed and two graphs are neighbors if their edge weights differ…

We consider the problem of minimizing a non-convex function over a smooth manifold $\mathcal{M}$. We propose a novel algorithm, the Orthogonal Directions Constrained Gradient Method (ODCGM) which only requires computing a projection onto a…

Recent successes in producing rigorous approximation algorithms for local Hamiltonian problems such as Quantum Max Cut have exploited connections to unconstrained classical discrete optimization problems. We initiate the study of…

This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…

In this article, we first briefly introduce the history of the Weil-\'etale cohomology theory of arithmetic schemes and review some important results established by Lichtenbaum, Flach and Morin. Next we generalize the Weil-etale cohomology…

Finding the k-medianin a network involves identifying a subset of k vertices that minimize the total distance to all other vertices in a graph. This problem has been extensively studied in computer science, graph theory, operations…

By a global approach, we prove the arithmetic fundamental lemma conjecture for unitary groups in $n$ variables over $\mathbb{Q}_p$ when $p\geq n$.

We show a relation between quantum learning theory and algorithmic hardness. We use the existence of efficient, local learning algorithms for energy estimation -- such as the classical shadows algorithm -- to prove that finding near-ground…

We propose an algorithm for computing bases and dimensions of spaces of invariants of Weil representations of $\mathrm{SL}_2(\mathbb{Z})$ associated to finite quadratic modules. We prove that these spaces are defined over $\mathbb{Z}$, and…

In classical invariant theory, the Gr\"obner base of the ideal of syzygies and the normal forms of polynomials of invariants are two core contents. To improve the performance of invariant theory in symbolic computing of classical geometry,…

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…