相关论文: The first example of a simple $2-(81,6,2)$ design

We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…

Let $A$ be a finite dimensional algebra of finite global dimension over a finite field. In the present paper, we introduce certain elements in Bridgeland's Hall algebra of $A$, and give a multiplication theorem of these elements. In…

A combinatorial design is a family of sets that are almost disjoint, which is applied in pseudo random number generations and randomness extractions. The parameter, $\rho$, quantifying the overlap between the sets within the family, is…

Let $\mathcal{A}$ be a line arrangement in the complex projective plane $\mathbb{P}^2$, having the points of multiplicity $\geq 3$ situated on two lines in $\mathcal{A}$, say $H_0$ and $H_{\infty}$. Then we show that the non-local…

Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…

Let ${\cal B}$ be a nontrivial biplane of order $k-2$ represented by symmetric canonical incidence matrix with trace $1+ \binom{k}{2}$. We proved that ${\cal B}$ includes a partially balanced incomplete design with association scheme of…

We construct explicit geometric models for and compute the fundamental groups of all plane sextics with simple singularities only and with at least one type $\bold E_8$ singular point. In particular, we discover four new sextics with…

We show that a minimal ideal of a finite-dimensional Lie algebra is either simple or abelian.

A facet of an hyperplane arrangement is called external if it belongs to exactly one bounded cell. The set of all external facets forms the envelope of the arrangement. The number of external facets of a simple arrangement defined by $n$…

The aim of this paper is to present a complete description of the structure of subsets S of an orderable group G satisfying |S^2| = 3|S|-2 and <S> is non-abelian.

Suppose that all nontrivial subsections of a $p$-block $B$ are conjugate (where $p$ is a prime). By using the classification of the finite simple groups, we prove that the defect groups of $B$ are either extraspecial of order $p^3$ with $p…

We define an algebraic set in $23$~dimensional projective space whose $\mathbb Q$-rational points correspond to meromorphic, antisymmetric, paramodular Borcherds products. We know two lines inside this algebraic set. Some rational points on…

In this paper, using group actions, we introduce a new method for constructing partial geometric designs (sometimes referred to as $1\frac{1}{2}$-designs). Using this new method, we construct several infinite families of partial geometric…

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

We provide a unique normal form for rank two irregular connections on the Riemann sphere.In fact, we provide a birational model where we introduce apparent singular points and where the bundlehas a fixed Birkhoff-Grothendieck decomposition.…

Infinitely many explicit solutions of certain second-order differential equations with an apparent singularity of characteristic exponent -2 are constructed by adjusting the parameter of the multi-indexed Laguerre polynomials.

We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is…

Code loops are certain Moufang $2$-loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of…

In the paper "An Abelian Loop for Non-Composites" (arXiv:110.14716), we introduced a group-like structure consisting of odd prime numbers and 1, with properties that allowed us to prove analogous results to well known theorems in Number…