English
Related papers

Related papers: On tight $4$-designs in Hamming association scheme…

200 papers

Almost designs ($t$-adesigns) were proposed and discussed by Ding as a certain generalization of combinatorial designs related to almost difference sets. Unlike $t$-designs, it is not clear whether $t$-adesigns need also be $(t-1)$-designs…

Combinatorics · Mathematics 2018-11-19 Jerod Michel , Qi Wang

Whitney proved in 1931 that 4-connected planar triangulations are Hamiltonian. Hakimi, Schmeichel, and Thomassen conjectured in 1979 that if $G$ is a 4-connected planar triangulation with $n$ vertices then $G$ contains at least…

Combinatorics · Mathematics 2021-04-14 Xiaonan Liu , Xingxing Yu

In this paper, the association scheme defined on the flags of a finite generalized quadrangle is considered. All possible fusions of this scheme are listed, and a full description for those of classes 2 and 3 is given. Furthermore, it is…

Combinatorics · Mathematics 2024-06-07 Francesco Colangelo , Giusy Monzillo , Alessandro Siciliano

Analogues of Ramsey's Theorem for infinite structures such as the rationals or the Rado graph have been known for some time. In this context, one looks for optimal bounds, called degrees, for the number of colors in an isomorphic…

Combinatorics · Mathematics 2022-06-03 Natasha Dobrinen

We study higher-form global symmetries and a higher-group structure of a low-energy limit of $(3+1)$-dimensional axion electrodynamics in a gapped phase described by a topological action. We argue that the higher-form symmetries should have…

High Energy Physics - Theory · Physics 2022-03-04 Yoshimasa Hidaka , Muneto Nitta , Ryo Yokokura

Generalizing Chv\'atal's classic 1972 result, Ho\`ang proposed in 1995 the following conjecture, which strengthens Chv\'atal's result in terms of toughness: Let $t\ge 1$ be a positive integer and $G$ be a $t$-tough graph on $n \ge 3$…

Combinatorics · Mathematics 2025-03-20 Songling Shan , Arthur Tanyel

We construct two distinct yet related M-theory models that provide suitable frameworks for the study of knot invariants. We then focus on the four-dimensional gauge theory that follows from appropriately compactifying one of these M-theory…

High Energy Physics - Theory · Physics 2018-01-17 Verónica Errasti Díez

We introduce and study Hodge-de Rham numbers for compact almost complex 4-manifolds, generalizing the Hodge numbers of a complex surface. The main properties of these numbers in the case of complex surfaces are extended to this more general…

Differential Geometry · Mathematics 2023-01-19 Joana Cirici , Scott O. Wilson

We work in the smooth category. Let $N$ be a closed connected orientable 4-manifold with torsion free $H_1$, where $H_q := H_q(N; \mathbb Z)$. Our main result is a readily calculable classification of embeddings $N\to\mathbb R^7$ up to…

Geometric Topology · Mathematics 2022-04-12 D. Crowley , A. Skopenkov

We study the Hamiltonian truncation for the two-dimensional $\lambda\phi^4$ theory within the framework of Hamiltonian truncation effective theory, where truncation artifacts are mitigated through a systematic inclusion of corrective terms…

High Energy Physics - Phenomenology · Physics 2026-02-16 Andrea Maestri , Simone Rodini , Barbara Pasquini

The total homology of the loop space of the configuration space of ordered distinct n points in R^m has a structure of a Hopf algebra defined by the 4-term relations if m>2. We describe a relation of between the cohomology of this loop…

Algebraic Topology · Mathematics 2007-05-23 Toshitake Kohno

We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…

Combinatorics · Mathematics 2023-02-24 Maxim Kazaryan , Sergei Lando

In this paper we show that $e/n$ is the sharp threshold for the existence of tight Hamilton cycles in random $k$-uniform hypergraphs, for all $k\ge 4$. When $k=3$ we show that $1/n$ is an asymptotic threshold. We also determine thresholds…

Combinatorics · Mathematics 2011-07-27 Andrzej Dudek , Alan Frieze

We give a sufficient condition for a non-commutative association scheme to have a fusion association scheme, and construct non-commutative association schemes from symmetric balanced generalized weighing matrices and generalized Hadamard…

Combinatorics · Mathematics 2018-04-10 Hadi Kharaghani , Sho Suda

We consider nonsymmetric hermitian complex Hadamard matrices belonging to the Bose-Mesner algebra of commutative nonsymmetric association schemes. First, we give a characterization of the eigenmatrix of a commutative nonsymmetric…

Combinatorics · Mathematics 2017-12-19 Takuya Ikuta , Akihiro Munemasa

We study a special class of four-point correlation functions of infinitely heavy half-BPS operators in planar N=4 SYM which admit factorization into a product of two octagon form factors. We demonstrate that these functions satisfy a system…

High Energy Physics - Theory · Physics 2020-08-26 A. V. Belitsky , G. P. Korchemsky

It is shown that among all tight designs in FP^n, where F is R, C, or H (quaternions), other than RP^1, only 5-designs in CP^1 have irrational angle set. This is the only case of equal ranks of the first and the last irreducible idempotent…

Combinatorics · Mathematics 2007-05-23 Yuri I. Lyubich

Inspired by some intriguing examples, we study uniform association schemes and uniform coherent configurations, including cometric Q-antipodal association schemes. After a review of imprimitivity, we show that an imprimitive association…

Combinatorics · Mathematics 2013-08-22 Edwin R. van Dam , William J. Martin , Mikhail E. Muzychuk

In this note, we prove that every 4-connected optimal 2-planar graph is Hamiltonian-connected. Furthermore, we show that the 4-connectedness condition is sharp by constructing infinitely many 3-connected optimal 2-planar graphs that are…

Combinatorics · Mathematics 2026-05-05 Licheng Zhang , Yuanqiu Huang , Zhangdong Ouyang

We construct orthogonal arrays OA$_{\lambda} (k,n)$ (of strength two) having a row that is repeated $m$ times, where $m$ is as large as possible. In particular, we consider OAs where the ratio $m / \lambda$ is as large as possible; these…

Combinatorics · Mathematics 2018-12-14 Charles J. Colbourn , Douglas R. Stinson , Shannon Veitch