English
Related papers

Related papers: Triple arrays from difference sets

200 papers

We formulate a construction of type-I fracton models based on gauging planar subsystem symmetries of topologically ordered two dimensional layers that have been stacked in three ambient spatial dimensions. Via our construction, any defect…

Strongly Correlated Electrons · Physics 2024-03-15 Dominic J. Williamson , Meng Cheng

We characterize triples of cevians which form a triangle independent of the triangle where they are constructed. This problem is equivalent to solving a three-parameter family of inequalities which we call Ceva's triangle inequalities. Our…

Metric Geometry · Mathematics 2015-03-20 Árpád Bényi , Branko Ćurgus

We exploit a new theory of duality transformations to construct dual representations of models incompatible with traditional duality transformations. Hence we obtain a solution to the long-standing problem of non-Abelian dualities that…

Statistical Mechanics · Physics 2015-06-05 E. Cobanera , G. Ortiz , E. Knill

Augmented designs are typically used in early-stage breeding programs to compare single replicates of test entries by combining them with replicated check varieties. One or two dimensional incomplete blocking can be incorporated in the…

Methodology · Statistics 2025-11-24 E. R. Williams , H-P. Piepho

Frame difference families, which can be obtained via a careful use of cyclotomic conditions attached to strong difference families, play an important role in direct constructions for resolvable balanced incomplete block designs. We…

Combinatorics · Mathematics 2018-02-06 Simone Costa , Tao Feng , Xiaomiao Wang

Let $\mathcal {A}$ be a unital $\ast$-algebra. For $A, B\in\mathcal{A}$, define by $[A, B]_{*}=AB-BA^{\ast}$ and $A\bullet B=AB+BA^{\ast}$ the new products of $A$ and $B$. In this paper, under some mild conditions on $\mathcal {A}$, it is…

Operator Algebras · Mathematics 2021-12-09 Dongfang Zhang , Changjing Li

We computationally completely enumerate a number of types of row-column designs up to isotopism, including double, sesqui and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO-arrays.…

Combinatorics · Mathematics 2024-06-25 Gerold Jäger , Klas Markström , Lars-Daniel Öhman , Denys Shcherbak

All complex Hadamard matrices in dimensions two to five are known. We use this fact to derive all inequivalent sets of mutually unbiased (MU) bases in low dimensions. We find a three-parameter family of triples of MU bases in dimension four…

Mathematical Physics · Physics 2010-08-09 Stephen Brierley , Stefan Weigert , Ingemar Bengtsson

Using Hecke characters, we construct two infinite families of newforms with complex multiplication, one by $\mathbb{Q}(\sqrt{-3})$ and the other by $\mathbb{Q}(\sqrt{-2})$. The values of the $p$-th Fourier coefficients of all the forms in…

Number Theory · Mathematics 2018-07-12 Alexis Gomez , Dermot McCarthy , Dylan Young

We demonstrate that commutativity of numerous one-dimensional subalgebras in $W_{1+\infty}$ algebra, i.e. the existence of many non-trivial integrable systems described in recent arXiv:2303.05273 follows from the subset of relations in…

High Energy Physics - Theory · Physics 2023-08-30 A. Mironov , V. Mishnyakov , A. Morozov , A. Popolitov

In this paper we propose a general ternary construction of lattices from three rows and ternary codes. Most laminated lattices and Kappa lattices in ${\bf R}^n$, $n\leq 24$ can be recovered from our tenary construction naturally. This…

Number Theory · Mathematics 2015-04-15 Hao Chen

We show that a dense subset of a sufficiently large group multiplication table contains either a large part of the addition table of the integers modulo some $k$, or the entire multiplication table of a certain large abelian group, as a…

Combinatorics · Mathematics 2019-04-10 Jason Long

Linear codes and $t$-designs are interactive with each other. It is well known that some $t$-designs have been constructed by using certain linear codes in recent years. However, only a small number of infinite families of the extended…

Information Theory · Computer Science 2022-11-28 Can Xiang , Chunming Tang

We prove that any triple of complete flags in $\mathbb R^d$ admits a common generating set of size $\lfloor 5d/3\rfloor$ and that this bound is sharp. This result extends the classical linear-algebraic fact -- a consequence of the Bruhat…

Combinatorics · Mathematics 2025-02-14 Federico Glaudo , Noah Kravitz , Chayim Lowen

In this paper, we study the integral Cayley graphs over a non-abelian group $U_{6n}=\langle a,b\mid a^{2n}=b^3=1, a^{-1}ba=b^{-1}\rangle$ of order $6n$. We give a necessary and sufficient condition for the integrality of Cayley graphs over…

Combinatorics · Mathematics 2024-01-17 Jing Wang , Xiaogang Liu , Ligong Wang

We use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, probably not obtainable by forcing. This gives also a new method to get programs…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

There is a long-standing problem of algebra to extend the symmetric monoidal structure of abelian groups, given by the tensor product, to a non abelian setting. In this paper we show that such an extension is possible. Morover our non…

Category Theory · Mathematics 2007-05-23 H. -J. Baues , M. Jibladze , T. Pirashvili

We study the avoidability of long $k$-abelian-squares and $k$-abelian-cubes on binary and ternary alphabets. For $k=1$, these are M\"akel\"a's questions. We show that one cannot avoid abelian-cubes of abelian period at least $2$ in infinite…

Discrete Mathematics · Computer Science 2015-07-10 Michaël Rao , Matthieu Rosenfeld

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

Commutative Algebra · Mathematics 2025-07-01 Mátyás Domokos

A set of elements of a finite abelian group is called sum-free if it contains no Schur triple, i.e., no triple of elements $x,y,z$ with $x+y=z$. The study of how large the largest sum-free subset of a given abelian group is had started more…

Combinatorics · Mathematics 2016-07-21 Wojciech Samotij , Benny Sudakov
‹ Prev 1 8 9 10 Next ›