相关论文: Finite basis problems for stalactic, taiga, sylves…
We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…
A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…
We describe a practical algorithm for computing normal forms for semigroups and monoids with finite presentations satisfying so-called small overlap conditions. Small overlap conditions are natural conditions on the relations in a…
The sets of all neutral, distributive and lower-modular elements of the lattice of semigroup varieties are finite, countably infinite and uncountably infinite, respectively. In 2018, we established that there are precisely three neutral…
In this note we establish some connections between the theory of self-similar fractals in the sense of John E. Hutchinson (cf. [3]) and the theory of boundary quotients of $C^\ast$-algebras associated to monoids. Although we must leave…
Stable surfaces and their log analogues are the type of varieties naturally occuring as boundary points in moduli spaces. We extend classical results of Kodaira and Bombieri to this more general setting: if $(X,\Delta)$ is a stable log…
We introduce stability conditions (in the sense of King) for representable modules of continuous quivers of type A along with a special criteria called the four point condition. The stability conditions are defined using a generalization of…
This work is dedicated to the results were got in the model theory of the regular polygons. We give the characterization of the monoids with axiomatizable and model complete class of regular polygons. We describe the monoids with complete…
We study semi-stable degenerations of toric varieties determined by certain partitions of their moment polytopes. Analyzing their defining equations we prove a property of uniqueness.
For the planar four-vortex problem, we show that there are finitely many stationary configurations consisting of equilibria, rigidly translating configurations, relative equilibria (uniformly rotating configurations) and collapse…
A finite non-degenerate set-theoretic solution $(X,r)$ of the Yang-Baxter equation gives rise to a structure skew brace $B(X,r)$ that is a $\lambda_f$-skew brace, i.e. every element has finitely many $\lambda$-images, and whose additive…
Many important stable matching problems are known to be NP-hard, even when strong restrictions are placed on the input. In this paper we seek to identify structural properties of instances of stable matching problems which will allow us to…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…
We investigate the notion of soficity for monoids. A group is sofic as a group if and only if it is sofic as a monoid. All finite monoids, all commutative monoids, all free monoids, all cancellative one-sided amenable monoids, all…
Rigged configurations are combinatorial objects prominent in the study of solvable lattice models. Marginally large tableaux are semi-standard Young tableaux of special form that give a realization of the crystals ${\cal B}(\infty)$. We…
The Sylvester equation $AX-XB=C$ is considered in the setting of quaternion matrices. Conditions that are necessary and sufficient for the existence of a unique solution are well-known. We study the complementary case where the equation…
We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…
Given a pure, full-dimensional, locally strongly connected polyhedral complex C with convex support, we characterize, by a local codimension-2 condition, polyhedral complexes that coarsen C. The proof of the characterization draws upon a…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…