Related papers: Linearly Embeddable Designs

We give a necessary and sufficient condition on a $d$-dimensional affine subspace of $\mathbb{R}^n$ to be characterized by a finite set of patterns which are forbidden to appear in its digitization. This can also be stated in terms of local…

Let V be a variety in P^n(C) and let W be a linear space, of dimension w, in P^n. We say that V can be isomorphically projected onto W if there exists a linear projection f, from a suitable linear space L disjoint from W, dim(L) = n-w-1 >=…

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

The determination of an optimal design for a given regression problem is an intricate optimization problem, especially for models with multivariate predictors. Design admissibility and invariance are main tools to reduce the complexity of…

Rank-constrained matrix problems appear frequently across science and engineering. The convergence analysis of iterative algorithms developed for these problems often hinges on local error bounds, which correlate the distance to the…

Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its input. We define a logic whose formulae, called "iterated…

Let F be a non-Archimedean locally compact field of residue characteristic p, let D be a finite dimensional central division F-algebra and let R be an algebraically closed field of characteristic different from p. We classify all smooth…

We formalize and study the natural approach of designing convex surrogate loss functions via embeddings, for problems such as classification, ranking, or structured prediction. In this approach, one embeds each of the finitely many…

We consider optimal design of infinite-dimensional Bayesian linear inverse problems governed by partial differential equations that contain secondary reducible model uncertainties, in addition to the uncertainty in the inversion parameters.…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain $3$-designs with $2$-transitive permutation groups. The incidence…

A $k$-regular graph on $v$ vertices is a {\em divisible design graph} if there exist integers $\lambda_1,\lambda_2,m,n$ such that the vertex set can be partitioned into $m$ classes of size $n$ and any two different vertices from the same…

A residuated lattice is defined to be integrally closed if it satisfies the equations x\x = e and x/x = e. Every integral, cancellative, or divisible residuated lattice is integrally closed, and, conversely, every bounded integrally closed…

A \textbf{single change covering design} is a $v$-set $X$ and an ordered list $\cL$ of $b$ blocks of size $k$ where every $t$-set must occur in at least one block. Each pair of consecutive blocks differs by exactly one element. A single…

A novel framework is introduced to formalize identifiability in well-specified but ill-posed linear regression models. The framework is distribution-free and accommodates highly correlated features that may or may not relate to the…

For $X \sim X(n; 1, n^{-\alpha_1}, n^{-\alpha_2}, ...)$ in the multiparameter random simplicial complex model we establish necessary and sufficient strict inequalities on the $\alpha_i$'s to linearly embed the complex into…

Let $A$ be a finite commutative ring with unity $1 \neq 0.$ An ideal of $A$ is said to be essential if it has a non-zero intersection with every non-zero ideal of $A.$ The essential graph of $A$ is a simple undirected graph whose vertex set…

Let F be a non-Archimedean locally compact field of residue characteristic p, let G be an inner form of GL(n,F) with n>0, and let l be a prime number different from p. We describe the block decomposition of the category of finite length…

A closed algebraic embedding of $\mathbb{C}^*=\mathbb{C}^1\setminus\{0\}$ into $\mathbb{C}^2$ is 'sporadic' if for every curve $A\subseteq \mathbb{C}^2$ isomorphic to an affine line the intersection with $\mathbb{C}^*$ is at least $2$.…

We examine the maximum dimension of a linear system of plane cubic curves whose $\mathbb{F}_q$-members are all geometrically irreducible. Computational evidence suggests that such a system has a maximum (projective) dimension of $3$. As a…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…