Related papers: Defining rough sets as core-support pairs of three…
Given a compact basic semi-algebraic set $K\subset R^n\times R^m$, a simple set $B$ (box or ellipsoid), and some semi-algebraic function $f$, we consider sets defined with quantifiers, of the form $R_f:=\{x\in B: \mbox{$f(x,y)\leq 0$ for…
It is shown how sums of squares of real valued functions can be used to give new proofs of the reality of the zeros of the Bessel functions $J_\alpha (z)$ when $\alpha \ge -1,$ confluent hypergeometric functions ${}_0F_1(c\/; z)$ when $c>0$…
A well-known Hurewicz-type formula for asymptotic-dimension-lowering group homomorphisms, due to A. Dranishnikov and J. Smith, states that if $f:G\to H$ is a group homomorphism, then $\mathrm{asdim} G \leq \mathrm{asdim} H + \mathrm{asdim}…
We study the Schur elements and the a-function for cyclotomic Hecke algebras. As a consequence, we show the existence of canonical basic sets, as defined by Geck-Rouquier, for certain complex reflection groups. This includes the case of…
A triple of finite von Neumann algebras $B\subseteq N\subseteq M$ is said to have the relative weak asymptotic homomorphism property if there exists a net of unitary operators $\{u_{\lambda}\}_{\lambda\in \Lambda}$ in $B$ such that…
We derive an identity for certain linear combinations of polylogarithm functions with negative exponents, which implies relations for linear combinations of Eulerian numbers. The coefficients of our linear combinations are related to…
In this paper, we give an introduction for rough groups and rough homomorphisms. Then we present some properties related to topological rough subgroups and rough subsets. We construct the product of topological rough groups and give an…
An FOL-program consists of a background theory in a decidable fragment of first-order logic and a collection of rules possibly containing first-order formulas. The formalism stems from recent approaches to tight integrations of ASP with…
The Riesz-Sobolev inequality provides an upper bound for a trilinear expression involving convolution of indicator functions of sets. It is known that equality holds only for homothetic ordered triples of appropriately situated ellipsoids.…
Moisil in 1941, while constructing the algebraic models of n-valued {\L}ukasiewicz logic defined the set $B^{[n]}$,where $B$ is a Boolean algebra and `n' being a natural number. Further it was proved by Moisil himself the representations of…
Let H be a non semi-simple Ariki-Koike algebra. According to [18] and [14], there is a generalisation of Lusztig's a-function which induces a natural order (parametrised by a tuple m) on Specht modules. In some cases, Geck and Jacon have…
Uniformly quasiconformally homogeneous domains in $\mathbb{R}^n$ carry a transitive collection of $K$-quasiconformal maps for a fixed $K\geq 1.$ In this paper, we study two questions in this setting. The first is to show that…
Equivalence relations or, more general, quasiorders (i.e., reflexive and transitive binary relations) $\rho$ have the property that an $n$-ary operation $f$ preserves $\rho$, i.e., $f$ is a polymorphism of $\rho$, if and only if each…
We define formal orbifolds over an algebraically closed field of arbitrary characteristic as curves together with some branch data. Their \'etale coverings and their fundamental groups are also defined. These fundamental group approximates…
A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…
In this paper we prove that the Single-Valued (and respectively Interval-Valued, as well as Subset-Valued) Score, Accuracy, and Certainty Functions determine a total order on the set of neutrosophic triplets (T, I, F). This total order is…
Soft set theory serves as a mathematical framework for handling uncertain information, and hesitant fuzzy sets find extensive application in scenarios involving uncertainty and hesitation. Hesitant fuzzy sets exhibit diverse membership…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
In this study, after given the definition of soft sets and their basic operations we define convex soft sets which is an important concept for operation research, optimization and related problems. Then, we define concave soft sets and give…
Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…