相关论文: Quasi-symmetric designs on 56 points

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…

Quasi-one-dimensional quantum structures with spectra scaling faster than the square of the eigenmode number (superscaling) can generate intrinsic, off-resonant optical nonlinearities near the fundamental physical limits, independent of the…

The symmetry SU(2) and its geometric Bloch Sphere rendering are familiar for a qubit (spin-1/2) but extension of symmetries and geometries have been investigated far less for multiple qubits, even just a pair of them, that are central to…

In this paper, we introduce notions of partitionability and characteristic sets of homogeneous polynomials and give a complete classification of groups faithfully acting on smooth cubic fivefolds. Specifically, we prove that there exist 20…

Background: Quasi dynamical symmetries (QDS) and partial dynamical symmetries (PDS) play an important role in the understanding of complex systems. Up to now these symmetry concepts have been considered to be unrelated. Purpose: Establish a…

The existence of quasi-bi-Hamiltonian structures for the Kepler problem is studied. We first relate the superintegrability of the system with the existence of two complex functions endowed with very interesting Poisson bracket properties…

We show that requiring sixteen supersymmetries in quantum mechanical gauge theory implies the existence of a web of constrained interactions. Contrary to conventional wisdom, these constraints extend to arbitrary orders in the momentum…

Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavar\'{e} (2003). In order to obtain asymptotic approximations to their…

We study almost symmetric semigroups generated by odd integers. If the embedding dimension is four, we characterize when a symmetric semigroup that is not complete intersection or a pseudo-symmetric semigroup is generated by odd integers.…

We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…

A $(v,k,\lambda)$-covering is a pair $(V, \mathcal{B})$, where $V$ is a $v$-set of points and $\mathcal{B}$ is a collection of $k$-subsets of $V$ (called blocks), such that every unordered pair of points in $V$ is contained in at least…

In this note two Steiner systems $S(2,7,505)$, two Steiner systems $S(2,7,589)$, and ten Steiner systems $S(2,8,624)$ are presented. This resolves two of $21$ undecided cases for block designs with block length $7$, and one of $37$ cases…

In this work it is shown that certain interesting types of quasi-orthogonal system of subalgebras (whose existence cannot be ruled out by the trivial necessary conditions) cannot exist. In particular, it is proved that there is no…

Adaptive quantum design identifies the best broken-symmetry configurations of atoms and molecules that enable a desired target function response. In this work, numerical optimization is used to design atomic clusters with specified…

We study a more general version of the gluings of hyperbolic orbifolds in the spirit of Gromov and Piatetski-Shapiro, where the gluing pieces, called the building blocks, are no longer assumed to be arithmetic or incommensurable. We prove…

In this paper, we present a method for constructing point primitive block transitive $t$-designs invariant under finite groups. Furthermore, we demonstrate that every point and block primitive $G$-invariant design can be generated using…

Intersection numbers for subspace designs are introduced and $q$-analogs of the Mendelsohn and K\"ohler equations are given. As an application, we are able to determine the intersection structure of a putative $q$-analog of the Fano plane…

Hard disks systems are often considered as prototypes for simple fluids. In a statistical mechanics context, the hard disk configuration space is generally quotiented by the action of various symmetry groups. The changes in the topological…

We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian…

We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic, and that such an isomorphism can be chosen so that the corresponding blocks are quantum isomorphic -- in particular,…