Related papers: On the clone of aggregation functions on bounded l…
In this paper we study projective algebras in varieties of (bounded) commutative integral residuated lattices from an algebraic (as opposed to categorical) point of view. In particular we use a well-established construction in residuated…
This work proves that the process of gluing finite lattices to form a larger lattice is bijective, that is each lattice is the glued sum of a unique system of finite lattices, provided the class of lattices is constrained to modular,…
We consider paths in the plane with $(1,0),$ $(0,1),$ and $(a,b)$-steps that start at the origin, end at height $n,$ and stay to the left of a given non-decreasing right boundary. We show that if the boundary is periodic and has slope at…
We recall the main types of lattice paths, which are sequences in the lattice of integer coordinates points in the plane. We start with the fundamental central lattice paths and Dyck paths and proceed in elementary terms through recently…
Formulae of the Lambek calculus are constructed using three binary connectives, multiplication and two divisions. We extend it using a unary connective, positive Kleene iteration. For this new operation, following its natural…
Best possible bounds are obtained for the concentration function of an additive arithmetic function on sequences of shifted primes.
We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain…
A non-perturbative algebraic theory of lattice Boltzmann method is developed based on a symmetry of a product. It involves three steps: (i) Derivation of admissible lattices in one spatial dimension through a matching condition which…
We investigate the community detection problem on graphs in the existence of multiple edge types. Our main motivation is that similarity between objects can be defined by many different metrics and aggregation of these metrics into a single…
Lame equation arises from deriving Laplace equation in ellipsoidal coordinates; in other words, it's called ellipsoidal harmonic equation. Lame function is applicable to diverse areas such as boundary value problems in ellipsoidal geometry,…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
In this note, we discuss planar lattices generated by their atoms. We prove that if $L$ is a planar lattice generated by $n$ atoms, then both the left and the right boundaries of $L$ have at most $n+1$ elements. On the other hand, $L$ can…
Let f_1,f_2,..., be functions chosen independently and uniformly from the set of all functions from a set of cardinality n into itself. Let g_t be the composition of the first t functions, and let T be the smallest t for which g_t is…
This paper is dedicated to the fused trend filtering on a general graph, which is a combination of fused estimator and 1-st order trend filtering on a graph. There are two cases of fusion regularisers studied in this work: anisotropic total…
The coordination sequence of a lattice $\L$ encodes the word-length function with respect to $M$, a set that generates $\L$ as a monoid. We investigate the coordination sequence of the cyclotomic lattice $\L = \Z[\zeta_m]$, where $\zeta_m$…
We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on analytic combinatorics and on the notion of patchwork to…
Let S be a finite subset of Z^2. A walk on the slit plane with steps in S is a sequence (0,0)=w_0, w_1, ..., w_n of points of Z^2 such that w_{i+1}-w_i belongs to S for all i, and none of the points w_i, i>0, lie on the half-line H= {(k,0):…
We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…
Let D be an irreducible lattice in a connected, semisimple Lie group G with finite center. Assume that the real rank of G is at least two, that G/D is not compact, and that G has more than one noncompact simple factor. We show that D has no…
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…