English
Related papers

Related papers: Decompositions of set-valued mappings

200 papers

If B is an infinite subset of omega and X is a topological group, let C^X_B be the set of all x in X such that <x^n : n in B> converges to 1. If F is a filter of infinite sets, let D^X_F be the union of all the C^X_B for B in F. The C^X_B…

General Topology · Mathematics 2007-05-23 Joan E. Hart , Kenneth Kunen

Let $X$ be a non-empty set and $\sP(X)$ be its power set. A set-valuation or a set-labeling of a given graph $G$ is an injective function $f:V(G) \to \sP(X)$ such that the induced function $f^{\ast}:E(G) \to \sP(X)$ defined by $f^{\ast}…

General Mathematics · Mathematics 2016-01-13 Naduvath Sudev

Let $\ee>0$ and $\fff$ be a family of finite subsets of the Cantor set $\ccc$. Following D. H. Fremlin, we say that $\fff$ is $\ee$-filling over $\ccc$ if $\fff$ is hereditary and for every $F\subseteq\ccc$ finite there exists $G\subseteq…

Logic · Mathematics 2019-05-01 Pandelis Dodos , Vassilis Kanellopoulos

Let $X$ be a set of cardinality $\kappa$ such that $\kappa^\omega=\kappa$. We prove that the linear algebra $\mathbb{R}^X$ (or $\mathbb{C}^X$) contains a free linear algebra with $2^\kappa$ generators. Using this, we prove several…

Rings and Algebras · Mathematics 2013-04-12 Artur Bartoszewicz , Szymon Gł\cab , Adam Paszkiewicz

The paper is devoted to developing subdifferential theory for set-valued mappings taking values in ordered infinite-dimensional spaces. This study is motivated by applications to problems of vector and set optimization with various…

Optimization and Control · Mathematics 2024-10-16 Boris S. Mordukhovich , Oanh Nguyen

This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…

Computational Complexity · Computer Science 2016-10-27 Luca Chiantini , Christian Ikenmeyer , J. M. Landsberg , Giorgio Ottaviani

Functional decomposition is the process of breaking down a function $f$ into a composition $f=g(f_1,\dots,f_k)$ of simpler functions $f_1,\dots,f_k$ belonging to some class $\mathcal{F}$. This fundamental notion can be used to model…

Computational Complexity · Computer Science 2026-01-14 Mateus de Oliveira Oliveira , Wim Van den Broeck

For every finite closure space $X$ one can define a finite topological space $\operatorname{Top} X$ together with a natural projection $\operatorname{Top} X\longrightarrow X$. This could allow to apply the techniques of topological…

General Topology · Mathematics 2021-11-29 Josef Eschgfäller

A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…

Symbolic Computation · Computer Science 2017-03-01 Dongming Wang , Rina Dong , Chenqi Mou

NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…

Logic · Mathematics 2025-10-31 Michael Beeson

Every open continuous map f from a space X onto a paracompact C-space Y admits two disjoint closed subsets of X so that their image by f is Y provided all fibers of f are infinite and C*-embedded in X. Applications are demonstrated for the…

General Topology · Mathematics 2018-05-22 Valentin Gutev , Vesko Valov

We propose the notion of countable decomposability of maps on C*-algebras: a bounded linear map $\varphi : \mathscr{A}\to B(\mathcal{H})$, where $\mathscr{A}$ is a C*-algebra and $\mathcal{H}$ a Hilbert space, will be called countably…

Operator Algebras · Mathematics 2026-02-12 Krzysztof Szczygielski

The postcritical set $P(f)$ of a rational map $f:\mathbb P^1\to \mathbb P^1$ is the smallest forward invariant subset of $\mathbb P^1$ that contains the critical values of $f$. In this paper we show that every finite set $X\subset \mathbb…

Dynamical Systems · Mathematics 2017-09-21 Laura G. DeMarco , Sarah C. Koch , Curtis T. McMullen

We study the set of all decompositions (clusterings) of a graph through its characterization as a set of lifted multicuts. This leads us to practically relevant insights related to the definition of a class of decompositions by must-join…

Discrete Mathematics · Computer Science 2017-06-09 Andrea Horňáková , Jan-Hendrik Lange , Bjoern Andres

For a Hausdorff space $X$ we denote be $2^X$ the family of all closed subsets of $X$. In this paper we continue to research relationships between closure -type properties of hyperspaces over a space $X$ and covering properties of $X$. We…

General Topology · Mathematics 2018-11-05 Alexander V. Osipov

Suppose a map $\phi$ on the set of positive definite matrices satisfies $\det(A+B)=\det(\phi(A)+\phi(B))$. Then we have $${\rm tr}(AB^{-1}) = {\rm tr}(\phi(A){\phi(B)}^{-1}).$$ Through this viewpoint, we show that $\phi$ is of the form…

Rings and Algebras · Mathematics 2016-03-15 Huajun Huang , Chih-Neng Liu , Patricia Szokol , Ming-Cheng Tsai , Jun Zhang

A relational structure ${\mathbb X}$ is said to be reversible iff every bijective endomorphism $f:X\rightarrow X$ is an automorphism. We define a sequence of non-zero cardinals $\langle \kappa_i :i\in I\rangle$ to be reversible iff each…

Logic · Mathematics 2017-09-28 Miloš S. Kurilić , Nenad Morača

For a group $G$, $\mathcal{F}_G$ denotes the set of all non-empty finite subsets of $G$. We extend the finitary coarse structure of $G$ from $G\times G$ to $\mathcal{F}_G\times \mathcal{F}_G$ and say that a macro-uniform mapping $f:…

Group Theory · Mathematics 2021-03-24 Igor Protasov

A two-point selection on a set $X$ is a function $f:[X]^2 \to X$ such that $f(F) \in F$ for every $F \in [X]^2$. It is known that every two-point selection $f:[X]^2 \to X$ induced a topology $\tau_f$ on $X$ by using the relation: $x \leq y$…

General Topology · Mathematics 2022-04-25 S. Garcia-Ferreira

We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families $\mathcal{F}$ of $k$-element subsets of $[n]:=\{1,\ldots, n\},$ such that every element of $[n]$ lies in the…

Combinatorics · Mathematics 2019-07-02 Ferdinand Ihringer , Andrey Kupavskii