Related papers: The column group and its link invariants
We generalize the concept of Pascal matrices to matrices associated with sets of points by considering multidimensional binomial coefficients as entries. We study their properties and prove that the infinite matrix associated with the set…
We consider an homogeneous action of a finite group on a free linear category over a field in order to prove that the subcategory of invariants is still free. Moreover we show that the representation type is preserved when considering…
A binary operation on any set induces a binary operation on its subsets. We explore families of subsets of a group that become a group under the induced operation and refer to such families as power groups of the given group. Our results…
The problem of extracting a well conditioned submatrix from any rectangular matrix (with normalized columns) has been studied for some time in functional and harmonic analysis; see…
The category of I-spaces is the diagram category of spaces indexed by finite sets and injections. This is a symmetric monoidal category whose commutative monoids model all E-infinity spaces. Working in the category of I-spaces enables us to…
In this article we analyze the structure of the semigroup of inner perturbations in noncommutative geometry. This perturbation semigroup is associated to a unital associative *-algebra and extends the group of unitary elements of this…
Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…
We enhance the biquandle counting invariant using elements of truncated biquandle-labeled Polyak algebras. These finite type enhancements reduce to the finite type enhancements defined by Goussarov, Polyak and Viro for the trivial biquandle…
Topological order in two-dimensional systems is studied by combining the braid group formalism with a gauge invariance analysis. We show that flux insertions (or large gauge transformations) pertinent to the toroidal topology induce…
We define a sequence of integer-valued invariants $\gamma^k(L)$ for a $3$-component link $L$. We prove that the resulting $\gamma$-invariants are invariant under concordance, and more generally under weak cobordism, and that they lift…
A group G is called bounded if every conjugation-invariant norm on G has finite diameter. We introduce various strengthenings of this property and investigate them in several classes of groups including semisimple Lie groups, arithmetic…
We describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in terms of memory use and even of arithmetic, than permuattion and…
Many "good" topologies for interconnection networks are based on line digraphs of regular digraphs. These digraphs support unitary matrices. We propose the property "being the digraph of a unitary matrix" as additional criterion for the…
In this paper the algebra of invariants for the adjoint action of the unitriangular group in the nilradical of a parabolic subalgebra is studied. We prove that the algebra of invariants is finitely generated.
A group-category is an additively semisimple category with a monoidal product structure in which the simple objects are invertible. For example in the category of representations of a group, 1-dimensional representations are the invertible…
We give an explicit handy (and cocycle-free) description of the groupoid of weak maps between two crossed-modules in terms of certain digrams of groups which we we call a {\em butterflies}. We define composition of butterflies and this way…
We present a constructive recognition algorithm to decide whether a given black-box group is isomorphic to an alternating or a symmetric group without prior knowledge of the degree. This eliminates the major gap in known algorithms, as they…
We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…
Easy quantum groups are compact matrix quantum groups, whose intertwiner spaces are given by the combinatorics of categories of partitions. This class contains the symmetric group and the orthogonal group as well as Wang's quantum…
We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…