Related papers: Arity hierarchies for quantifiers closed under par…

We study Lindstrom quantifiers that satisfy certain closure properties which are motivated by the study of polymorphisms in the context of constraint satisfaction problems (CSP). When the algebra of polymorphisms of a finite structure B…

This article develops a comprehensive theory of multiary graded polyadic algebras, extending the classical concept of group-graded algebras to higher-arity structures. We introduce the notion of grading by multiary groups and investigate…

We study the expressive power of fragments of inclusion logic under the so-called lax team semantics. The fragments are defined either by restricting the number of universal quantifiers or the arity of inclusion atoms in formulae. In case…

The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynomial-time computable and bisimulation-invariant queries on…

We develop a general framework for studying signatures, presentations, and algebraic colimits of enriched monads for a subcategory of arities, even when the base of enrichment $\mathcal{V}$ is not locally presentable. When $\mathcal{V}$…

Let $K$ be a number field. We present several new finiteness results for isomorphism classes of abelian varieties over $K$ whose $\ell$-power torsion fields are arithmetically constrained for some rational prime $\ell$. Such arithmetic…

This paper introduces and systematically develops the theory of polyadic group rings, a higher arity generalization of classical group rings $\mathcal{R}[\mathsf{G}]$. We construct the fundamental operations of these structures, defining…

We introduce the concept of quantum polymorphisms to the complexity theory of quantum constraint satisfaction. Via this notion, we build an algebraic framework of reductions between quantum CSPs, and we establish a Galois connection between…

Concrete two-set (module-like and algebra-like) algebraic structures are investigated from the viewpoint that the initial arities of all operations are arbitrary. Relations between operations arising from the structure definitions, however,…

We study the problem of query evaluation on probabilistic graphs, namely, tuple-independent probabilistic databases over signatures of arity two. We focus on the class of queries closed under homomorphisms, or, equivalently, the infinite…

Polyadic systems and their representations are reviewed and a classification of general polyadic systems is presented. A new multiplace generalization of associativity preserving homomorphisms, a 'heteromorphism' which connects polyadic…

Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate…

We consider countable so-called rich subsemigroups of (\omega\omega,\circ); each such semigroup $T$ gives a variety CPEA_T that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of \omega-dimensional…

Given a K\"ahler manifold $X$ with an ample line bundle $L$, we consider the metric space of $L^1$ geodesic rays associated to the first Chern class $c_1(L)$. We characterize rays that can be approximated by ample test configurations. At…

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…

This article continues the study of concrete algebra-like structures in our polyadic approach, where the arities of all operations are initially taken as arbitrary, but the relations between them, the arity shapes, are to be found from some…

We introduce a polyadic analog of supersymmetry by considering the polyadization procedure (proposed by the author) applied to the toy model of one-dimensional supersymmetric quantum mechanics. The supercharges are generalized to polyadic…

The polynomial-time hierarchy ($\mathrm{PH}$) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as $\mathrm{PH}$ does not collapse). Here, we study whether two…

Algebraic structures in which the property of commutativity is substituted by the mediality property are introduced. We consider (associative) graded algebras and instead of almost commutativity (generalized commutativity or…

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…