Related papers: Linearly Embeddable Designs

Lance Bryant noticed in his thesis that there was a flaw in our paper "Associated graded rings of one-dimensional analytically irreducible rings", J. Algebra 304 (2006), 349-358. It can be fixed by adding a condition, called the BF…

A mathematical model is identifiable if its parameters can be recovered from data. Here, we focus on a particular class of model, linear compartmental models, which are used to represent the transfer of substances in a system. We analyze…

We call an element of a finite general linear group $ \textrm{GL}(d,q) $ \emph{fat} if it leaves invariant, and acts irreducibly on, a subspace of dimension greater than $d/2$. Fatness of an element can be decided efficiently in practice by…

Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…

Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side effects focusing on the case of elementary time. Our main…

We study the rank-three lifting problem for incidence matrices of finite projective planes through residue-level determinant constraints invisible to tropical valuations alone. In residue characteristic $\neq 3$, any rank-$\le 3$ lift of…

Given a linear group G over a field k, we define a notion of index and residue of an element g of G(k((t)). This provides an alternative proof of Gabber's theorem stating that G has no subgroups isomorphic to the additive or the commutative…

This investigation studies the decidability problem of plane edge coloring with three symbols. In the edge coloring (or Wang tiles) of a plane, unit squares with colored edges that have one of $p$ colors are arranged side by side such that…

Let $G$ be a locally compact totally disconnected topological group. Under a necessary mild assumption, we show that the irreducible unitary representations of $G$ are uniformly admissible if and only if the irreducible smooth…

The results obtained in this paper grew from an attempt to generalize the main theorem of [1]. There it was shown that any circuit injection (a 1-1 onto edge map f such that if C is a circuit then f(C) is a circuit) from a 3-connected, not…

Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…

This paper addresses the resilience of large-scale closed-loop structured systems in the sense of arbitrary pole placement when subject to failure of feedback links. Given a structured system with input, output, and feedback matrices, we…

A design is a collection of distinct points in a given set $X$, which is assumed to be a compact subset of $R^d$, and the mesh-ratio of a design is the ratio of its fill distance to its separation radius. The uniformity constant of a…

We prove that a smooth and connected algebraic group $G$ is affine if and only if any invertible sheaf on any normal $G$-variety is $G$-invariant. For the proof, a key ingredient is the following result: if $G$ is a connected and smooth…

Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of…

Among the major difficulties that one may encounter when estimating parameters in a nonlinear regression model are the nonuniqueness of the estimator, its instability with respect to small perturbations of the observations and the presence…

In many applications, particularly in the natural sciences, the available high-dimensional set of features may contain variables that are not correlated with the response under consideration. Such irrelevant features can, in certain cases,…

By using nonstandard analysis, we prove embeddability properties of difference sets $A-B$ of sets of integers. (A set $A$ is "embeddable" into $B$ if every finite configuration of $A$ has shifted copies in $B$.) As corollaries of our main…

Efforts to improve the adversarial robustness of convolutional neural networks have primarily focused on developing more effective adversarial training methods. In contrast, little attention was devoted to analyzing the role of…

Classical designs and their (projective) q-analogs can both be viewed as designs in matroids, using the matroid of all subsets of a set and the matroid of linearly independent subsets of a vector space, respectively. Another natural matroid…