Related papers: Partial Geometric Designs from Group Actions
We give a general procedure for constructing metric spaces from systems of partitions. This generalises and provides analogues of Sageev's construction of dual CAT(0) cube complexes for the settings of hyperbolic and injective metric…
We initiate the study of group actions on (possibly infinite) semimatroids and geometric semilattices. To every such action is naturally associated an orbit-counting function, a two-variable "Tutte" polynomial and a poset which, in the…
In this paper we present algorithms for collective construction systems in which a large number of autonomous mobile robots trans- port modular building elements to construct a desired structure. We focus on building block structures…
Given a residually connected incidence geometry $\Gamma$ that satisfies two conditions, denoted $(B_1)$ and $(B_2)$, we construct a new geometry $H(\Gamma)$ with properties similar to those of $\Gamma$. This new geometry $H(\Gamma)$ is…
We introduce an algorithm for designing Neural Group Actions, collections of deep neural network architectures which model symmetric transformations satisfying the laws of a given finite group. This generalizes involutive neural networks…
We study linearization models for continuous one-parameter semigroups of parabolic type. In particular, we introduce new limit schemes to obtain solutions of Abel's functional equation and to study asymptotic behavior of such semigroups.…
We consider the set of ($n\times n\times n$) cubic stochastic matrices of type (1,2) together with different multiplication rules that not only retain their stochastic properties but also endow this set with an associative semigroup…
In this work, we give a survey of recent developments in the theory of partial actions of groups and Hopf algebras.
The obvious way to construct a GDD (group-divisible design) recursively is to use Wilson's Fundamental Construction for GDDs (WFC). Then a PBD (pairwise balanced design) is often obtained by adding a new point to each group of the GDD.…
This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…
We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and improved estimates on the smallest field sizes over which such…
Using the slow triangle map (a type of multi-dimensional continued fraction algorithm), we exhibit a method for generating any number of new identities for subsets of integer partitions.
We study equivariant morphisms from zero dimensional schemes to varieties and show that, under suitable assumptions, all such morphisms factor via a canonical one. We relate the above to Algebraic Representations of Ergodic Actions.
Rectangular designs are classified as regular, Latin regular, semiregular, Latin semiregular and singular designs. Some series of selfdual as well as alpharesolvable designs are obtained using matrix approaches which belong to the above…
The fractionalization of global symmetry charges is a striking hallmark of topological quantum order. Here, we discuss the fractionalization of subsystem symmetries in two-dimensional topological phases. In line with previous no-go…
Graphical (Linear) Algebra is a family of diagrammatic languages allowing to reason about different kinds of subsets of vector spaces compositionally. It has been used to model various application domains, from signal-flow graphs to Petri…
Uninorms play a prominent role both in the theory and the applications of Aggregations and Fuzzy Logic. In this paper the class of group-like uninorms is introduced and characterized. First, two variants of a general construction -- called…
In this paper, we define the notion of crossed modules of groups with action and investigate related structures. Functions for computing of these structures have been written using the GAP computational discrete algebra programming…
We consider a generalization of the notion of partially balanced incomplete block designs (PBIBDs), by relaxing the requirement that the underlying association scheme be commutative. An infinite family of such generalizations is…
We provide a superselection theory of symmetry defects in 2+1D symmetry enriched topological (SET) order in the infinite volume setting. For a finite symmetry group $G$ with a unitary on-site action, our formalism produces a $G$-crossed…