Related papers: Grassmannian codes from paired difference sets
We consider the Grassman manifold $G(E)$ as the subset of all orthogonal projections of a given Euclidean space $E$ and obtain some explicit formulas concerning the differential geometry of $G(E)$ as a submanifold of $L(E,E)$ endowed with…
Terwilliger algebras are a subalgebra of a matrix algebra constructed from an association scheme. In 2010, Tanaka defined what it means for a Terwilliger algebra to be almost commutative and gave five equivalent conditions for a Terwilliger…
We compute the connected four point correlation function (the trispectrum in Fourier space) of cosmological density perturbations at one-loop order in Standard Perturbation Theory (SPT) and the Effective Field Theory of Large Scale…
Motivated by a host of recent applications requiring some amount of redundancy, frames are becoming a standard tool in the signal processing toolbox. In this paper, we study a specific class of frames, known as discrete Fourier transform…
In this paper, we use a unified framework introduced in [3] to study two classes of nonconforming immersed finite element (IFE) spaces with integral value degrees of freedom. The shape functions on interface elements are piecewise…
Effective Field Theory (EFT) provides a powerful framework that exploits a separation of scales in physical systems to perform systematically improvable, model-independent calculations. Particularly interesting are few-body systems with…
Structured prediction tasks in machine learning involve the simultaneous prediction of multiple labels. This is typically done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise elements, each…
We construct a full exceptional collection of vector bundles in the derived category of coherent sheaves on the Grassmannian of isotropic two-dimensional subspaces in a symplectic vector space of dimension $2n$ and in the derived category…
Given an abelian category $\mathcal{A}$ with enough injectives we show that a short exact sequence of chain complexes of objects in $\mathcal{A}$ gives rise to a short exact sequence of Cartan-Eilenberg resolutions. Using this we construct…
The graph invariant EPT-sum has cropped up in several unrelated fields in later years: As an objective function for hierarchical clustering, as a more fine-grained version of the classical edge ranking problem, and, specifically when the…
Keypoint matching can be slow and unreliable in challenging conditions such as repetitive textures or wide-baseline views. In such cases, known geometric relations (e.g., the fundamental matrix) can be used to restrict potential…
The Grassmann angle improves upon similar angles between subspaces that measure volume contraction in orthogonal projections. It works in real or complex spaces, with important differences, and is asymmetric, what makes it more efficient…
Mixture distributions arise in many parametric and non-parametric settings -- for example, in Gaussian mixture models and in non-parametric estimation. It is often necessary to compute the entropy of a mixture, but, in most cases, this…
Finite tight frames for polynomial subspaces are constructed using monic Hahn polynomials and Krawtchouk polynomials of several variables. Based on these polynomial frames, two methods for constructing tight frames for the Euclidean spaces…
In 1995, C.-L. Terng associated to each hyperpolar action on a compact symmetric space, a hyperpolar proper Fredholm (PF) action on a Hilbert space. This is a group action by an infinite dimensional path group and it acts on a Hilbert space…
We consider maps with tight boundaries, i.e. maps whose boundaries have minimal length in their homotopy class, and discuss the properties of their generating functions $T^{(g)}_{\ell_1,\ldots,\ell_n}$ for fixed genus $g$ and prescribed…
We build an infinite dimensional scheme parametrizing isomorphism classes of coherent quotients of a quasi-coherent sheaf on a projective scheme. The main tool to achieve the construction is a version of Grothendieck's Grassmannian…
Using the numerical modular bootstrap, we constrain the space of 1+1d CFTs with a finite non-invertible global symmetry described by a fusion category $\mathcal{C}$. We derive universal and rigorous upper bounds on the lightest…
The Ensemble Kalman Filter (EnKF) is a widely used method for data assimilation in high-dimensional systems, with an ensemble update step equivalent to an empirical version of the Matheron update popular in Gaussian process regression -- a…
An easily computable dimension (or ECD) group code in the group algebra $\mathbb{F}_{q}G$ is an ideal of dimension less than or equal to $p=char(\mathbb{F}_{q})$ that is generated by an idempotent. This paper introduces an easily computable…