Related papers: Linearly Embeddable Designs
We study the degree of irreducible morphisms in any Auslander-Reiten component of a finite dimensional algebra over an algebraically closed field. We give a characterization for an irreducible morphism to have finite left (or right) degree.…
In this paper we derive new sufficient conditions for a linear system matrix $$S(\lambda):=\left[\begin{array}{ccc} T(\lambda) & -U(\lambda) \\ V(\lambda) & W(\lambda) \end{array}\right],$$ where $T(\lambda)$ is assumed regular, to be…
We develop adaptive discretization algorithms for locally optimal experimental design of nonlinear prediction models. With these algorithms, we refine and improve a pertinent state-of-the-art algorithm in various respects. We establish…
The diagonal in a product of projective spaces is cut out by the ideal of 2x2-minors of a matrix of unknowns. The multigraded Hilbert scheme which classifies its degenerations has a unique Borel-fixed ideal. This Hilbert scheme is generally…
This article concerns linear parts of minimal resolutions of finitely generated modules over commutative local, or graded rings. The focus is on the linearity defect of a module, which marks the point after which the linear part of its…
One can embed arbitrarily many disjoint, non-parallel, non-boundary parallel, incompressible surfaces in any three manifold with at least one boundary component of genus two or greater [4]. This paper proves the contrasting, but not…
We classify irreducible unitary representations of the group of all infinite matrices over a $p$-adic field ($p\ne 2$) with integer elements equipped with a natural topology. Any irreducible representation passes through a group $GL$ of…
Suppose a finite group acts on a scheme $X$ and a finite-dimensional Lie algebra $\mathfrak{g}$. The associated equivariant map algebra is the Lie algebra of equivariant regular maps from $X$ to $\mathfrak{g}$. The irreducible…
The main objective of this project is to determine all irreducible modules of a given modular Lie algebra. In contrast to ordinary Lie algebras, modular Lie algebras require an additional structure known as the p-mapping. The minimal…
We prove that every smooth affine variety of dimension $d$ embeds into every simple algebraic group of dimension at least $2d+2$. We do this by establishing the existence of embeddings of smooth affine varieties into the total space of…
Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar…
The isometric embedding of surfaces in three-dimensional space is fundamental to various physical systems, from elastic sheets to programmable materials. While continuous surfaces typically admit unique solutions under suitable boundary…
A plane graph is rectilinear planar if it admits an embedding-preserving straight-line drawing where each edge is either horizontal or vertical. We prove that rectilinear planarity testing can be solved in optimal $O(n)$ time for any plane…
Reversible logic represents the basis for many emerging technologies and has recently been intensively studied. However, most of the Boolean functions of practical interest are irreversible and must be embedded into a reversible function…
Deterministic lateral displacement (DLD) is a high-resolution separation technique used in various fields. A fundamental challenge in DLD is ensuring uniform flow characteristics across channel, particularly near sidewalls where pillar…
This is the second in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…
In this paper, we introduce a new identifiability criteria for linear structural equation models, which we call regression identifiability. We provide necessary and sufficient graphical conditions for a directed edge to be regression…
Given a category of objects, it is both useful and important to know if all the objects in the category may be realised as sub-objects -- via morphisms in the given category -- of a single object in that category enjoying some nice…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
Recently, Transformer-like deep architectures have shown strong performance on tabular data problems. Unlike traditional models, e.g., MLP, these architectures map scalar values of numerical features to high-dimensional embeddings before…