Search results for "relation"
showing 10 items of 10542 documents
A Note on Algebraic Sums of Subsets of the Real Line
2002
AbstractWe investigate the algebraic sums of sets for a large class of invari-ant ˙-ideals and ˙- elds of subsets of the real line. We give a simpleexample of two Borel subsets of the real line such that its algebraicsum is not a Borel set. Next we show a similar result to Proposition 2from A. Kharazishvili paper [4]. Our results are obtained for ideals withcoanalytical bases. 1 Introduction We shall work in ZFC set theory. By !we denote natural numbers. By 4wedenote the symmetric di erence of sets. The cardinality of a set Xwe denoteby jXj. By R we denote the real line and by Q we denote rational numbers. IfAand Bare subsets of R n and b2R , then A+B= fa+b: a2A^b2Bgand A+ b= A+ fbg. Simila…
Enumeration of L-convex polyominoes by rows and columns
2005
In this paper, we consider the class of L-convex polyominoes, i.e. the convex polyominoes in which any two cells can be connected by a path of cells in the polyomino that switches direction between the vertical and the horizontal at most once.Using the ECO method, we prove that the number fn of L-convex polyominoes with perimeter 2(n + 2) satisfies the rational recurrence relation fn = 4fn-1 - 2fn-2, with f0 = 1, f1 = 2, f2 = 7. Moreover, we give a combinatorial interpretation of this statement. In the last section, we present some open problems.
General decidability theorems for infinite-state systems
2002
Over the last few years there has been an increasing research effort directed towards the automatic verification of infinite state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achieving decidability. We present decidability results for a class of systems (called well-structured systems), which consist of a finite control part operating on an infinite data domain. The results assume that the data domain is equipped with a well-ordered and well-founded preorder such that the transition relation is "monotonic" (is a simulation) with respect to the preorder. We show that the following properties are decidable for …
Locality of order-invariant first-order formulas
1998
A query is local if the decision of whether a tuple in a structure satisfies this query only depends on a small neighborhood of the tuple. We prove that all queries expressible by order-invariant first-order formulas are local.
Caristi Type Selections of Multivalued Mappings
2015
Multivalued mappings and related selection theorems are fundamental tools in many branches of mathematics and applied sciences. In this paper we continue this theory and prove the existence of Caristi type selections for generalized multivalued contractions on complete metric spaces, by using some classes of functions. Also we prove fixed point and quasi-fixed point theorems.
M-valued Measure of Roughness for Approximation of L-fuzzy Sets and Its Topological Interpretation
2015
We develop a scheme allowing to measure the “quality” of rough approximation of fuzzy sets. This scheme is based on what we call “an approximation quadruple” \((L,M,\varphi ,\psi )\) where L and M are cl-monoids (in particular, \(L=M=[0,1]\)) and \(\psi : L \rightarrow M\) and \(\varphi : M \rightarrow L\) are satisfying certain conditions mappings (in particular, they can be the identity mappings). In the result of realization of this scheme we get measures of upper and lower rough approximation for L-fuzzy subsets of a set equipped with a reflexive transitive M-fuzzy relation R. In case the relation R is also symmetric, these measures coincide and we call their value by the measure of rou…
Discrete Derivatives for Atom-Pairs as a Novel Graph-Theoretical Invariant for Generating New Molecular Descriptors: Orthogonality, Interpretation an…
2013
This report presents a new mathematical method based on the concept of the derivative of a molecular graph (G) with respect to a given event (S) to codify chemical structure information. The derivate over each pair of atoms in the molecule is defined as ∂G/∂S(vi , vj )=(fi -2fij +fj )/fij , where fi (or fj ) and fij are the individual frequency of atom i (or j) and the reciprocal frequency of the atoms i and j, respectively. These frequencies characterize the participation intensity of atom pairs in S. Here, the event space is composed of molecular sub-graphs which participate in the formation of the G skeleton that could be complete (representing all possible connected sub-graphs) or comp…
Some dissenting views on the transitivity of individual preference
1990
(1) The transitivity property is not a necessary condition for the rationality of all individual preference relations. (2) A weakened definition of the transitivity is not necessarily relevant. (3) The non-transitivity of fuzzy preference relations is not inconsistent with a fuzzy total preorder structure on the set of alternatives.
Some local properties defining $\mathcal T_0$-groups and related classes of groups
2016
We call $G$ a $\operatorname{Hall}_{\mathcal X}$-group if there exists a normal nilpotent subgroup $N$ of $G$ for which $G/N'$ is an ${\mathcal X}$-group. We call $G$ a ${\mathcal T}_0$-group provided $G/\Phi(G)$ is a ${\mathcal T}$-group, that is, one in which normality is a transitive relation. We present several new local classes of groups which locally define $\operatorname{Hall}_{\mathcal X}$-groups and ${\mathcal T}_0$-groups where ${\mathcal X}\in\{ {\mathcal T},\mathcal {PT},\mathcal {PST}\}$; the classes $\mathcal {PT}$ and $\mathcal {PST}$ denote, respectively, the classes of groups in which permutability and S-permutability are transitive relations.
On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
2007
The guarded fragment of first-order logic, GF, enjoys the finite model property, so the satisfiability and the finite satisfiability problems coincide. We are concerned with two extensions of the two-variable guarded fragment that do not possess the finite model property, namely, GF2 with equivalence and GF2 with transitive guards. We prove that in both cases every finitely satisfiable formula has a model of at most double exponential size w.r.t. its length. To obtain the result we invent a strategy of building finite models that are formed from a number of multidimensional grids placed over a cylindrical surface. The construction yields a 2NEXPTIME-upper bound on the complexity of the fini…