Related papers: Universal $p$-ary designs

We show that the eigenpolytopes of graphs are universal in the sense that every polytope, up to affine equivalence, appears as the eigenpolytope of some positively weighted graph. We next extend the theory of graphical designs, which are…

We outline a general strategy developed for the analysis of critical models, which we apply to obtain a heuristic classification of all universality classes with up to three field-theoretical scalar order parameters in $d=6-\epsilon$…

The use of double groupoids and their associated double Lie algebroids and characteristic distributions is proposed for the description and analysis of continuous media that carry two different constitutive or geometric structures. Various…

A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…

We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…

The purpose of this paper is to investigate the global categorical symmetries that arise when gauging finite higher groups in three or more dimensions. The motivation is to provide a common perspective on constructions of non-invertible…

This paper generalizes a theorem of Hida on the structure of ordinary representations on unitary groups to $P$-ordinary representations, where $P$ is a general parabolic subgroup of some general linear group. When $P$ is minimal, we recover…

Pursuing a generalization of group symmetries of modular categories to category symmetries in topological phases of matter, we study linear Hopf monads. The main goal is a generalization of extension and gauging group symmetries to category…

Over fields of characteristic zero, there are well known constructions of the irreducible representations, due to A Young, and of irreducible modules, called Specht modules, due to W Specht, for the symmetric groups $S_{n}$ which are based…

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…

Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…

In this paper we study a certain generalization of combinatorial designs related to almost difference sets, namely the $t$-adesign, which was coined by Cunsheng Ding in 2015. It is clear that $2$-adesigns are a kind of partially balanced…

Isaak Moiseevich Yaglom deduced complete classification of geometric spaces. In this work, supposed to your attention, author formalizes Yaglom's approach and constructs uniform theory of geometric spaces on analytic level. Among its…

Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…

We study criteria for a ring - or more generally, for a small category - to be Gorenstein and for a module over it to be of finite projective dimension. The goal is to unify the universal coefficient theorems found in the literature and to…

For any $n$-ary associative algebra we construct a $\Z_{n-1}$ graded algebra, which is a universal object containing the $n$-ary algebra as a subspace of elements of degree 1. Similar construction is carried out for semigroups.

In the present paper, complete designs of graphs are considered. The notion of (regular) sampling is introduced and analyzed in detail, showing that the trivial necessary condition for its existence is actually sufficient. Some examples are…

We construct the irreducible unipotent modules of the finite general linear groups using tableaux. Our construction is analogous to that of James (1976) for the symmetric groups, answering an open question as to whether such a construction…

Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…

We generalize parts of the theory of associative geometries developed by Kinyon and the author in the framework of universal algebra: we prove that certain associoid structures, such as pregroupoids and principal equivalence relations, have…