Related papers: An Algebraic Geometric Approach to Nivat's Conject…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
A generalization of the semisimplicity concept for polyadic algebraic structures is proposed. If semisimple structures can be presented in block diagonal matrix form (resulting in the Wedderburn decomposition), a general form of polyadic…
In this note, we initiate a study of the finite-dimensional representation theory of a class of algebras that correspond to noncommutative deformations of compact surfaces of arbitrary genus. Low dimensional representations are investigated…
We give a criterion for the existence of a non-degenerate quasihomogeneous polynomial in a configuration, i.e. in the space of polynomials with a fixed set of weights, and clarify the relation of this criterion to the necessary condition…
We give an algebraic characterization of when a $d$-dimensional periodic framework has no non-trivial, symmetry preserving, motion for any choice of periodicity lattice. Our condition is decidable, and we provide a simple algorithm that…
Configuration spaces of many real mechanical systems appear to be manifolds with singularity. A singularity often indicates that geometry of motion may change at the singular point of configuration space. We face conceptual problem…
We prove the result in the title. We infer, that unlike cylindric algebras, there is a first order axiomatization of the class of completely representable polyadic algebras of infinite dimension, though the one we obtain is infinite; in…
We study complexity and periodicity of Delone sets by applying an algebraic approach to multidimensional symbolic dynamics. In this algebraic approach, $\mathbb{Z}^d$-configurations $c: \mathbb{Z}^d \to \mathcal{A}$ for a finite set…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…
This article surveys results on graded algebras and their Hilbert series. We give simple constructions of finitely generated graded associative algebras $R$ with Hilbert series $H(R,t)$ very close to an arbitrary power series $a(t)$ with…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
The type and several invariant subspaces related to the upper annihilating series of finite-dimensional nilpotent evolution algebras are introduced. These invariants can be easily computed from any natural basis. Some families of nilpotent…
In this paper, we prove the following non-linear generalization of the classical Sylvester-Gallai theorem. Let $\mathbb{K}$ be an algebraically closed field of characteristic $0$, and $\mathcal{F}=\{F_1,\cdots,F_m\} \subset…
We establish vanishing results for the first cohomology group of nilpotent groups and Lie rings when the submodule of invariants is trivial. Our results are obtained within a model-theoretic setting, namely for structures that are definable…
Polynomial reduction is one of the main tools in computational algebra with innumerable applications in many areas, both pure and applied. Since many years both the theory and an efficient design of the related algorithm have been solidly…
Let $V$ be a two-dimensional vector space over a field $\mathbb F$ of characteristic not $2$ or $3$. We show there is a canonical surjection $\nu$ from the set of suitably generic commutative algebra structures on $V$ modulo the action of…
We introduce a term algebra as a new formal specification language for the coordinating architectures of distributed systems consisting of a finite yet unbounded number of components. The language allows to describe infinite sets of systems…
The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…
In the algebraic metacomplexity framework we prove that the decomposition of metapolynomials into their isotypic components can be implemented efficiently, namely with only a quasipolynomial blowup in the circuit size. We use this to…