Related papers: Embedding dimension gaps in sparse codes

Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…

The identification of a complete three-dimensional (3D) photonic band gap in real crystals always employs theoretical or numerical models that invoke idealized crystal structures. Thus, this approach is prone to false positives (gap wrongly…

We study codimension $1$ embeddings preserving open book structures. In particular, we prove that every closed orientable 3-manifold admits a codimension-1 spun embedding in a finite connected sum of $S^2 \times S^2$s and $S^2…

Let F be a field. We investigate the greatest possible dimension t_n(F) for a vector space of n-by-n matrices with entries in F and in which every element is triangularizable over the ground field F. It is obvious that t_n(F) is greater…

We show that a generalised sparse grid combination technique which combines multi-variate extrapolation of finite difference solutions with the standard combination formula lifts a second order accurate scheme on regular meshes to a fourth…

A linear code with parameters of the form $[n, k, n-k+1]$ is referred to as an MDS (maximum distance separable) code. A linear code with parameters of the form $[n, k, n-k]$ is said to be almost MDS (i.e., almost maximum distance separable)…

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…

In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended…

We define and study embeddings of cycles in finite affine and projective planes. We show that for all $k$, $3\le k\le q^2$, a $k$-cycle can be embedded in any affine plane of order $q$. We also prove a similar result for finite projective…

Sparse representation has been applied successfully in abnormal event detection, in which the baseline is to learn a dictionary accompanied by sparse codes. While much emphasis is put on discriminative dictionary construction, there are no…

Let $k$ be an algebraically closed field and ${\sf G}(2,k^4)$ the Grassmannian of 2-planes in $k^4$. We associate to each 6-dimensional subspace $R$ of the space of 4x4 matrices over $k$ a closed subscheme ${\bf X}_R \subseteq {\sf…

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

A recent work of Abbasi et al. [FOCS 2023] introduced the notion of $\varepsilon$-scatter dimension of a metric space and showed a general framework for efficient parameterized approximation schemes (so-called EPASes) for a wide range of…

Small codimensional embedded manifolds defined byequations of small degree are Fano and covered by lines. They are complete intersections exactly when the variety of lines through a general point is so and has the right codimension. This…

We give a tight upper bound on the polygonal diameter of the interior, resp. exterior, of a simple $n$-gon, $n \ge 3$, in the plane as a function of $n$, and describe an $n$-gon $(n \ge 3)$ for which both upper bounds (for the interior and…

This paper investigates the theoretical foundations of metric learning, focused on three key questions that are not fully addressed in prior work: 1) we consider learning general low-dimensional (low-rank) metrics as well as sparse metrics;…

A finite set of real numbers is called convex if the differences between consecutive elements form a strictly increasing sequence. We show that, for any pair of convex sets $A, B\subset\mathbb R$, each of size $n^{1/2}$, the convex grid…

This paper is the third in a series where we describe the space of all embedded minimal surfaces of fixed genus in a fixed (but arbitrary) closed 3-manifold. In [CM3]-[CM5] we describe the case where the surfaces are topologically disks on…

The surface code is a two-dimensional topological code with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet…

In the field of node representation learning the task of interpreting latent dimensions has become a prominent, well-studied research topic. The contribution of this work focuses on appraising the interpretability of another…