Related papers: Documentation for the GAP code file OrbOrd.txt
To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…
It is known that it is a very restrictive condition for a frame $\{f_k\}_{k=1}^\infty$ to have a representation $ \{T^n \varphi\}_{n=0}^\infty$ as the orbit of a bounded operator $T$ under a single generator $\varphi\in\mathcal{H}.$ In this…
In this paper we characterize the orbit codes as geometrically uniform codes. This characterization is based on the description of all isometries over a projective geometry. In addition, the Abelian orbit codes are defined and a new…
The package numericalsgps performs computations with and for numerical semigroups. Recently also affine semigroups are admitted as objects for calculations. This manuscript is a survey of what the package does, and at the same time of the…
In this paper, we consider the problem of efficiently representing a set $S$ of $n$ items out of a universe $U=\{0,...,u-1\}$ while supporting a number of operations on it. Let $G=g_1...g_n$ be the gap stream associated with $S$, $gap$ its…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
The orbit polytope for a finite group G acting linearly and freely on a sphere S is used to construct a cellularized fundamental domain for the action. A resolution of the integers over G results from the associated G-equivariant…
An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…
OrbDot is a Python package for studying the secular (long-term) evolution of exoplanet orbits from observational data. It employs nested sampling algorithms to fit evolutionary models to any combination of transit and eclipse mid-times,…
The complexity of representing a polynomial by a Read-Once Oblivious Algebraic Branching Program (ROABP) is highly dependent on the chosen variable ordering. Bhargava et al. prove that finding the optimal ordering is NP-hard, and provide…
These are expanded lecture notes of a series of expository talks surveying basic aspects of group cohomology and homology. They were written for someone who has had a first course in graduate algebra but no background in cohomology. You…
We define a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the state-activity growth. This hierarchy extends that given by Sidki for automaton groups, and also…
We introduce the notion of expandability in the context of automaton semigroups and groups: a word is k-expandable if one can append a suffix to it such that the size of the orbit under the action of the automaton increases by at least k.…
Proving super-polynomial size lower bounds for syntactic multilinear Algebraic Branching Programs(smABPs) computing an explicit polynomial is a challenging problem in Algebraic Complexity Theory. The order in which variables in…
We construct a topology on the standard Hilbert module $l^2(\mathcal A)$ over a unital $W^*$-algebra $\mathcal A$ such that any "compact" operator, (i.e.\ any operator in the norm closure of the linear span of the operators of the form…
Let $G$ be a simple algebraic group and $\mathcal O$ a nilpotent orbit in $\mathfrak g$. Let ${\mathbf{CS}}(\mathcal O)$ denote the affine cone over the secant variety of $\overline{\mathbb P\mathcal O}\subset \mathbb P\mathfrak g$. Using…
A simple way of computing the Ap\'ery set of a numerical semigroup (or monoid) with respect to a generator, using Groebner bases, is presented, together with a generalization for affine semigroups. This computation allows us to calculate…
We give an accessible and modern description of the automorphisms of a finite abelian group $G$. Included is an explicit formula for the cardinality of $Aut(G)$.