Related papers: Some relational structures with polynomial growth …

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Let R be the polynomial ring in r variables over a field k, with maximal ideal M and let V denote a vector subspace of the space of degree-j homogeneous elements of R. We study three related algebras determined by V. The first is the…

A $G$-grading on a complex semisimple Lie algebra $L$, where $G$ is a finite abelian group, is called quasi-good if each homogeneous component is 1-dimensional and 0 is not in the support of the grading. Analogous to classical root systems,…

Let A be a finite dimensional algebra over a field of characteristic zero graded by a finite abelian group G. Here we study a growth function related to the graded polynomial identities satisfied by A by computing the exponential rate of…

We are discussing certain combinatorial and counting problems related to quadratic algebras. First we give examples which confirm the Anick conjecture on the minimal Hilbert series for algebras given by n generators and n(n-1)/2 relations…

In his work on P-partitions, Stembridge defined the algebra of peak functions Pi, which is both a subalgebra and a retraction of the algebra of quasi-symmetric functions. We show that Pi is closed under coproduct, and therefore a Hopf…

First some old as well as new results about P.I. algebras, Ore extensions, and degrees are presented. Then quantized $n\times r$ matrices as well as quantized factor algebras of $M_q(n)$ are analyzed. The latter are the quantized function…

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…

A relational structure is homomorphism-homogeneous if every homomorphism between finite substructures extends to an endomorphism of the structure. This notion was introduced recently by Cameron and Ne\v{s}et\v{r}il. In this paper we…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

Let F(R^n) be the algebra of Fourier transforms of functions from L_1(R^n), K(R^n) be the algebra of Fourier transforms of bounded complex Borel measures in R^n and W be Wiener algebra of continuous 2pi-periodic functions with absolutely…

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

In this paper we study the Hilbert function of $\gr_{\mathfrak{m}}(R)$, when $R$ is a numerical semigroup ring or, equivalently, the coordinate ring of a monomial curve. In particular, we prove a sufficient condition for a numerical…

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

Piecewise quasipolynomial growth of Presburger counting functions combines with tame persistent homology module theory to conclude piecewise quasipolynomial behavior of constructible families of finely graded modules over constructible…

We consider the question of which semigroups can occur as the semigroup $S_R(\nu)$ of positive values of a rank 1 valuation dominating a Noetherian local ring $R$. We give a number of bounds of polynomial type on the growth of…

We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…