Related papers: Constructing minimal blocking sets using field red…
We show that there are minimal graphs in R^{n+1} whose intersection with the portion of the horizontal hyperplane contained in the unit ball has any prescribed geometry, up to a small deformation. The proof hinges on the construction of…
Wang et al. (IEEE Transactions on Information Theory, vol. 62, no. 8, 2016) proposed an explicit construction of an $(n=k+2,k)$ Minimum Storage Regenerating (MSR) code with $2$ parity nodes and subpacketization $2^{k/3}$. The number of…
This paper presents a scalable physics-based block preconditioner for mixed-dimensional models in beam-solid interaction and their application in engineering. In particular, it studies the linear systems arising from a regularized…
This paper introduces cutting planes that involve minimal structural assumptions, enabling the generation of strong polyhedral relaxations for a broad class of problems. We consider valid inequalities for the set $S\cap P$, where $S$ is a…
Let $\mathrm{PG}(1,E)$ be the projective line over the endomorphism ring $E=End_q({\mathbb F}_{q^t})$ of the $\mathbb F_q$-vector space ${\mathbb F}_{q^t}$. As is well known there is a bijection $\Psi:\mathrm{PG}(1,E)\rightarrow{\cal…
Let $\bar{\Gamma}$ be the point-hyperplane geometry of a projective space $\mathrm{PG(V)},$ where $V$ is a $(n+1)$-dimensional vector space over a finite field $\mathbb{F}_q$ of order $q.$ Suppose that $\sigma$ is an automorphism of…
We introduce a new type of $n$-dimensional generalization of symmetric $(v,k,\lambda)$ block designs. We prove upper bounds on the dimension $n$ in terms of $v$ and $k$. We also define the corresponding concept of $n$-dimensional difference…
Cyclic maximum distance separable (MDS for short) codes are a special subclass of linear codes and have received a lot of attention, as these codes have very important applications in many areas including quantum codes, designs and finite…
We study a class of Little String Theories (LSTs) of A type, described by $N$ parallel M5-branes spread out on a circle and which in the low energy regime engineer supersymmetric gauge theories with $U(N)$ gauge group. The BPS states in…
Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…
A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…
Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many…
Sequences with a low correlation have very important applications in communications, cryptography, and compressed sensing. In the literature, many efforts have been made to construct good sequences with various lengths where binary…
Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…
This paper is mainly devoted to constructions of \(q\)-analogs of group divisible designs and their applications. We give a complete description of the action of \(G=\GL(m,q^l)\) on \(\Omega_k^{k-1}\), where $3\leq k\leq \min\left\lbrace…
We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…
In this paper we consider generalization of procedure of construction of potential systems for systems of partial differential equations with multidimensional spaces of conservation laws. More precisely, for construction of potential…
We provide a characterization of the radii minimal projections of polytopes onto $j$-dimensional subspaces in Euclidean space $\E^n$. Applied on simplices this characterization allows to reduce the computation of an outer radius to a…
We show how the minimal free resolution of a set of $n$ points in general position in projective space of dimension $n-2$ explicitly determines structure constants for a ring of rank $n$. This generalises previously known constructions of…
Motivated by the application of Reed-Solomon codes to recently emerging decentralized storage systems such as Storj and Filebase/Sia, we study the problem of designing compact repair groups for recovering multiple failures in a…