Search results for "rete"
showing 10 items of 3470 documents
Logics for context-free languages
1995
We define matchings, and show that they capture the essence of context-freeness. More precisely, we show that the class of context-free languages coincides with the class of those sets of strings which can be defined by sentences of the form ∃ bϕ, where ϕ is first order, b is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.
A general metric regularity in asplund banach spaces
1998
This paper establishes a simple and easily-applied criterion for determining whether a multivalued mapping is metrically regular relatively to a subset in the range space.
Stochastic factorizations, sandwiched simplices and the topology of the space of explanations
2003
We study the space of stochastic factorizations of a stochastic matrix V, motivated by the statistical problem of hidden random variables. We show that this space is homeomorphic to the space of simplices sandwiched between two nested convex polyhedra, and use this geometrical model to gain some insight into its structure and topology. We prove theorems describing its homotopy type, and, in the case where the rank of V is 2, we give a complete description, including bounds on the number of connected components, and examples in which these bounds are attained. We attempt to make the notions of topology accessible and relevant to statisticians.
Burrows-Wheeler transform and Run-Length Enconding
2017
In this paper we study the clustering effect of the Burrows-Wheeler Transform (BWT) from a combinatorial viewpoint. In particular, given a word w we define the BWT-clustering ratio of w as the ratio between the number of clusters produced by BWT and the number of the clusters of w. The number of clusters of a word is measured by its Run-Length Encoding. We show that the BWT-clustering ratio ranges in ]0, 2]. Moreover, given a rational number \(r\,\in \,]0,2]\), it is possible to find infinitely many words having BWT-clustering ratio equal to r. Finally, we show how the words can be classified according to their BWT-clustering ratio. The behavior of such a parameter is studied for very well-…
Learning with confidence
1996
Herein we investigate learning in the limit where confidence in the current conjecture accrues with time. Confidence levels are given by rational numbers between 0 and 1. The traditional requirement that for learning in the limit is that a device must converge (in the limit) to a correct answer. We further demand that the associated confidence in the answer (monotonically) approach 1 in the limit. In addition to being a more realistic model of learning, our new notion turns out to be a more powerful as well. In addition, we give precise characterizations of the classes of functions that are learnable in our new model(s).
Restriction of odd degree characters and natural correspondences
2016
Let $q$ be an odd prime power, $n > 1$, and let $P$ denote a maximal parabolic subgroup of $GL_n(q)$ with Levi subgroup $GL_{n-1}(q) \times GL_1(q)$. We restrict the odd-degree irreducible characters of $GL_n(q)$ to $P$ to discover a natural correspondence of characters, both for $GL_n(q)$ and $SL_n(q)$. A similar result is established for certain finite groups with self-normalizing Sylow $p$-subgroups. We also construct a canonical bijection between the odd-degree irreducible characters of $S_n$ and those of $M$, where $M$ is any maximal subgroup of $S_n$ of odd index; as well as between the odd-degree irreducible characters of $G = GL_n(q)$ or $GU_n(q)$ with $q$ odd and those of $N_{G}…
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…
The maximal coefficient of ternary cyclotomic polynomials with one free prime
2014
A cyclotomic polynomial Φn(x) is said to be ternary if n = pqr, with p, q and r distinct odd primes. Let M(p, q) be the maximum (in absolute value) coefficient appearing in the polynomial family Φpqr(x) with p < q < r, p and q fixed. Here a stronger version of the main conjecture of Gallot, Moree and Wilms regarding M(p, q) is established. Furthermore it is shown that there is an algorithm to compute M(p): = max {M(p, q): q > p}. Our methods are the most geometric used so far in the study of ternary cyclotomic polynomials.
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.
Radical Rings with Engel Conditions
2000
Abstract An associative ring R without unity is called radical if it coincides with its Jacobson radical, which means that the set of all elements of R forms a group denoted by R ∘ under the circle operation r ∘ s = r + s + rs on R . It is proved that, for a radical ring R , the group R ∘ satisfies an n -Engel condition for some positive integer n if and only if R is m -Engel as a Lie ring for some positive integer m depending only on n .