Related papers: Linearly Embeddable Designs
In this work, we consider adaptive linear programming (ALP) decoding of linear codes over the finite field $\mathbb{F}_p$ of size $p$ where $p$ is a prime. In particular, we provide a general construction of valid inequalities for the…
In this paper, we classify the finite dimensional irreducible modules for affine BMW algebra over an algebraically closed field with arbitrary characteristic.
The Stable Reduction Theorem guarantees that any smooth, projective, geometrically irreducible curve of genus $g \geq 2$ over a discretely valued field admits a unique stable model after a finite field extension. Computing this model is a…
Latent class models have wide applications in social and biological sciences. In many applications, pre-specified restrictions are imposed on the parameter space of latent class models, through a design matrix, to reflect practitioners'…
In this paper we introduce a class of constraint logic programs such that their termination can be proved by using affine level mappings. We show that membership to this class is decidable in polynomial time.
A foundational question in the theory of linear compartmental models is how to assess whether a model is structurally identifiable -- that is, whether parameter values can be inferred from noiseless data -- directly from the combinatorics…
Log-linear models are typically fitted to contingency table data to describe and identify the relationship between different categorical variables. However, the data may include observed zero cell entries. The presence of zero cell entries…
Let $Z$ be an affine algebraic variety and $X$ be a smooth flexible variety. We develop some criteria under which $Z$ admits a closed embedding into $X$. In particular, we show that if $X$ is isomorphic (as an algebraic variety) to a…
Linear hypersurfaces over a field $k$ have been playing a central role in the study of some of the challenging problems on affine spaces. Breakthroughs on such problems have occurred by examining two difficult questions on linear…
We investigate block designs, under the A- and MV-criteria, when each treatment can have only one or two replications due to resource constraints, as can happen, for example, in early generation varietal trials. While these are commonly…
Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…
A supersaturated design is a design whose run size is not large enough for estimating all the main effects. The goodness of multi-level supersaturated designs can be judged by the generalized minimum aberration criterion proposed by Xu and…
Let $F$ be a non-archimedean local field of residual characteristic $p>3$ and residue degree $f>1$. We study a certain type of diagram, called \emph{cyclic diagrams}, and use them to show that the universal supersingular modules of…
Many graph coloring proofs proceed by showing that a minimal counterexample to the theorem being proved cannot contain certain configurations, and then showing that each graph under consideration contains at least one such configuration;…
A well-known classical result states that $c_0$ is linearly embeddable in a Banach lattice if and only if it is lattice embeddable. Improving results of H.P.~Lotz, H.P.~Rosenthal and N.~Ghoussoub, we prove that $C[0,1]$ shares this property…
Linear complementarity problems are a powerful tool for modeling many practically relevant situations such as market equilibria. They also connect many sub-areas of mathematics like game theory, optimization, and matrix theory. Despite…
Solving large-scale optimization on-the-fly is often a difficult task for real-time computer graphics applications. To tackle this challenge, model reduction is a well-adopted technique. Despite its usefulness, model reduction often…
For any finite group $G$ and any prime $p$ one can ask which ordinary irreducible representations remain irreducible in characteristic $p$. We answer this question for $p=2$ when $G$ is a proper double cover of the symmetric group. Our…
Let $\mathbf{k}$ be an algebraically closed field, let $\Lambda$ be a finite dimensional $\mathbf{k}$-algebra, and let $\widehat{\Lambda}$ be the repetitive algebra of $\Lambda$. For the stable category of finitely generated left…
We call a system super-linearizable if it admits finite-dimensional embedding as a linear system -- known as a finite-dimensional Koopman embedding; said otherwise, if its dynamics can be linearized by adding a finite set of observables. We…