English
Related papers

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

200 papers

One of the very first results about designs over finite fields, by S. Thomas, is the existence of a cyclic 2-$(n,3,7)$ design over $\mathbb{F}_{2}$ for every integer $n$ coprime with 6. Here, by means of difference methods, we reprove and…

Combinatorics · Mathematics 2019-02-27 Marco Buratti , Anamari Nakic

Symmetry group methods are applied to obtain all explicit group-invariant radial solutions to a class of semilinear Schrodinger equations in dimensions $n\neq 1$. Both focusing and defocusing cases of a power nonlinearity are considered,…

Mathematical Physics · Physics 2016-09-09 Stephen C. Anco , Wei Feng

The doublet--triplet mass splitting problem is one of the most serious problems in supersymmetric grand unified theories (GUTs). A class of models based on a product gauge group, such as the SU(5)_{GUT} times U(3)_H or the SU(5)_{GUT} times…

High Energy Physics - Phenomenology · Physics 2007-05-23 T. Watari , T. Yanagida

We introduce the notion of quasi-orthogonal cocycle. This is motivated in part by the maximal determinant problem for square $\{\pm 1\}$-matrices of size congruent to $2$ modulo $4$. Quasi-orthogonal cocycles are analogous to the orthogonal…

Combinatorics · Mathematics 2019-08-27 J. A. Armario , D. L. Flannery

In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a…

Information Theory · Computer Science 2025-06-10 Chaofeng Guan , Ruihu Li , Jingjie Lv , Zhi Ma

The delta set of a numerical semigroup $S$, denoted $\Delta(S)$, is a factorization invariant that measures the complexity of the sets of lengths of elements in $S$. We study the following problem: Which finite sets occur as the delta set…

Commutative Algebra · Mathematics 2022-01-25 Stefan Colton , Nathan Kaplan

Nov\'{a}k conjectured in 1974 that for any cyclic Steiner triple systems of order $v$ with $v\equiv 1\pmod{6}$, it is always possible to choose one block from each block orbit so that the chosen blocks are pairwise disjoint. We consider the…

Combinatorics · Mathematics 2021-08-03 Tao Feng , Daniel Horsley , Xiaomiao Wang

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

Information Theory · Computer Science 2023-06-27 Hao Chen

We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…

Computational Complexity · Computer Science 2019-04-30 Thomas Colcombet , Joël Ouaknine , Pavel Semukhin , James Worrell

We study a family of semiample divisors on $\bar{M}_{0,n}$ defined using conformal blocks and analyze their associated morphisms.

Algebraic Geometry · Mathematics 2010-12-01 Valery Alexeev , Angela Gibney , David Swinarski

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

Binary cyclic codes have been a hot topic for many years, and significant progress has been made in the study of this types of codes. As is well known, it is hard to construct infinite families of binary cyclic codes [n, n+1/2] with good…

Information Theory · Computer Science 2024-04-30 Tingting Wu , Lanqiang Li , Xiuyu Zhang , Shixin Zhu

We begin the study of collections of three blocks which can occur in a symmetric configuration with block size 3, $v_3$. Formulae are derived for the number of occurrences of these and it is shown that the triangle, i.e. abf, ace, bcd is a…

Combinatorics · Mathematics 2021-08-17 Grahame Erskine , Terry Griggs , Jozef Širáň

For a smooth projective variety $X$ of dimension $d \geq 5$ over an algebraically closed field $k$ of characteristic zero, it is shown in this paper that the bounded derived category of the Hilbert scheme of three points $X^{[3]}$ admits a…

Algebraic Geometry · Mathematics 2026-04-06 Erik Nikolov

We investigate a higher-group structure of massless axion electrodynamics in $(3+1)$ dimensions. By using the background gauging method, we show that the higher-form symmetries necessarily have a global semistrict 3-group (2-crossed module)…

High Energy Physics - Theory · Physics 2021-02-10 Yoshimasa Hidaka , Muneto Nitta , Ryo Yokokura

We present a solution to the doublet-triplet splitting problem in supersymmetric $SU(5)$ by enlarging the group to $SU(5)\times SU(5)$ and by introducing two supermultiplets in the $(5,5)$ and $(\bar{5},\bar{5})$ representations of the…

High Energy Physics - Phenomenology · Physics 2019-05-14 Renata Jora

A convex geometric hypergraph or cgh consists of a family of subsets of a strictly convex set of points in the plane. There are eight pairwise nonisomorphic cgh's consisting of two disjoint triples. These were studied at length by Bra{\ss}…

Combinatorics · Mathematics 2020-12-22 Zoltán Füredi , Dhruv Mubayi , Jason O'Neill , Jacques Verstraëte

This paper studies the number of limit cycles that may bifurcate from an equilibrium of an autonomous system of differential equations. The system in question is assumed to be of dimension $n$, have a zero-Hopf equilibrium at the origin,…

Dynamical Systems · Mathematics 2023-05-02 Bo Huang , Dongming Wang

We define an infinite sequence of new invariants, delta_n, of a group G that measure the size of the successive quotients of the derived series of G. In the case that G is the fundamental group of a 3-manifold, we obtain new 3-manifold…

Geometric Topology · Mathematics 2007-05-23 Shelly Harvey

We prove that a binary linear code of block length $n$ that is locally correctable with $3$ queries against a fraction $\delta > 0$ of adversarial errors must have dimension at most $O_{\delta}(\log^2 n \cdot \log \log n)$. This is almost…

Information Theory · Computer Science 2024-04-10 Omar Alrabiah , Venkatesan Guruswami