English
Related papers

Related papers: On the existence of block-transitive combinatorial…

200 papers

Recently the long-standing puzzle about counting the Witten index in N=1 supersymmetric gauge theories was resolved. The resolution was based on existence (for higher orthogonal $SO(N), N \geq 7$ and exceptional gauge groups) of flat…

High Energy Physics - Theory · Physics 2015-06-26 K. G. Selivanov

This paper presents a classification of locally $2$-homogeneous designs, extending Kantor's classification of 2-transitive symmetric designs (1985).

Combinatorics · Mathematics 2026-04-15 Jianfu Chen , Peice Hua , Cai Heng Li , Yanni Wu

Terwilliger algebras are finite-dimensional semisimple algebras that were first introduced by Paul Terwilliger in 1992 in studies of association schemes and distance-regular graphs. The Terwilliger algebras of the conjugacy class…

Combinatorics · Mathematics 2024-11-14 Allen Herman , Roghayeh Maleki , Andriaherimanana Sarobidy Razafimahatratra

The interplay between coding theory and $t$-designs started many years ago. While every $t$-design yields a linear code over every finite field, the largest $t$ for which an infinite family of $t$-designs is derived directly from a linear…

Information Theory · Computer Science 2017-06-02 Cunsheng Ding , Chengju Li

We present a uniform framework for constructing $3$-designs from $\mathrm{GL}_2(\mathbb F_q)$-invariant subspaces of $\mathbb F_q[X,Y]_k$, the space of homogeneous polynomials of degree $k$. Given such a subspace $W$, we associate a…

Combinatorics · Mathematics 2026-04-27 Huawei Wu , Lewen Wang , Sihuang Hu

We announce the classification of two related classes of flag-transitive geometries. There is an infinite family of such geometries, related to the nonsplit extensions $3^{[{n\atop 2}]_{_2}}\cdot \SP_{2n}(2)$, and twelve sporadic examples…

Group Theory · Mathematics 2009-09-25 Alexander A. Ivanov , Sergey V. Shpectorov

Consider families of $k$-subsets (or blocks) on a ground set of size $v$. Recall that if all $t$-subsets occur with the same frequency $\lambda$, one obtains a $t$-design with index $\lambda$. On the other hand, if all $t$-subsets occur…

Combinatorics · Mathematics 2013-11-08 Peter J. Dukes , Jane Wodlinger

An $H(n,q,w,t)$ design is considered as a collection of $(n-w)$-faces of the hypercube $Q^n_q$ perfectly piercing all $(n-t)$-faces. We define an $A(n,q,w,t)$ design as a collection of $(n-t)$-faces of hypercube $Q^n_q$ perfectly cowering…

Combinatorics · Mathematics 2014-12-15 Vladimir N. Potapov

A Ryser design $\mathcal{D}$ on $v$ points is a collection of $v$ proper subsets (called blocks) of a point-set with $v$ points such that every two blocks intersect each other in $\lambda$ points (and $\lambda < v$ is a fixed number) and…

Combinatorics · Mathematics 2019-09-12 Tushar D. Parulekar , Sharad S. Sane

The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…

Combinatorics · Mathematics 2020-03-02 Ben Barber , Stefan Glock , Daniela Kühn , Allan Lo , Richard Montgomery , Deryk Osthus

We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym$(n)$. In particular, we compute orbits of ordered pairs on Sym$(n)$ acted upon by conjugation…

Combinatorics · Mathematics 2013-11-08 Mathieu Bogaerts , Peter Dukes

A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor,…

Group Theory · Mathematics 2014-02-26 Alice Devillers , Michael Giudici , Cai Heng Li , Geoffrey Pearce , Cheryl E. Praeger

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…

Combinatorics · Mathematics 2019-04-10 Xiaoni Du , Rong Wang , Cuiling Fan

Interplay between coding theory and combinatorial $t$-designs has been a hot topic for many years for combinatorialists and coding theorists. Some infinite families of cyclic codes supporting infinite families of $3$-designs have been…

Information Theory · Computer Science 2022-07-18 Xiaoqiang Wang , Chunming Tang , Cunsheng Ding

There are two standard approaches to the construction of $t$-designs. The first one is based on permutation group actions on certain base blocks. The second one is based on coding theory. The objective of this paper is to give a spectral…

Combinatorics · Mathematics 2018-06-12 Eun-Kyung Cho , Cunsheng Ding , Jong Yoon Hyun

We give a construction of a family of designs with a specified point-partition, and determine the subgroup of automorphisms leaving invariant the point-partition. We give necessary and sufficient conditions for a design in the family to…

Combinatorics · Mathematics 2015-02-25 Peter J. Cameron , Cheryl E. Praeger

Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable…

Combinatorics · Mathematics 2026-04-10 Veronika Körber , Tobias Schnieders , Jan Stricker , Jasmin Walizadeh

Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…

Combinatorics · Mathematics 2020-12-07 Simona Bonvicini , Marco Buratti , Martino Garonzi , Gloria Rinaldi , Tommaso Traetta

We investigate the rings of semi-invariants for tame string algebras A(n) of non-polynomial growth. We are interested in dimension vectors of band modules. We use geometric technique related to the description of coordinate rings on…

Representation Theory · Mathematics 2011-03-29 Witold Kraśkiewicz , Jerzy Weyman

A general theory of permutation orbifolds is developed for arbitrary twist groups. Explicit expressions for the number of primaries, the partition function, the genus one characters, the matrix elements of modular transformations and for…

High Energy Physics - Theory · Physics 2009-10-31 P. Bantay