arXiv research

Paper solves NGCA for discrete distributions using LLL method.

Polynomial-time algorithm for inferring high-dimensional linear regression from a single sample.

The asymptotic lattices and their transformations are studied within the line geometry approach. It is shown that the discrete asymptotic nets are represented by isotropic congruences in the Plucker quadric. On the basis of the Lelieuvre-type representation of asymptotic lattices and of the discrete analog of the Mouta…

SLR tackles sparse linear regression problems, showing hardness for efficient algorithms.

We consider a high dimensional linear regression problem where the goal is to efficiently recover an unknown vector $β^*$ from $n$ noisy linear observations $Y=Xβ^*+W \in \mathbb{R}^n$, for known $X \in \mathbb{R}^{n \times p}$ and unknown $W \in \mathbb{R}^n$. Unlike most of the literature on this model we make no spa…

Reduces learning periodic neural networks to lattice problems, proving hardness under cryptographic assumptions.

Polynomial-time algorithm finds planted hypercube vectors in Gaussian mixtures.

The paper constructs a star product on a symplectically reduced phase space for a lattice gauge model.

In this paper we prove that every H-type Lie algebra possesses a basis with respect to which the structure constants are integers. Existence of such an integral basis implies via the Mal'cev criterion that all simply connected H-type Lie groups contain cocompact lattices. Since the Campbell-Hausdorff formula is very si…

This article considers algorithmic and statistical aspects of linear regression when the correspondence between the covariates and the responses is unknown. First, a fully polynomial-time approximation scheme is given for the natural least squares optimization problem in any constant dimension. Next, in an average-case…

The lattice cohomology of a plumbed 3--manifold $M$ associated with a connected negative definite plumbing graph is an important tool in the study of topological properties of $M$, and in the comparison of the topological properties with analytic ones when $M$ is realized as complex analytic singularity link. By defini…

Kronecker trend filtering improves lattice data smoothing.

The B-quadrilateral lattice (BQL) provides geometric interpretation of Miwa's discrete BKP equation within the quadrialteral lattice (QL) theory. After discussing the projective-geometric properties of the lattice we give the algebro-geometric construction of the BQL ephasizing the role of Prym varieties and the corres…

We introduce the Koenigs lattice, which is a new integrable reduction of the quadrilateral lattice (discrete conjugate net) and provides natural integrable discrete analogue of the Koenigs net. We construct the Darboux-type transformations of the Koenigs lattice and we show permutability of superpositions of such trans…

Let G be a lattice in PSL(2,C). The pro-normal topology on G is defined by taking all cosets of non-trivial normal subgroups as a basis. This topology is finer than the pro-finite topology, but it is not discrete. We prove that every finitely generated subgroup H<G is closed in the pro-normal topology. As a corollary w…

Group lattices (Cayley digraphs) of a discrete group are in natural correspondence with differential calculi on the group. On such a differential calculus geometric structures can be introduced following general recipes of noncommutative differential geometry. Despite of the non-commutativity between functions and (gen…

In this paper we investigate flows on discrete curves in $\C^2$, $\CP^1$, and $\C$. A novel interpretation of the one dimensional Toda lattice hierarchy and reductions thereof as flows on discrete curves will be given.

In the framework of geometric quantization we extend the Bohr-Sommerfeld rules to a full quantization theory which resembles Heisenberg's matrix theory. This extension is possible because Bohr-Sommerfeld rules not only provide an orthogonal basis in the space of quantum states, but also give a lattice structure to this…

Introduces a continuous version of LWE problem.

Paper improves distributed mean estimation and variance reduction without relying on input norm.

Quantum codes on hyperbolic lattices outperform Euclidean ones with higher rates and lower overhead.

The main aim of this paper is the description of a large class of lattices in some nilpotent Lie groups, sometimes filiformes, carrying a flat left invariant linear connection anf often a left invariant symplectic form. As a consequence we obtain an infinity of, non homeomorphic, compact affine or symplectic manifolds.…

The paper introduces a method to decorrelate circular coordinates using lattice reduction.

Let $G$ be a connected reductive affine algebraic group defined over $\mathbb C$, and let $Γ$ be a cocompact lattice in $G$. We prove that any invariant bundle on $G/Γ$ is semistable.

In this paper we study the tensor powers of the standard representation of the quantum super-algebra $U_q(sl(2|1)$, focusing on the rings of its algebra endomorphisms, called centraliser algebras and denoted by $LG_n$. Their dimensions were conjectured by I. Marin and E. Wagner \cite{MW}. We prove this conjecture, desc…

Classifies actions of tori on manifolds up to diffeomorphisms.

We study representations of lattices of PU(m,1) into PU(n,1). We show that if a representation is reductive and if m is at least 2, then there exists a finite energy harmonic equivariant map from complex hyperbolic m-space to complex hyperbolic n-space. This allows us to give a differential geometric proof of rigidity …

We present a family of complete acyclic Morse matchings on the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. In a future paper we will utilize these matchings to classify every subcomplex whose reduced homology groups are concentra…

We determine when an arithmetic subgroup of a reductive group defined over a global function field is of type FP_\infty by comparing its large-scale geometry to the large-scale geometry of lattices in real semisimple Lie groups.

Dimension reduction of multivariate data supervised by auxiliary information is considered. A series of basis for dimension reduction is obtained as minimizers of a novel criterion. The proposed method is akin to continuum regression, and the resulting basis is called continuum directions. With a presence of binary sup…

Adaptive neural networks learn functional data bases for improved performance.

Improves MARS for nonparametric multivariate regression with dimension reduction.

Paper develops a two-population model to assess longevity basis risk.

American put options are among the most frequently traded single stock options, and their calibration is computationally challenging since no closed-form expression is available. Due to the higher flexibility in comparison to European options, the mathematical model involves additional constraints, and a variational in…

Clock theorem extended to knotoids and linkoids.

This work ensures stability in POD basis interpolation for pMOR in hyperelasticity.

In hep-th/9805025, a result for the symmetric 3-loop massive tetrahedron in 3 dimensions was found, using the lattice algorithm PSLQ. Here we give a more general formula, involving 3 distinct masses. A proof is devised, though it cannot be accounted as a derivation; rather it certifies that an Ansatz found by PSLQ sati…

The paper explores polysymplectic structures and their reductions in field theories.

We propose a data-driven approach to solve multiscale elliptic PDEs with random coefficients based on the intrinsic low dimension structure of the underlying elliptic differential operators. Our method consists of offline and online stages. At the offline stage, a low dimension space and its basis are extracted from th…

Geometrically represents path integral reduction Jacobian for interacting systems.

Lossy compression of statistical data using quantum annealing.

A model order reduction framework reduces financial risk analysis models efficiently.

New basis for quantum gl_N invariants derived from Macdonald polynomials.

BasisVAE combines VAE and clustering for tabular data analysis.

We consider the multi-bump solutions of the following fractional Nirenberg problem \begin{equation}\label{01} (-Δ)^s u=K(x)u^{\frac{n+2s}{n-2s}}, \;\;\;\;u>0\;\;\text{ in }\mathbb{R}^n, \end{equation} where $s\in (0,1)$ and $n>2+2s$. If $K$ is a periodic function in some $k$ variables with $1\leq k<\frac{n-2s}2$, we pr…

Nonlinear dimensionality reduction embeddings computed from datasets do not provide a mechanism to compute the inverse map. In this paper, we address the problem of computing a stable inverse map to such a general bi-Lipschitz map. Our approach relies on radial basis functions (RBFs) to interpolate the inverse map ever…

Study shows nontrivial intersections of subgroups on homogeneous spaces.

Option discovery and skill acquisition frameworks are integral to the functioning of a Hierarchically organized Reinforcement learning agent. However, such techniques often yield a large number of options or skills, which can potentially be represented succinctly by filtering out any redundant information. Such a reduc…