Search results for "Quantitative"
showing 10 items of 2409 documents
Standard polynomials are characterized by their degree and exponent
2011
Abstract By the Giambruno–Zaicev theorem (Giambruno and Zaicev, 1999) [5] , the exponent exp ( A ) of a p.i. algebra A exists, and is always an integer. In Berele and Regev (2001) [2] it was shown that the exponent exp ( St n ) of the standard polynomial St n of degree n is not smaller than the exponent of any polynomial of degree n. Here it is proved that exp ( St n ) is strictly larger than the exponent of any other polynomial of degree n which is not a multiple of St n .
A simple algorithm for generating neuronal dendritic trees
1990
Abstract A simple, efficient algorithm is presented for generating the codewords of all neuronal dendritic trees with a given number of terminal nodes. Furthermore, a procedure is developed for deciding if different codewords correspond to topologically equivalent trees.
Periodic and Chaotic Orbits of a Neuron Model
2015
In this paper we study a class of difference equations which describes a discrete version of a single neuron model. We consider a generalization of the original McCulloch-Pitts model that has two thresholds. Periodic orbits are investigated accordingly to the different range of parameters. For some parameters sufficient conditions for periodic orbits of arbitrary periods have been obtained. We conclude that there exist values of parameters such that the function in the model has chaotic orbits. Models with chaotic orbits are not predictable in long-term.
Schaefer–Krasnoselskii fixed point theorems using a usual measure of weak noncompactness
2012
Abstract We present some extension of a well-known fixed point theorem due to Burton and Kirk [T.A. Burton, C. Kirk, A fixed point theorem of Krasnoselskii–Schaefer type, Math. Nachr. 189 (1998) 423–431] for the sum of two nonlinear operators one of them compact and the other one a strict contraction. The novelty of our results is that the involved operators need not to be weakly continuous. Finally, an example is given to illustrate our results.
On n–Fold Blocking Sets
1986
An n-fold blocking set is a set of n-disjoint blocking sets. We shall prove upper and lower bounds for the number of components in an n-fold blocking set in projective and affine spaces.
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…
Impact of common property (E.A.) on fixed point theorems in fuzzy metric spaces
2011
We observe that the notion of common property (E.A.) relaxes the required containment of range of one mapping into the range of other which is utilized to construct the sequence of joint iterates. As a consequence, a multitude of recent fixed point theorems of the existing literature are sharpened and enriched.
Fixed Points for Pseudocontractive Mappings on Unbounded Domains
2010
We give some fixed point results for pseudocontractive mappings on nonbounded domains which allow us to obtain generalizations of recent fixed point theorems of Penot, Isac, and Németh. An application to integral equations is given.
Three cyclic branched covers suffice to determine hyperbolic knots.
2005
Let n > m > 2 be two fixed coprime integers. We prove that two Conway reducible, hyperbolic knots sharing the 2-fold, m-fold and n-fold cyclic branched covers are equivalent. Using previous results by Zimmermann we prove that this implies that a hyperbolic knot is determined by any three of its cyclic branched covers.
Theory of tailor automata
2019
Abstract In the paper, a fragment of the new theory of tailor automata is presented, within which a deterministic finite automaton was defined. The proposed automaton provides a theoretical model of an informally characterized biomolecular automaton. The idea of working of which is founded on the concept of alternating cut of some double-stranded fragments of DNA, with the use of a restriction enzyme and ligations of some double-stranded fragments of DNA, with the use of the ligase enzyme.