A subspace $t$-design with parameters $t$-$(v,k,\lambda _{t})_{q}$ is a pair $\mathcal{D}=(\mathcal{V}, \mathcal{B})$ where $\mathcal{V}$ is the $v$-dimensional vector space over the field $\mathbb{F}_{q}$, and ℬ is a collection of $k$-dimensional subspaces of $\mathcal{V}$ such that every $t$-dimensional subspace of $\mathcal{V}$ is contained in precisely $\lambda _{t}$ members of ℬ. In this paper, we give new general necessary conditions for the existence of a subspace 3-design $\mathcal{D}$ with a prescribed automorphism group $G$. These necessary conditions are based on a tactical decomposition of $\mathcal{D}$ induced by the action of $G$ and are given by means of a system of equations involving the coefficients of the tactical decomposition matrices.
Necessary Conditions for the Existence of Subspace 3-Designs with Nontrivial Automorphism Groups. // Bulletin of Materials Science. – 2026. – DOI: 10.1007/s11786-026-00629-5. – URL: https://link.springer.com/article/10.1007/s11786-026-00629-5
(2026). Necessary Conditions for the Existence of Subspace 3-Designs with Nontrivial Automorphism Groups. Bulletin of Materials Science. https://doi.org/10.1007/s11786-026-00629-5
“Necessary Conditions for the Existence of Subspace 3-Designs with Nontrivial Automorphism Groups.” Bulletin of Materials Science, 2026. doi:10.1007/s11786-026-00629-5.
@article{article34435,
title = {Necessary Conditions for the Existence of Subspace 3-Designs with Nontrivial Automorphism Groups},
journal = {Bulletin of Materials Science},
year = {2026},
doi = {10.1007/s11786-026-00629-5},
url = {https://link.springer.com/article/10.1007/s11786-026-00629-5}
}
A multivariate polynomial $f$ is decomposable if $f$ is a composition $f=u\circ h$, where $u$ is a univariate polynomial of degree greater than one and $h$ is a multivariate polynomial. We consider the problem of computing the nearest...
Cancer is a major cause of mortality, yet the mechanisms governing its growth, progression, and elimination remain incompletely understood. Mathematical modeling not only clarifies these complex processes but also provides clinicians...
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^{n} - 2^{k} + 1$,...
This work is devoted to the symbolic computation of centralizers of ordinary differential operators (ODOs), in the ring of differential operators. Starting with an operator $L$ of order $n$ and the order $\mathfrak{m}$ of a non-trivial...
In this work, we address the problem of expressing sequences of $d$-orthogonal polynomials in terms of either orthogonal polynomials or the canonical basis. We derive a general recurrence relation that enables the symbolic recursive...