Related papers: On the clone of aggregation functions on bounded l…
In this paper, we study the combinatorics of a certain minimal factorization of the elements in a finite lattice $L$ called the canonical join representation. The join $\bigvee A =w$ is the canonical join representation of $w$ if $A$ is the…
We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…
We study unary parts of centraliser clones on the set $\{0,1,2,3\}$, so-called centralising monoids. We describe and count all centralising monoids on the set $\{0,1,2,3\}$ having majority operations as witnesses, and we list the inclusion…
We develop a new general framework for algebras and clones, called Universal Clone Algebra. Algebras and clones of finitary operations are to Universal Algebra what t-algebras and clone algebras are to Universal Clone Algebra. Clone…
We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method,…
Aggregation functions are widely used in answer set programming for representing and reasoning on knowledge involving sets of objects collectively. Current implementations simplify the structure of programs in order to optimize the overall…
We give several characterizations of discrete Sugeno integrals over bounded distributive lattices, as particular cases of lattice polynomial functions, that is, functions which can be represented in the language of bounded lattices using…
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…
The zeta function of an integral lattice $\Lambda$ is the generating function $\zeta_{\Lambda}(s) = \sum\limits_{n=0}^{\infty} a_n n^{-s}$, whose coefficients count the number of left ideals of $\Lambda$ of index $n$. We derive a formula…
We argue that it makes sense to talk about ``typical'' properties of lattices, and then show that there is, up to isomorphism, a unique countable lattice L* (the Fraisse limit of the class of finite lattices) that has all ``typical''…
We show that the partition function of all classical spin models, including all discrete Standard Statistical Models and all abelian discrete Lattice Gauge Theories (LGTs), can be expressed as a special instance of the partition function of…
While studying some properties of linear operators in a Euclidean Jordan algebra, Gowda, Sznajder and Tao have introduced generalized lattice operations based on the projection onto the cone of squares. In two recent papers of the authors…
The Scarf complex for lattices is well understood and utilized. In 2014, the author expanded the use of the term Scarf complex to encompass an infinite set in $\mathbb{Z}^n$ that was generated via an action of a lattice…
This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and whose elements are pairs consisting of a subset and a…
We prove that an infinite (bounded) involution lattice and even pseudo--Kleene algebra can have any number of congruences between $2$ and its number of elements or equalling its number of subsets, regardless of whether it has as many ideals…
This work considers lattice walks restricted to the quarter plane, with steps taken from a set of cardinality three. We present a complete classification of the generating functions of these walks with respect to the classes algebraic,…
Joint alignment of a collection of functions is the process of independently transforming the functions so that they appear more similar to each other. Typically, such unsupervised alignment algorithms fail when presented with complex data…
In a previous paper {GN2} an effective solution of the lattice point counting problem in general domains in semisimple S-algebraic groups and affine symmetric varieties was established. The method relies on the mean ergodic theorem for the…
The purpose of this paper is to develop the theory of holomorphic functions with modulus bounded by $1$ on the symmetrized skew bidisc \[ \mathbb{G}_{r} \stackrel{\rm def}{=} \Big\{( \lambda_{1}+r\lambda_{2} ,r\lambda_{1}\lambda_{2}):…
Given an integer $M\geq 2$, we deploy the generating function techniques to compute the number of $M$-th roots of identity in some of the well-known finite groups of Lie type, more precisely for finite general linear groups, symplectic…