Related papers: Factorization, majorization, and domination for li…

In this paper, we introduce and characterize max-doubly stochastic matrices within the framework of max algebra, where the operations are defined as $x \oplus y = \max(x, y)$ and $x \otimes y = xy$. We explore the fundamental properties of…

A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…

Drawing inspiration from Emmy Noether'set-theoretic foundations for algebra and Charles Ehresmann's topology without points, we adopt a new order-theoretic approach to ideal theory. For this we emphasize the order of divisibility in…

We define the category of partitioned binary relations and show that it contains many classical diagram categories, including categories of binary relations, maps, injective maps, partitions, (oriented) Brauer diagrams and (oriented)…

The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…

Given a simple graph $G$, a dominating set in $G$ is a set of vertices $S$ such that every vertex not in $S$ has a neighbor in $S$. Denote the domination number, which is the size of any minimum dominating set of $G$, by $\gamma(G)$. For…

We consider the question of, given operators $A$, $Z$ and a sequence of invertible operators $U_n\to Z$, whether the sequence $U_nAU_n^{-1}$ is bounded in norm, as well as generalizations of this where $U_nAU_n^{-1}$ is modified by some…

The Hilbert space of probability mass functions (pmf) is introduced in this thesis. A factorization method for multivariate pmfs is proposed by using the tools provided by the Hilbert space of pmfs. The resulting factorization is special…

The A-model for finite rank singular perturbations of class $\mathfrak{H}_{-m-2}\smallsetminus\mathfrak{H}_{-m-1}$, $m\in\mathbb{N}$, is considered from the perspective of boundary relations. Assuming further that the Hilbert spaces…

The prime number decomposition of a finite dimensional Hilbert space reflects itself in the representations that the space accommodates. The representations appear in conjugate pairs for factorization to two relative prime factors which can…

This paper studies the relation between the Lorenz majorization order and the realizability of degree sequences X of a network in the sense of being graphical or connected graphical (c-graphical) or not. We prove the main result that, if X…

The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…

We study the boundedness of the Hilbert transform $H$ and the Hilbert maximal operator $H^*$ on weighted Lorentz spaces $\Lambda^p_u(w)$. We start by giving several necessary conditions that, in particular, lead us to the complete…

Let $A_{1},...A_{m}$ be a $n\times n$ invertible matrices. Let $0 \leq \alpha<n$ and $0<\alpha_{i}<n$ such that $\alpha_1 + ... + \alpha_m = n- \alpha$. We define% \begin{equation*} T_{\alpha}f(x)=\int \frac{1}{\left\vert…

Szpilrajn's Lemma entails that each partial order extends to a linear order. Dushnik and Miller use Szpilrajn's Lemma to show that each partial order has a relizer. Since then, many authors utilize Szpilrajn's Theorem and the Well-ordering…

We consider Upper Domination, the problem of finding the minimal dominating set of maximum cardinality. Very few exact algorithms have been described for solving Upper Domination. In particular, no binary programming formulations for Upper…

We establish a uniform domination of the family of trilinear multiplier forms with singularity over a one-dimensional subspace by positive sparse forms involving $L^p$-averages. This class includes the adjoint forms to the bilinear Hilbert…

The linear representation hypothesis is the informal idea that semantic concepts are encoded as linear directions in the representation spaces of large language models (LLMs). Previous work has shown how to make this notion precise for…

We investigate Tukey morphisms between binary relations, establishing several fundamental lemmas. We then specialize to finite binary relations, using computational methods to classify all binary relations with at most $6$ points in the…

Let $\mathcal H$ be a Hilbert space. Given a bounded positive definite operator $S$ on $\mathcal H$, and a bounded sequence $\mathbf{c} = \{c_k \}_{k \in \mathbb N}$ of non negative real numbers, the pair $(S, \mathbf{c})$ is frame…