English
Related papers

Related papers: Defining rough sets as core-support pairs of three…

200 papers

Let $X$ be a perfect, compact subset of the complex plane. We consider algebras of those functions on $X$ which satisfy a generalised notion of differentiability, which we call $\mathcal{F}$-differentiability. In particular, we investigate…

Functional Analysis · Mathematics 2024-03-28 J. F. Feinstein , S. Morley

On a smooth projective threefold, we construct an essentially surjective functor $\mathcal{F}$ from a category of two-term complexes to a category of quotients of coherent sheaves, and describe the fibers of this functor. Under a coprime…

Algebraic Geometry · Mathematics 2023-02-22 Jason Lo

In this paper, we introduce the upper and lower approximations on the invers set-valued mapping and the approximations an established on a powerful set valued homomorphism from a ring R1 to power sets of a ring R2. Moreover, the properties…

General Mathematics · Mathematics 2020-12-01 Faraj. A. Abdunabi , Ahmed Shletie

We investigate properties of families $F$ of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any $A\notin F$, there is such set $A'\in F$ that either $A\subset A'$ or…

Discrete Mathematics · Computer Science 2013-04-17 B. S. Kochkarev

Given a set I of word, the set of all words obtained by the shuffle of (copies of) words of I is naturally provided with a partial order. In [FS05], the authors have opened the problem of the characterization of the finite sets I such that…

Discrete Mathematics · Computer Science 2016-08-16 Flavio D'Alessandro , Gwénaël Richomme , Stefano Varrichio

In this paper we put forward the definition of particular subsets on a unital C*-algebra, that we call isocones, and which reduce in the commutative case to the set of continuous non-decreasing functions with real values for a partial order…

Operator Algebras · Mathematics 2014-11-18 Fabien Besnard

We work with quasianalytic classes of functions. Consider a real-valued function y = f(x) on an open subset U of Euclidean space, which satisfies a quasianalytic equation G(x, y) = 0. We prove that f is arc-quasianalytic (i.e., its…

Complex Variables · Mathematics 2014-01-31 Edward Bierstone , Pierre D. Milman , Guillaume Valette

Let $\mathrm{G}$ be a subgroup of the symmetric group $\mathfrak S(U)$ of all permutations of a countable set $U$. Let $\overline{\mathrm{G}}$ be the topological closure of $\mathrm{G}$ in the function topology on $U^U$. We initiate the…

Combinatorics · Mathematics 2020-02-13 Claude Laflamme , Maurice Pouzet , Norbert Sauer , Robert Woodrow

The present work proposes and discusses the category of supported sets which provides a uniform foundation for nominal sets of various kinds, such as those for equality symmetry, for the order symmetry, and renaming sets. We show that all…

Formal Languages and Automata Theory · Computer Science 2022-10-06 Thorsten Wißmann

Fuzzy rough set theory is effective for processing datasets with complex attributes, supported by a solid mathematical foundation and closely linked to kernel methods in machine learning. Attribute reduction algorithms and classifiers based…

Artificial Intelligence · Computer Science 2025-01-31 Shuyin Xia , Xiaoyu Lian , Binbin Sang , Guoyin Wang , Xinbo Gao

Given a measure space and a totally ordered ordered collection of measurable sets, called an ordered core, the notion of a core decreasing function is introduced and used to define the down space of a Banach function space. This is done…

Functional Analysis · Mathematics 2024-07-15 Alejandro Santacruz Hidalgo , Gord Sinnamon

In this paper, we present the concepts of the upper and lower approximations of Anti-rough subgroups, Anti-rough subsemigroups, and homeomorphisms of Anti-Rough anti-semigroups in approximation spaces. Specify the concepts of rough in…

General Mathematics · Mathematics 2023-01-24 Faraj. A. Abdunabi , Ahmed shletiet , Najah. A. Bosaif

A quantum set is defined to be simply a set of nonzero finite-dimensional Hilbert spaces. Together with binary relations, essentially the quantum relations of Weaver, quantum sets form a dagger compact category. Functions between quantum…

Operator Algebras · Mathematics 2021-10-13 Andre Kornell

Let $\mathcal{C}$ be a smooth, projective and geometrically integral curve defined over a finite field $\mathbb{F}$. Let $A$ be the ring of function of $\mathcal{C}$ that are regular outside a closed point $P$ and let $k=\mathrm{Quot}(A)$.…

Number Theory · Mathematics 2023-04-04 Claudio Bravo

A three-tiered specification approach is developed to formally specify collections of collaborating objects, say micro-architectures. (i) The structural properties to be maintained in the collaboration are specified in the lowest tier. (ii)…

Software Engineering · Computer Science 2007-05-23 Vasu Alagar , Ralf Laemmel

We introduce a formalism to analyze partially defined functions between ordered sets. We show that our construction provides a uniform and conceptual approach to all the main definitions encountered in elementary real analysis including…

Classical Analysis and ODEs · Mathematics 2019-02-06 Marco Aldi , Alexander McCleary

This is a preliminary note on a family of minimal surfaces in the 3-sphere defined by a compatible fourth order equation. The minimal surfaces are geometrically characterized either by having a surface of revolution like induced metric, or…

Differential Geometry · Mathematics 2013-10-17 Joe S. Wang

In this paper we study the representation theory of three monoids of partial functions on an $n$-set. The monoid of all order-preserving functions (i.e., functions satisfying $f(x)\leq f(y)$ if $x\leq y$) the monoid of all order-decreasing…

Representation Theory · Mathematics 2019-05-29 Itamar Stein

Traditional scoring approaches on hesitant fuzzy sets often lack a formal base in order theory. This paper proposes a unified framework, where each score is explicitly defined with respect to a given order. This order-oriented perspective…

Artificial Intelligence · Computer Science 2026-02-20 Luis Merino , Gabriel Navarro , Carlos Salvatierra , Evangelina Santos

The input of most clustering algorithms is a symmetric matrix quantifying similarity within data pairs. Such a matrix is here turned into a quadratic set function measuring cluster score or similarity within data subsets larger than pairs.…

Discrete Mathematics · Computer Science 2015-09-30 Giovanni Rossi