Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0511653

Representations of Menger $(2,n)$-semigroups by multiplace functions

Wieslaw A. Dudek·Valentin S. Trokhimenko
View original source ↗Read source document ↗Export metadata ↓

Abstract

Investigation of partial multiplace functions by algebraic methods plays an important role in modern mathematics were we consider various operations on sets of functions, which are naturally defined. The basic operation for $n$-place functions is an $(n+1)$-ary superposition $[ ]$, but there are some other naturally defined operations, which are also worth of consideration. In this paper we consider binary Mann's compositions $\op{1},...,\op{n}$ for partial $n$-place functions, which have many important applications for the study of binary and $n$-ary operations. We present methods of representations of such algebras by $n$-place functions and find an abstract characterization of the set of $n$-place functions closed with respect to the set-theoretic inclusion.

Explore related subjects

math.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wieslaw A. Dudek, Valentin S. Trokhimenko. 2005-11-27. Representations of Menger $(2,n)$-semigroups by multiplace functions. https://doi.org/10.1080/00927870500346255

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Constructive recurrences for determinants and permanents of banded Toeplitz matrices

For fixed nonnegative integers $m_1,m_2$, let $A_n=(a_{j-i})_{i,j=1}^n$ be the leading $n\times n$ section of a Toeplitz matrix with lower and upper semibandwidths $m_1$ and $m_2$. We give two constructive Laplace-expansion methods for scalar recurrences of $\det A_n$ and $\perm A_n$. The increasing-rows method eliminates a fixed family of boundary cofactors and gives recurrence order at most $d=\binom{m_1+m_2}{m_1}$ for both sequences. The row-column method closes normalized boundary minors recursively and packages them in a sparse transfer matrix. Its reachable states are classified exactly: level $j$ is indexed by a pair of $j$-subsets of $[m_1]$ and $[m_2]$. Hence the transfer dimension is $d$, and we obtain an explicit formula for the number of nonzero transitions. For determinants, the complementary cofactors of the increasing-rows construction are coordinates of the classical compound companion representation. The independently constructed row-column transfer has the Widom characteristic polynomial and is generically similar to the compound transfer. Thus the order $d$ recurrence is generically minimal for the unrestricted fixed-band determinant family. For permanents the same state graph gives the binomial upper bound, without a general minimality claim. The pentadiagonal case recovers Sweet's order-six determinant recurrence and its permanent analogue, while the one-superdiagonal family gives closed scalar recurrences and rational generating functions. Position-dependent band weights preserve the finite state graph but replace the constant transfer by a cocycle. For cyclic determinants, Fourier diagonalization produces all subset products of the symbol roots and a generically minimal annihilator of degree $2^{m_1+m_2}$, corresponding to the passage from one exterior degree to the full exterior algebra.

math.RA↗
arXiv2026

Dedekind Poisson Algebras over Arbitrary Fields

We study Poisson algebras in which every Poisson subalgebra is a Poisson ideal, called Dedekind Poisson algebras, over arbitrary fields and without any finite-dimensionality assumption. In characteristic different from 2, combining the two operations by $x*y=xy+[x,y]$ connects the problem with Outcalt's classical classification of power-associative H-algebras and yields the same structural type. We obtain a complete classification by a direct two-operation argument valid in every characteristic. This approach also shows that characteristic 2 retains additional Poisson information which cannot be recovered from the single product $*$.

math.RA↗
arXiv2026

On the Structure of Low-Dimensional Poisson Algebras over Arbitrary Fields

We investigate the structure of Poisson algebras of dimensions at most three over an arbitrary field. Our approach is based on the internal structure of the associated commutative associative and Lie algebras, with particular emphasis on the associative square $P^2$, the derived Lie algebra $[P,P]$, the Lie center, the associative annihilator, idempotents, ideals and decomposability. We obtain a complete classification in dimensions one and two and give a structural classification in dimension three. In dimension two, we prove that the associative and Lie multiplications cannot be simultaneously non-zero. In dimension three, the classification is organized according to the dimension and position of the derived Lie algebra and, in the case of trivial Lie multiplication, according to the dimension of $P^2$. The arbitrary-field setting leads to phenomena which do not occur over the complex field. In particular, quadratic and cubic field extensions appear naturally in the classification, some families depend on equivalence classes of symmetric bilinear forms and on the structure of three-dimensional Lie algebras over the ground field, and characteristic $2$ gives an additional family of Poisson algebras with both multiplications non-zero. Over the complex field, the resulting classification specializes, up to changes of basis and notation, to the known classifications in dimensions at most three.

math.RA↗