Search results for "rete"
showing 10 items of 3470 documents
JH-Operators and Occasionally Weakly g-Biased Pairs in Fuzzy Symmetric Spaces
2013
We introduce the notions of $\mathcal{JH}$-operators and occasionally weakly $g$-biased mappings in fuzzy symmetric spaces to prove common fixed point theorems for self-mappings satisfying a generalized mixed contractive condition. We also prove analogous results for two pairs of $\mathcal{JH}$-operators by assuming symmetry only on the set of points of coincidence. These results unify, extend and complement many results existing in the recent literature. We give also an application of our results to product spaces.
Asymptotics for the Amitsur's Capelli - Type Polynomials and Verbally Prime PI-Algebras
2006
We consider associativePI-algebras over a field of characteristic zero. The main goal of the paper is to prove that the codimensions of a verbally prime algebra [11] are asymptotically equal to the codimensions of theT-ideal generated by some Amitsur's Capelli-type polynomialsEM,L* [1]. We recall that two sequencesan,bnare asymptotically equal, and we writean≃bn,if and only if limn→∞(an/bn)=1.In this paper we prove that\(c_n \left( {M_k \left( G \right)} \right) \simeq c_n \left( {E_{k^2 ,k^2 }^ * } \right) and c_n \left( {M_{k,l} \left( G \right)} \right) \simeq c_n \left( {E_{k^2 + l^2 ,2kl}^ * } \right) \)% MathType!End!2!1!, whereG is the Grassmann algebra. These results extend to all v…
On the low-dimensional Steiner minimum tree problem in Hamming metric
2013
While it is known that the d-dimensional Steiner minimum tree problem in Hamming metric is NP-complete if d is part of the input, it is an open question whether this also holds for fixed dimensions. In this paper, this question is answered by showing that the Steiner minimum tree problem in Hamming metric is already NP-complete in 3 dimensions. Furthermore, we show that, the minimum spanning tree gives a 2-2d approximation on the Steiner minimum tree for d>=2. Using this result, we analyse the so-called k-LCA and A"k approximation algorithms and show improved approximation guarantees for low dimensions.
Symmetric (79, 27, 9)-designs Admitting a Faithful Action of a Frobenius Group of Order 39
1997
AbstractIn this paper we present the classification of symmetric designs with parameters (79, 27, 9) on which a non-abelian group of order 39 acts faithfully. In particular, we show that such a group acts semi-standardly with 7 orbits. Using the method of tactical decompositions, we are able to construct exactly 1320 non-isomorphic designs. The orders of the full automorphism groups of these designs all divide 8 · 3 · 13.
Automata and differentiable words
2011
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this construction to the case of C\infinity-words, i.e., words differentiable arbitrary many times. We thus obtain an infinite automaton for representing the set of C\infinity-words. We derive a classification of C\infinity-words induced by the structure of the automaton. Then, we introduce a new framework for dealing with \infinity-words, based on a three letter alphabet. This allows us to define a compacted version of the automaton, that we use to prove that ev…
Perturbations of surjective convolution operators
2002
Let μ 1 and μ 2 be (ultra)distributions with compact support which have disjoint singular supports. We assume that the convolution operator f → μ 1 *f is surjective when it acts on a space of functions or (ultra)distributions, and we investigate whether the perturbed convolution operator f→ (μ 1 + μ 2 ) * f is surjective. In particular we solve in the negative a question asked by Abramczuk in 1984.
Unified Metrical Common Fixed Point Theorems in 2-Metric Spaces via an Implicit Relation
2013
We prove some common fixed point theorems for two pairs of weakly compatible mappings in 2-metric spaces via an implicit relation. As an application to our main result, we derive Bryant's type generalized fixed point theorem for four finite families of self-mappings which can be utilized to derive common fixed point theorems involving any finite number of mappings. Our results improve and extend a host of previously known results. Moreover, we study the existence of solutions of a nonlinear integral equation.
A fixed point theorem inG-metric spaces viaα-series
2014
In the context of G -metric spaces we prove a common fixed point theorem for a sequence of self mappings using a new concept of α-series. Keywords: α-series, common fixed point, G -metric space Quaestiones Mathematicae 37(2014), 429-434
Periodicity and repetitions in parameterized strings
2008
AbstractOne of the most beautiful and useful notions in the Mathematical Theory of Strings is that of a Period, i.e., an initial piece of a given string that can generate that string by repeating itself at regular intervals. Periods have an elegant mathematical structure and a wealth of applications [F. Mignosi and A. Restivo, Periodicity, Algebraic Combinatorics on Words, in: M. Lothaire (Ed.), Cambridge University Press, Cambridge, pp. 237–274, 2002]. At the hearth of their theory, there are two Periodicity Lemmas: one due to Lyndon and Schutzenberger [The equation aM=bNcP in a free group, Michigan Math. J. 9 (1962) 289–298], referred to as the Weak Version, and the other due to Fine and …
On the points realizing the distance to a definable set
2011
Abstract We prove a definable/subanalytic version of a useful lemma, presumably due to John Nash, concerning the points realizing the Euclidean distance to an analytic submanifold of R n . We present a parameter version of the main result and we discuss the properties of the multifunction obtained.