English
Related papers

Related papers: Semi-cyclic holey group divisible designs with blo…

200 papers

To each supersimple $2-(n,4,\lambda)$ design $\mathcal{D}$ one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid associated to $M_{13}$ which is constructed from $\mathbb{P}_3$.…

Group Theory · Mathematics 2015-04-09 Nick Gill , Neil I. Gillespie , Jason Semeraro

For any numerical semigroup $S$, there are infinitely many numerical symmetric semigroups $T$ such that $S=\frac{T}{2}$ is their half. We are studying the Betti numbers of the numerical semigroup ring $K[T]$ when $S$ is a 3-generated…

Commutative Algebra · Mathematics 2011-11-08 Vincenzo Micale , Anda Olteanu

We solve the existence problem for $F$-designs for arbitrary $r$-uniform hypergraphs~$F$. This implies that given any $r$-uniform hypergraph~$F$, the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of…

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

A $t$-$(n,k,\lambda)$ design over $\F_q$ is a collection of $k$-dimensional subspaces of $\F_q^n$, called blocks, such that each $t$-dimensional subspace of $\F_q^n$ is contained in exactly $\lambda$ blocks. Such $t$-designs over $\F_q$ are…

Combinatorics · Mathematics 2013-06-11 Arman Fazeli , Shachar Lovett , Alexander Vardy

This is the third part of a cycle of papers devoted to the construction of a finitely presented infinite nil-semigroup satisfying the identity $x^9 = 0$. This construction answers the problem of L. N. Shevrin and M. V. Sapir, posed, for…

Rings and Algebras · Mathematics 2022-06-23 Ilya A. Ivanov-Pogodaev , Alexey Ya. Kanel-Belov

The conventional supersymmetric grand unified theories suffer from two serious problems, the large mass splitting between doublet and triplet Higgs multiplets, and the too long lifetime of the proton. A unification model based on a…

High Energy Physics - Phenomenology · Physics 2009-11-07 Y. Imamura , T. Watari , T. Yanagida

We show that Nichols algebras of most simple Yetter-Drinfeld modules over the projective special linear group over a finite field, corresponding to semisimple orbits, have infinite dimension. We introduce a new criterium to determine when a…

Quantum Algebra · Mathematics 2018-03-14 Nicolás Andruskiewitsch , Giovanna Carnovale , Gastón Andrés García

Let H be a cosemisimple Hopf algebra over an algebraically closed field k which contains a simple subcoalgebra of dimension 9. We show that if H has no simple subcoalgebras of even dimension then H contains either a grouplike element with…

Rings and Algebras · Mathematics 2010-10-05 S. Burciu

This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…

Combinatorics · Mathematics 2023-11-27 Yanxun Chang , Simone Costa , Tao Feng , Xiaomiao Wang

Let $q$ be a prime number, $k$ an algebraically closed field of characteristic 0, and $H$ a semisimple Hopf algebra of dimension $2q^3$. This paper proves that $H$ is always semisolvable. That is, such Hopf algebras can be obtained by (a…

Rings and Algebras · Mathematics 2013-08-16 Jingcheng Dong , Shuanhong Wang

In this paper we will consider the 2-fold symmetric complex hyperbolic triangle groups generated by three complex reflections through angle 2pi/p with p no smaller than 2. We will mainly concentrate on the groups where some elements are…

Algebraic Topology · Mathematics 2017-04-20 John R. Parker , Li-Jie Sun

This note gives a uniform, self-contained, and fairly direct approach to a variety of obstruction-theoretic problems on 8-manifolds. We give necessary and sufficient cohomological critera for the existence of almost complex and almost…

Algebraic Topology · Mathematics 2008-10-29 Martin Cadek , Michael Crabb , Jiri Vanzura

Let $[n]=\{1,2,\ldots,n\}$ be a finite chain and let $\mathcal{P}_{n}$ be the semigroup of partial transformations on $[n]$. Let $\mathcal{CP}_{n}=\{\alpha\in \mathcal{P}_{n}: (for ~all~x,y\in Dom~\alpha)~|x\alpha-y\alpha|\leq|x-y|\}$ be…

Group Theory · Mathematics 2018-03-08 A. Umar , M. M. Zubairu

We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic…

Quantum Physics · Physics 2023-08-01 Renyu Wang , Hsiang-Ku Lin , Leonid P. Pryadko

A Steiner triple system, STS$(v)$, is a family of $3$-subsets (blocks) of a set of $v$ elements such that any two elements occur together in precisely one block. A collection of triples consisting of two copies of each block of an STS is…

Combinatorics · Mathematics 2025-04-24 Peter J. Dukes , Esther R. Lamken

This paper investigates simple $3$-$(2^n+1,13,\lambda)$ designs admitting $\mathrm{PSL}$$(2,2^n)$ as an automorphism group. We determine all possible values of $\lambda$ by systematically analyzing the orbits of $13$-element subsets under…

Combinatorics · Mathematics 2025-03-21 Takara Kondo , Yuto Nogata

In this paper we analyze the heteroclinic cycle and the Hopf bifurcation of a generic dynamical system with the symmetry of the group $\mathbf{Q}_8,$ constructed via a Cayley graph. While the Hopf bifurcation is similar to that of a…

Dynamical Systems · Mathematics 2017-07-28 Adrian C. Murza

Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to…

Information Theory · Computer Science 2026-05-25 Gustavo Terra Bastos , Angelynn Álvarez , Cameron Williams

An explicit construction of a family of binary LDPC codes called LU(3,q), where q is a power of a prime, was recently given. A conjecture was made for the dimensions of these codes when q is odd. The conjecture is proved in this note. The…

Information Theory · Computer Science 2007-12-04 Peter Sin , Qing Xiang

Optimization over $l\times m\times n$ integer $3$-way tables with given line-sums is NP-hard already for fixed $l=3$, but is polynomial time solvable with both $l,m$ fixed. In the {\em huge} version of the problem, the variable dimension…

Optimization and Control · Mathematics 2015-11-26 Shmuel Onn , Pauline Sarrabezolles