Related papers: Linearly Embeddable Designs

An automorphism group of an incidence structure I induces a tactical decomposition on I. It is well known that tactical decompositions of t-designs satisfy certain necessary conditions which can be expressed as equations in terms of the…

Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are over fields with size that grows with the number of servers,…

We study irreducible specializations, in particular when group-preserving specializations may not exist. We obtain a criterion in terms of embedding problems. We include several applications to analogs of Schinzel's hypothesis H and to the…

We study a class of design problems in solid mechanics, leading to a variation on the classical question of equi-dimensional embeddability of Riemannian manifolds. In this general new context, we derive a necessary and sufficient existence…

Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do…

The left regular band structure on a hyperplane arrangement and its representation theory provide an important connection between semigroup theory and algebraic combinatorics. A finite semigroup embeds in a real hyperplane face monoid if…

A powerful and flexible approach to structured prediction consists in embedding the structured objects to be predicted into a feature space of possibly infinite dimension by means of output kernels, and then, solving a regression problem in…

Let $V$ and $V'$ be vector spaces over division rings. Suppose $\dim V$ is finite and not less than 3. Consider a mapping $l:V\to V$ with the following property: for every $u\in {\rm GL}(V)$ there is $u'\in {\rm GL}(V')$ such that $lu=u'l$.…

A locally compact stable plane of positive topological dimension will be called semiaffine if for every line $L$ and every point $p$ not in $L$ there is at most one line passing through $p$ and disjoint from $L$. We show that then the plane…

Any finite set of linear operators on an algebra $A$ yields an operator algebra $B$ and a module structure on A, whose endomorphism ring is isomorphic to a subring $A^B$ of certain invariant elements of $A$. We show that if $A$ is a…

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable, a notion due to Stanley. Jambu and Terao showed that…

We prove a structural theorem that provides a precise local picture of how a sequence of closed embedded minimal hypersurfaces with uniformly bounded index (and volume if the ambient dimension is greater than three) in a Riemannian manifold…

Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…

Let $A$ be a subvariety of affine space $\mathbb{A}^n$ whose irreducible components are $d$-dimensional linear or affine subspaces of $\mathbb{A}^n$. Denote by $D(A)\subset\mathbb{N}^n$ the set of exponents of standard monomials of $A$. We…

A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points satisfying (i) every two blocks intersect each other in $\lambda$ points for a fixed $\lambda < v$ (ii) there…

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable. For X in L(A), it is known that the restriction A^X is…

Identifiability is a desirable property of a statistical model: it implies that the true model parameters may be estimated to any desired precision, given sufficient computational resources and data. We study identifiability in the context…

Every irreducible finite-dimensional representation of the quantized enveloping algebra U_q(gl_n) can be extended to the corresponding quantum affine algebra via the evaluation homomorphism. We give in explicit form the necessary and…

There has been a lot of interest recently in proving lower bounds on the size of linear programs needed to represent a given polytope P. In a breakthrough paper Fiorini et al. [Proceedings of 44th ACM Symposium on Theory of Computing 2012,…