Related papers: The Profile of relations
Riemann surfaces which are set by algebraic, algebroid and inverse functions are considered. A method for describing these Riemann surfaces by graphs is proposed. Each such Riemann surface is assigned to a special type of graph - profile.…
We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram…
The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…
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…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
In this paper, we describe the structure of finite groups whose element orders or proper (abelian) subgroup orders form an arithmetic progression of ratio $r\geq 2$. This extends the case $r=1$ studied in previous papers \cite{1,8,4}.
The calculation of realistic N-body wave functions for identical fermions is still an open problem in physics, chemistry, and materials science, even for N as small as two. A recently discovered fundamental algebraic structure of many-body…
We consider frames F in a given Hilbert space, and we show that every F may be obtained in a constructive way from a reproducing kernel and an orthonormal basis in an ambient Hilbert space. The construction is operator-theoretic, building…
The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
Categories of relations over a regular category form a family of models of quantum theory. Using regular logic, many properties of relations over sets lift to these models, including the correspondence between Frobenius structures and…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
We generalize the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative setting, where "varieties" carry a PGL_n-action, regular…
We study almost reverse lexicographic ideals in a polynomial ring over a field of arbitrary characteristic. We give a criterion for a given sequence of nonnegative integers to be the Hilbert function of an almost reverse lexicographic ideal…
Let $\mathfrak{h}_3$ be the Heisenberg algebra and let $\mathfrak g$ be the 3-dimensional Lie algebra having $[e_1,e_2]=e_1\,(=-[e_2,e_1])$ as its only non-zero commutation relations. We describe the closure of the orbit of a vector of…
Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…
The commutative semiring $\mathbf{D}$ of finite, discrete-time dynamical systems was introduced in order to study their (de)composition from an algebraic point of view. However, many decision problems related to solving polynomial equations…
We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…
Isoperimetric profile in algebras was first introduced by Gromov. We study the behavior of the isoperimetric profile under various ring theoretic constructions and its relation with the Gelfand-Kirillov dimension.
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…