Related papers: Blocks in Finite Hyperfields
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…
For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…
We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…
Quantum symmetric algebras (or noncommutative polynomial rings) arise in many places in mathematics. In this article we find the multiplicative structure of their Hochschild cohomology when the coefficients are in an arbitrary bimodule…
We consider residue structures $R/G$ where $(G,+)$ is an additive subgroup of a ring $(R,+,\cdot)$, not necessarily an ideal. Special instances include Krasner's construction of quotient hyperfields, and Pumpluen's construction of…
We generalize results of Hattori on the topology of complements of hyperplane arrangements, from the class of generic arrangements, to the much broader class of hypersolvable arrangements. We show that the higher homotopy groups of the…
In this paper we study fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. To prepare the ground, we define various types of subhypergraphs, as…
We establish a general theory for projective dimensions of the logarithmic derivation modules of hyperplane arrangements. That includes the addition-deletion and restriction theorem, Yoshinaga-type result, and the division theorem for…
We study real hyperfields, focusing in particular on those that are finite with cyclic positive cones. All real hyperfields have characteristic zero, although they can still be classified using the C-characteristic, an invariant that…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
With this paper, we gain a better understanding of the set of near-field structures on a fixed scalar group. If we were able to describe all near-field structures on a fixed scalar group, we could describe all near-vector spaces. The…
Hive plots are a graph visualization style placing vertices on a set of radial axes emanating from a common center and drawing edges as smooth curves connecting their respective endpoints. In previous work on hive plots, assignment to an…
Models for topological quantum computation are based on braiding and fusing anyons (quasiparticles of fractional statistics) in (2+1)-D. The anyons that can exist in a physical theory are determined by the symmetry group of the Hamiltonian.…
In this short research note we obtain a reduction theorem for the non-vanishing of the first Hochschild cohomology of block algebras of finite groups with non-trivial defect groups. Along the way we investigate this problem for the blocks…
Higher-order networks, naturally described as hypergraphs, are essential for modeling real-world systems involving interactions among three or more entities. Stochastic block models offer a principled framework for characterizing mesoscale…
Higher bundles are homotopy coherent generalisations of classical fibre bundles. They appear in numerous contexts in geometry, topology and physics. In particular, higher principal bundles provide the geometric framework for higher-group…
In the time evolution of fluids, the topologies of fluids can be changed by the creations and annihilations of singular points and by switching combinatorial structures of separatrices. In this paper, to describe the possible generic time…
Hyperplane arrangements form the latest addition to the zoo of combinatorial objects dealt with by polymake. We report on their implementation and on a algorithm to compute the associated cell decomposition. The implemented algorithm…
Hypergraphs, which belong to the family of higher-order networks, are a natural and powerful choice for modeling group interactions in the real world. For example, when modeling collaboration networks, which may involve not just two but…
In a series of recent contributions on the notion of global breadth $\mathbf{B}(G)$ of a finite group $G$, it was interesting to observe the structural conditions arising from the classification of finite groups of $\mathbf{B}(G)=8$. This…