Related papers: Defining rough sets as core-support pairs of three…
The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…
In this paper, we focus on the links between Boolean function theory and quantum computing. In particular, we study the notion of what we call fully-balanced functions and analyse the Fourier--Hadamard and Walsh supports of those functions…
Rough set theory is an important mathematical tool for dealing with uncertain or vague information. This paper studies some new topologies induced by a binary relation on universe with respect to neighborhood opera- tors. Moreover, the…
Following Lusztig, we consider a Coxeter group $W$ together with a weight function $L$. This gives rise to the pre-order relation $\leq_{L}$ and the corresponding partition of $W$ into left cells. We introduce an equivalence relation on…
A number of numeric measures like rough inclusion functions (RIFs) are used in general rough sets and soft computing. But these are often intrusive by definition, and amount to making unjustified assumptions about the data. The…
This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
We present generalization of the Bloom variety theorem of ordered algebras in fuzzy setting. We introduce algebras with fuzzy orders which consist of sets of functions which are compatible with particular binary fuzzy relations called fuzzy…
The paper discusses an applicability criterion for a cutoff regularization in the coordinate representation in the Euclidean space with a dimension larger than two. It is shown that the set of functions satisfying the criterion is not…
We consider a class of third-order evolution equations of the form \begin{equation*} \left\{ \begin{array}{l} \displaystyle u_{t}=F\left(x,t,u,u_x,u_{xx},u_{xxx},v,v_x,v_{xx},v_{xxx}\right), \displaystyle…
Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may…
Fusion is defined for arbitrary lowest weight representations of $W$-algebras, without assuming rationality. Explicit algorithms are given. A category of quasirational representations is defined and shown to be stable under fusion.…
The present paper develops two concepts of pointwise differentiability of higher order for arbitrary subsets of Euclidean space defined by comparing their distance functions to those of smooth submanifolds. Results include that…
The definition of the complement of a fuzzy subset is algebraic in nature and when it is used in the context of fuzzy topological spaces it does not share any similarity with the usual property of topological spaces that the complement of…
A function $f$ is arc-smooth if the composite $f\circ c$ with every smooth curve $c$ in its domain of definition is smooth. On open sets in smooth manifolds the arc-smooth functions are precisely the smooth functions by a classical theorem…
An order theoretic and algebraic framework for the extended real numbers is established which includes extensions of the usual difference to expressions involving $-\infty$ and/or $+\infty$, so-called residuations. Based on this,…
We study the cohomological classification of vector bundles on smooth real affine surfaces and threefolds. We show that, as was observed in joint work in A. Asok and J. Fasel and in a coming joint paper with S. Banerjee and J. Fasel, under…
A quasisymmetric function is assigned to every double poset (that is, every finite set endowed with two partial orders) and any weight function on its ground set. This generalizes well-known objects such as monomial and fundamental…
The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…
Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…