Related papers: Constructing left-continuous triangular norms on c…
This paper introduces a novel framework for constructing algebraic lattices based on Construction-D, leveraging nested linear codes and prime ideals from algebraic number fields. We focus on the application of these lattices in block-fading…
Here we construct the conformal mappings with the help of continuous fractions approximations. These approximations converge to the algebraic roots $\sqrt[N]{z}$ for $N \in \mathbb{N}$ and $z$ from the right half-plane of the complex plane.…
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…
This note is a follow-up to \cite{bt}. We focus on conditions under which a normed lattice $X$ is majorizing in its norm completion. We show that \cite[Question 8.17]{bt} -- namely, whether this holds whenever every norm-null sequence in…
This work investigates the factorization of finite lattices to implode selected intervals while preserving the remaining order structure. We examine how complete congruence relations and complete tolerance relations can be utilized for this…
We give a new method to construct isolated left orderings of groups whose positive cones are finitely generated. Our construction uses an amalgamated free product of two groups having an isolated ordering. We construct a lot of new examples…
In this work, two algorithms are developed related to lattice codes. In the first one, an extended complete Gr\"obner basis is computed for the label code of a lattice. This basis supports all term orderings associated with a total degree…
We consider the problem of constructing a weakly-continuous mapping extending continuous mapping defined on a dense set of a topological space to the entire space. Theorem on necessary and sufficient conditions for the existence of such an…
Consider discrete conformal maps defined on the basis of two conformally equivalent triangle meshes, that is edge lengths are related by scale factors associated to the vertices. Given a smooth conformal map $f$, we show that it can be…
For a fix modular form g and a non negative ineteger {\nu}, by using Rankin-Cohen bracket we first define a linear map $T_{g,{\nu}}$ on the space of modular forms. We explicitly compute the adjoint of this map and show that the n-th Fourier…
We consider homomorphisms of complete, separated right or two-sided linear topological rings with countable bases of neighborhoods of zero $\mathfrak f\colon\mathfrak R\to\mathfrak S$. Taut maps of right linear topological rings, strongly…
In tensor completion, the latent nuclear norm is commonly used to induce low-rank structure, while substantially failing to capture the global information due to the utilization of unbalanced unfolding scheme. To overcome this drawback, a…
We realize norms of most composition operators acting on the Hardy space with linear fractional symbol as roots of hypergeometric functions. This realization leads to simple necessary and sufficient conditions on the symbol to exhibit…
Two triangle meshes are conformally equivalent if for any pair of incident triangles the absolute values of the corresponding cross-ratios of the four vertices agree. Such a pair can be considered as preimage and image of a discrete…
Lattices and partially ordered sets have played an increasingly important role in coding theory, providing combinatorial frameworks for studying structural and algebraic properties of error-correcting codes. Motivated by recent works…
In this paper, we prove that the set of triangulations of a polygon can be equipped with an order to become a lattice. First, we define this order. In [HN99], authors defined the flip operator and then prove some properties of the graph of…
In Orlicz spaces generated by convex Orlicz functions a family of norms generated by some lattice norms in $\mathbb{R}^{2}$ are defined and studied. This family of norms includes the family of the p-Amemiya norms ($1\leq p\leq\infty$)…
A way to add an extra dimension is briefly discussed.
A method of embedding partially ordered sets into linear spaces is presented. The problem of finding all orthocomplementations in a finite lattice is reduced to a linear programming problem.
The present note has three aims. First, to complement the theory of cofibrant generation of algebraic weak factorisation systems (AWFSs) to cover some important examples that are not locally presentable categories. Secondly, to prove that…