Related papers: Violating the Ingleton Inequality with Finite Grou…

It is shown that every even, zonal measure on the Euclidean unit sphere gives rise to an isoperimetric inequality for sets of finite perimeter which directly implies the classical Euclidean isoperimetric inequality. The strongest member of…

We spot a hole in the area of succinct data structures for graph classes from a universe of size at most $n^n$. Very often, the input graph is labeled by the user in an arbitrary and easy-to-use way, and the data structure for the graph…

For a finite group $G$, $N_\infty$ operads encode collections of norm maps, and by work of Blumberg--Hill and Rubin their homotopy category is equivalent to the poset of $G$--transfer systems on the subgroup lattice of $G$. In \cite{ABB+25}…

The spectrum of a finite group is the set of orders of its elements. We are concerned with finite groups having the same spectrum as a direct product of nonabelian simple groups with abelian Sylow $2$-subgroups. For every positive integer…

In 1934, Garrett Birkhoff has shown that the number of isomorphism classes of finite metabelian groups of order $p^{22}$ tends to infinity with $p$. More precisely, for each prime number $p$ there is a family…

The relation between the boolean functions and Bell inequalities for qubits is analyzed. The connection between the maximal quantum violation of a Bell inequality and the nonlinearity of the corresponding boolean function is discussed. A…

Network nonlocality allows one to demonstrate nonclassicality in networks with fixed joint measurements, that is without random measurement settings. The simplest network in a loop, the triangle, with 4 outputs per party is especially…

There is a natural action of the braid group on the symmetric matrices with units on the diagonal, appearing in various fields as Singularity Theory, Frobenius Manifolds or Isomonodromic deformations of certain classes of linear…

We derive both numerically and analytically Bell inequalities and quantum measurements that present enhanced resistance to detector inefficiency. In particular we describe several Bell inequalities which appear to be optimal with respect to…

In this paper, we study the asymptotic performance of Abelian group codes for the lossy source coding problem for arbitrary discrete (finite alphabet) memoryless sources as well as the channel coding problem for arbitrary discrete (finite…

By exploiting the geometry of involutions in $N_\circ^\circ$-groups of finite Morley rank, we show that any simple group of Morley rank $5$ is a bad group all of whose proper definable connected subgroups are nilpotent of rank at most $2$.…

In this paper we study some open questions related to the smallest order $f({\cal C},\lnot {\cal H})$ of a 4-regular graph which has a connectivity property ${{\cal C}}$ but does not have a hamiltonian property ${\cal H}$. In particular,…

In recent work, we developed a method to construct invertible and non-invertible symmetries of finite-group gauge theories as topological domain walls on the lattice. In the present work, we consider abelian and non-abelian finite-group…

Linear codes have attracted considerable attention in coding theory and cryptography due to their significant applications in secret sharing schemes, secure two-party computation, Galois geometries, among others. As two special subclasses…

The principal character of a representation of the free group of rank two into PSL(2, C) is a triple of complex numbers that determines an irreducible representation uniquely up to conjugacy. It is a central problem in the geometry of…

Let $p$ be a prime and let $P$ be a Sylow $p$-subgroup of a finite nonabelian group $G$. Let $bcl(G)$ be the size of the largest conjugacy class of the group $G$. We show that $|P/O_p(G)| < bcl(G)$ if $G$ is not abelian.

In this paper we show that a finite nonabelian characteristically simple group G satisfying n = |\pi(G)|+2 if and only if G is isomorphic to A5, where n is the number of isomorphism classes of derived subgroups of G and \pi(G) is the set of…

A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…

In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…

For a finite group $G$, the size of a minimum generating set of $G$ is denoted by $d(G)$. Given a finite group $G$ and an integer $k$, deciding if $d(G)\leq k$ is known as the minimum generating set (MIN-GEN) problem. A group $G$ of order…