English
Related papers

Related papers: Constructing left-continuous triangular norms on c…

200 papers

In the first part of this article, we give an analysis of the free monad sequence in non-cocomplete categories, with the needed colimits explicitly parametrized. This enables us to state a more finely grained functoriality principle for…

Category Theory · Mathematics 2025-04-11 Christian Sattler

This article builds on Thurston's height functions. His tiling algorithm is reinterpreted using lattice theory and then generalized in order to generate any tiling of a hole-free region. Combined with a natural encoding of tilings by words,…

Dynamical Systems · Mathematics 2009-09-29 Sébastien Desreux , Eric Rémila

For vector lattices $E$ and $F$, where $F$ is Dedekind complete and supplied with a locally solid topology, we introduce the corresponding locally solid absolute strong operator topology on the order bounded operators $\mathcal…

Functional Analysis · Mathematics 2023-05-31 Yang Deng , Marcel de Jeu

We revisit the construction of integral forms for vertex (operator) algebras $V_L$ based on even lattices $L$ using generators instead of bases, and we construct integral forms for $V_L$-modules. We construct integral forms for vertex…

Quantum Algebra · Mathematics 2018-10-02 Robert McRae

In this paper we propose a general ternary construction of lattices from three rows and ternary codes. Most laminated lattices and Kappa lattices in ${\bf R}^n$, $n\leq 24$ can be recovered from our tenary construction naturally. This…

Number Theory · Mathematics 2015-04-15 Hao Chen

We analyze the structure of left maps in algebraic weak factorization systems constructed using Garner's algebraic small object argument. We find that any left map can be constructed from generators in Bourke and Garner's double category of…

Category Theory · Mathematics 2025-10-28 Evan Cavallo , Christian Sattler

Tight wavelet frames (TWFs) in \(L^2(\mathbb{R}^n)\) are versatile, and are practically useful due to their perfect reconstruction property. Nevertheless, existing TWF construction methods exhibit limitations, including a lack of specific…

Functional Analysis · Mathematics 2025-05-19 Youngmi Hur , Hyojae Lim

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…

Information Theory · Computer Science 2017-04-14 Lin Sok , Minjia Shi , Patrick Solé

To efficiently express tensor data using the Tucker format, a critical task is to minimize the multilinear rank such that the model would not be over-flexible and lead to overfitting. Due to the lack of rank minimization tools in tensor,…

Signal Processing · Electrical Eng. & Systems 2024-09-11 Xueke Tong , Hancheng Zhu , Lei Cheng , Yik-Chung Wu

Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain ${\mathsf M}_3$-sublattices). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are $u_l, u_r \in [o, i] - \{o,i\}$ such that $i = u_l…

Rings and Algebras · Mathematics 2022-03-31 George Grätzer

In this paper, we introduce the concept of L-dendriform conformal algebras, which arise naturally from the study of $\mathcal{O}$-operators on left-symmetric conformal algebras and solutions to the conformal $S$-equation. These algebras…

Rings and Algebras · Mathematics 2025-09-10 Atef Hajjaji , Lamei Yuan

We develop a unified T-extended framework for weakly contractive, weakly Kannan, and Geraghty classes of self-maps S on a metric space (X, d), where distances are measured on the auxiliary image via d(Tx, Ty), and the dynamics is governed…

Functional Analysis · Mathematics 2026-04-28 Fatemeh Fogh , Sara Behnamian

The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…

Numerical Analysis · Mathematics 2015-06-29 Josef Dick , Peter Kritzer

This paper constructs a $t_{r}$-norm and a $t_{r}$-conorm on the set of all normal and convex functions from ${[0, 1]}$ to ${[0, 1]}$, which are not obtained by using the following two formulas on binary operations ${\curlywedge}$ and…

General Mathematics · Mathematics 2021-02-02 Xinxing Wu , Guanrong Chen

We consider a field $f \circ T_1^{i_1} \circ \cdots \circ T_d^{i_d}$ where $T_1, \dots , T_d$ arecommuting transformations, one of them at least being ergodic. Considering the case of commuting filtrations, we are interested by giving…

Probability · Mathematics 2025-03-27 Christophe Cuny , Jérôme Dedecker , Florence Merlevède

The duality of finitary biframes as pointfree bitopological spaces is explored. In particular, for a finitary biframe $\mathcal{L}$ the ordered collection of all its pointfree bisubspaces (i.e. its biquotients) is studied. It is shown that…

Functional Analysis · Mathematics 2020-11-04 Anna Laura Suarez

Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain an ${\mathsf M}_3$-sublattice). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are complementary $a, b \in I$ such that $a$ is to the…

Rings and Algebras · Mathematics 2022-07-05 George Grätzer

We give formal normal forms for parabolic logarithmic transseries $f=z+\cdots \, $, with respect to parabolic logarithmic normalizations. Normalizations are given algorithmically, using fixed point theorems, as limits of Picard's sequences…

Classical Analysis and ODEs · Mathematics 2021-12-24 Dino Peran

Lattice-linearity was introduced as a way to model problems using predicates that induce a lattice among the global states (Garg, SPAA 2020). A key property of \textit{the predicate} representing such problems is that it induces…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-11-28 Arya Tanmay Gupta , Sandeep S Kulkarni

We consider linear narrow operators on lattice-normed spaces. We prove that, under mild assumptions, every finite rank linear operator is strictly narrow (before it was known that such operators are narrow). Then we show that every…

Functional Analysis · Mathematics 2015-08-18 D. T. Dzadzaeva , M. A. Pliev