Related papers: Angle Between Two Vectors over Finite Fields and a…

This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the $q$-analogues of projective systems and blocking sets. We also illustrate how to associate a classical…

Given a closed Riemannian manifold $(M^m,g)$ and a vector field $v$ on $M$, we form the Sasaki metric $g_S$ on $TM$, and restrict it to the image of the cross section map of $M$ into $TM$ defined by $v$, whose pull back to $M$ defines a new…

A set of vectors $S \subseteq \mathbb{R}^d$ is $(k_1,\varepsilon)$-clusterable if there are $k_1$ balls of radius $\varepsilon$ that cover $S$. A set of vectors $S \subseteq \mathbb{R}^d$ is $(k_2,\delta)$-far from being clusterable if…

We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a…

Let ${\mathcal C}(\Omega)$ be the linear code arising from a projective system $\Omega$ of $\mathrm{PG}(V).$ Consider the point-line geometry $\Gamma=({\mathcal P},{\mathcal L})$ and a projective embedding $\varepsilon\colon…

We present a novel error correcting code and decoding algorithm which have construction similar to expander codes. The code is based on a bipartite graph derived from the subsumption relations of finite projective geometry, and Reed-Solomon…

Let $G=(V,E)$ be a simple, connected graph. One is often interested in a short path between two vertices $u,v$. We propose a spectral algorithm: construct the function $\phi:V \rightarrow \mathbb{R}_{\geq 0}$ $$ \phi = \arg\min_{f:V…

For any finite field ${\mathbb F}_q$ with $q$ elements, we study the set ${\mathcal F}_{(q,m)}$ of functions from ${\mathbb F}_q^m$ into ${\mathbb F}^q$. We introduce a transformation that allows us to determine a linear system of $q^{m+1}$…

A linear code over $\mathbb{F}_q$ with the Hamming metric is called $\Delta$-divisible if the weights of all codewords are divisible by $\Delta$. They have been introduced by Harold Ward a few decades ago. Applications include subspace…

Let $(X,\|\cdot\|_X)$ be a Banach space. The purpose of this article is to systematically investigate dimension independent properties of vector valued functions $f:\{-1,1\}^n\to X$ on the Hamming cube whose spectrum is bounded above or…

Vector calculus in three dimensions with a Euclidian metric is the lingua franca of classical physics, including classical electrodynamics. This article corrects some long-standing imprecision in a fundamental result. Some textbooks assert…

We present HashEncoding, a novel autoencoding architecture that leverages a non-parametric multiscale coordinate hash function to facilitate a per-pixel decoder without convolutions. By leveraging the space-folding behaviour of hashing…

Let $H$ be a Hilbert space and $H_1,...,H_n$ be closed subspaces of $H$. Set $H_0:=H_1\cap H_2\cap...\cap H_n$ and let $P_k$ be the orthogonal projection onto $H_k$, $k=0,1,...,n$. The paper is devoted to the study of functions…

In this paper we introduce the concept of minimum-weight edge-discriminators in hypergraphs, and study its various properties. For a hypergraph $\mathcal H=(\mathcal V, \mathcal E)$, a function $\lambda: \mathcal V\rightarrow \mathbb…

The interaction between discrete and continuous mathematics lies at the heart of many fundamental problems in applied mathematics and computational sciences. In this paper we discuss the problem of discretizing vector-valued functions…

Given a Hilbert space $\mathcal H$ and a finite measure space $\Omega$, the approximation of a vector-valued function $f: \Omega \to \mathcal H$ by a $k$-dimensional subspace $\mathcal U \subset \mathcal H$ plays an important role in…

Change in viewpoint is one of the major factors for variation in object appearance across different images. Thus, view-invariant object recognition is a challenging and important image understanding task. In this paper, we propose a method…

Smooth vector fields on $\mathbb{R}^n$ can be decomposed into the sum of a gradient vector field and divergence-free (solenoidal) vector field under suitable hypotheses. This is called the Helmholtz-Hodge decomposition (HHD), which has been…

This work is concerned with the convex analysis of functions defined on (not necessarily finite-dimensional) Hilbert spaces whose values depend solely on a certain ``spectrum'' of the arguments, a class we term ``spectral functions.'' We…

A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to…