Related papers: Lattices over Polynomial Rings and Applications to…
In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced by the author in complexity classification of minimum…
In this paper, we study the zero divisor graph $\Gamma^m(L)$ of a multiplicative lattice L. We prove under certain conditions that for a reduced multiplicative lattice L having more than two minimal prime elements, $\Gamma^m(L)$ contains a…
In this paper, we consider a problem of Lang about finiteness of torsion points on plane rational curves over $\mathbb C$, and prove some results towards a matrix analogue of this problem.
We investigate spaces of operators which are invariant under translations or modulations by lattices in phase space. The natural connection to the Heisenberg module is considered, giving results on the characterisation of such operators as…
We study the vortex distribution of the wave functions minimizing the Gross Pitaevskii energy for a fast rotating condensate in the Lowest Landau Level (LLL): we prove that the minimizer cannot have a finite number of zeroes thus the…
In this paper we investigate measures over bounded lattices, extending and giving a unifying treatment to previous works. In particular, we prove that the measures of an arbitrary bounded lattice can be represented as measures over a…
We examine the moments of the number of lattice points in a fixed ball of volume $V$ for lattices in Euclidean space which are modules over the ring of integers of a number field $K$. In particular, denoting by $\omega_K$ the number of…
The lattice diameter of a bounded set $S \subset \mathbb{R}^d$ measures the maximal number of lattice points in a segment whose endpoints are lattice points in $S$. Such a segment is called a lattice diameter segment of $S$. This simple…
Overlap functions were introduced as class of bivariate aggregation functions on [0, 1] to be applied in image processing. This paper has as main objective to present appropriates definitions of overlap functions considering the scope of…
Lattice reduction algorithms, such as the LLL algorithm, have been proposed as preprocessing tools in order to enhance the performance of suboptimal receivers in MIMO communications. In this paper we introduce a new kind of lattice…
We prove tight probabilistic bounds for the shortest vectors in module lattices over number fields using the results of arXiv:2308.15275. Moreover, establishing asymptotic formulae for counts of fixed rank matrices with algebraic integer…
We study various properties of the gradients of solutions to harmonic functions on Lipschitz surfaces. We improve an exponential bound of Naber and Valtorta on the size of the superlevel sets for the frequency function to a sharp quadratic…
The main result of the paper is a flat extension theorem for positive linear functionals on *-algebras. The theorem is applied to truncated moment problems on cylinder sets, on matrices of polynomials and on enveloping algebras of Lie…
Pasting and Reversing operations have been used successfully over the set of integer numbers, simple permutations, rings and recently over a generalized vector product. In this paper, these operations are defined from a natural way to be…
Divisible residuated lattices are algebraic structures corresponding to a more comprehensive logic than Hajek's basic logic with an important significance in the study of fuzzy logic. The purpose of this paper is to investigate commutative…
One important question in the theory of lattices is to detect a shortest vector: given a norm and a lattice, what is the smallest norm attained by a non-zero vector contained in the lattice? We focus on the infinity norm and work with…
Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…
Let L be a lattice ordered effect algebra. We prove that the lattice uniformities on L which make uniformly continuous the operations $\ominus$ and $\oplus$ of L are uniquely determined by their system of neighbourhoods of 0 and form a…
Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…
We introduce a solvable lattice model for supersymmetric LLT polynomials, also known as super LLT polynomials, based upon particle interactions in super n-ribbon tableaux. Using operators on a Fock space, we prove a Cauchy identity for…