Related papers: Minimal signatures with undecidability of represen…

The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding selected preferences. We argue that the property of minimality…

The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

Tree tensor network descriptions of critical quantum spin chains are empirically known to reproduce correlation functions matching CFT predictions in the continuum limit. It is natural to seek a more complete correspondence, additionally…

Heisenberg-Robertson's uncertainty relation expresses a limitation in the possible preparations of the system by giving a lower bound to the product of the variances of two observables in terms of their commutator. Notably, it does not…

Let $X$ be a nonempty set and $X^{2}$ be the Cartesian square of $X$. Some semigroups of binary relations generated partitions of $X^2$ are studied. In particular, the algebraic structure of semigroups generated by the finest partition of…

We study the representation theory of the infinite type A Hecke algebra over a non-archimedean field in the case where the parameter is a pseudo-uniformizer. Specifically, we consider a family of representations, called almost-symmetric,…

We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…

We consider $48$ parastrophically uncancellable quadratic functional equations with four object variables and two quasigroup operations in two classes: balanced non--Belousov (consists of 16 equations) and non--balanced non--gemini…

Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…

A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…

We describe the representations of $(2,n)$-semigroups, i.e. groupoids with $n$ binary associative operations, by partial $n$-place functions and prove that any such representation is a union of some family of representations induced by…

A permutation group is said to be quasiregular if every its transitive constituent is regular, and a quasiregular coherent configuration can be thought as a combinatorial analog of such a group: the transitive constituents are replaced by…

We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger…

Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with usual acceptance conditions, such as the B\"uchi and Muller ones [1]. It was proved…

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…

Let $W,W'\subseteq G$ be nonempty subsets in an arbitrary group $G$. The set $W'$ is said to be a complement to $W$ if $WW'=G$ and it is minimal if no proper subset of $W'$ is a complement to $W$. We show that, if $W$ is finite then every…

Let $G$ be a finite solvable or symmetric group and let $B$ be a $2$-block of $G$. We construct a canonical correspondence between the irreducible characters of height zero in $B$ and those in its Brauer first main correspondent. For…

Generators and relations are given for the subalgebra of cocommutative elements in the quantized coordinate rings of the classical groups, where the deformation parameter q is transcendental. This is a ring theoretic formulation of the well…