Related papers: Linearly Embeddable Designs
One of the most intriguing problems, in $q$-analogs of designs, is the existence question of an infinite family of $q$-analog of Steiner systems, known also as $q$-Steiner systems, (spreads not included) in general, and the existence…
Incompressibility is established for three-dimensional and two-dimensional deformations of an anisotropic linearly elastic material, as conditions to be satisfied by the elastic compliances. These conditions make it straightforward to…
In the present work, we demonstrate how the pseudoinverse concept from linear algebra can be used to represent and analyze the boundary conditions of linear systems of partial differential equations. This approach has theoretical and…
Let $A$ be abelian variety over the function field $K$ of a compact Riemann surface $B$. Fix a model $f \colon \mathcal{A} \to B$ of $A/K$ and a certain effective horizontal divisor $\DD \subset \mathcal{A}$. We give a sufficient condition…
We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding that the drawing has to respect and if it does not. Our algorithm returns a planar…
We classify affine varieties with an action of a connected, reductive algebraic group such that the group is isomorphic to an open orbit in the variety. This is accomplished by associating a set of one-parameter subgroups of the group to…
We show that an abelian surface embedded in P^N by a very ample line bundle L of type (1,2d) is projectively normal if and only if d>=4. This completes the study of the projective normality of abelian surfaces embedded by complete linear…
A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the "help-by-transfer" property where…
A group code structure of a linear code is a description of the code as one-sided or two-sided ideal of a group algebra of a finite group. In these realizations, the group algebra is identified with the ambient space, and the group elements…
We deal with first-order definability in the embeddability ordering $( \mathcal{D}; \leq)$ of finite directed graphs. A directed graph $G\in \mathcal{D}$ is said to be embeddable into $G' \in \mathcal{D}$ if there exists an injective graph…
We determine those maps between affine or projective spaces that are linear in the abstract sense of transforming collinear points into collinear points and whose restriction to any line is constant or injective. Our results are extensions…
In materials science, the challenge of rapid prototyping materials with desired properties often involves extensive experimentation to find suitable microstructures. Additionally, finding microstructures for given properties is typically an…
We consider the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. First a number of foundational results on…
Yudin's lower bound for the spherical designs is generalized to the cubature formulas on the projective spaces over a field K, where K can be R, C, or H (the field of quaternions), and thus to isometric embeddings of l_2 into l_p with p an…
We introduce order conserving embeddings as a more general form of order preserving embeddings between finite dimensional nest algebras. The structure of these embeddings is determined, in terms of order indecomposable decompositions, and…
Given two independent point processes and a certain rule for matching points between them, what is the fraction of matched points over infinitely long streams? In many application contexts, e.g., secure networking, a meaningful matching…
Balanced incomplete block designs (BIBDs) are a class of designs with v treatments and b blocks of size k that are optimal with regards to a wide range of optimality criteria, but it is not clear which designs to choose for combinations of…
Linear regression models are checked by a lack-of-fit (LOF) test to be sure that the model is at least approximatively true. In many practical cases data are sampled sequentially. Such a situation appears in industrial production when goods…
The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability problem, however, often becomes undecidable for a slight…
Let $p$ be a prime number and $\Bbbk=\bar{\mathbb{F}}_p$, the algebraic closure of the finite field $\mathbb{F}_p$ of $p$ elements. Let ${\bf G}$ be a connected reductive group defined over $\mathbb{F}_p$ and ${\bf B}$ be a Borel subgroup…