Related papers: On irreducible algebraic sets over linearly ordere…
Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
In the current paper we study extremal semilattices with respect to their equational properties. In the class $\mathbf{S}_n$ of all semilattices of order $n$ we find semilattices which have maximal (minimal) number of consistent equations.…
We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…
Criteria are given for determining whether an irreducible sextic equation with rational coefficients is algebraically solvable over the complex numbers.
We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…
For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…
We classify the irreducible components of the Hilbert scheme of $n$ points on non-reduced algebraic plane curves, and give a formula for the multiplicities of the irreducible components. The irreducible components are indexed by partitions…
We describe a natural generalization of irreducibility in order lattices with arbitrary metrics. We analyse the special cases of valuation metrics and more general metrics for lattices. This article is mainly based on a part of the author's…
We characterize numerical semigroups for which the poset of its ideal class monoid is a lattice, and study the irreducible elements of such a lattice with respect to union, intersection, infimum and supremum.
We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…
We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.
In this paper, we study equations over Brandt semigroup $B_n$. We compute that the number of unsolvable equations in one variable asymptotically equals $\frac{2}{n^2}$, and the average number of solutions of these equations asymptotically…
We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.
We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.
In this article we introduce the study of the number of pairs of non-comparable elements in a distributive lattice $\L$. We give several tight lower and upper bounds for the number and give as an application the lattices precisely for which…
We classify order $3$ linear difference operators over $\mathbb{C}(x)$ that are solvable in terms of lower order difference operators. To prove this result, we introduce the notion of absolute irreducibility for difference modules, and…
We study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix…
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.