Search results for "Complex."
showing 10 items of 5824 documents
Graded polynomial identities and codimensions: Computing the exponential growth
2010
Abstract Let G be a finite abelian group and A a G-graded algebra over a field of characteristic zero. This paper is devoted to a quantitative study of the graded polynomial identities satisfied by A. We study the asymptotic behavior of c n G ( A ) , n = 1 , 2 , … , the sequence of graded codimensions of A and we prove that if A satisfies an ordinary polynomial identity, lim n → ∞ c n G ( A ) n exists and is an integer. We give an explicit way of computing such integer by proving that it equals the dimension of a suitable finite dimension semisimple G × Z 2 -graded algebra related to A.
Probabilistic limit identification up to “small” sets
1996
In this paper we study limit identification of total recursive functions in the case when “small” sets of errors are allowed. Here the notion of “small” sets we formalize in a very general way, i.e. we define a notion of measure for subsets of natural numbers, and we consider as being small those sets, which are subsets of sets with zero measure.
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
2014
In the paper we investigate a model for computing of Boolean functions – Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity for several variants of OBDD models. We present some results on the comparative complexity of classical and quantum OBDDs. We consider a partial function depending on a parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2, but any classical OBDD (deterministic or stable bounded-error probabilistic) needs width 2 k + 1. We consider quantum and classical nondeterminism. We show that quantum nondeterminism can be more efficient …
The computational complexity of the relative robust shortest path problem with interval data
2004
Abstract The paper deals with the relative robust shortest path problem in a directed arc weighted graph, where arc lengths are specified as intervals containing possible realizations of arc lengths. The complexity status of this problem has been unknown in the literature. We show that the problem is NP -hard.
The computational complexity of the criticality problems in a network with interval activity times
2002
Abstract The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) for the case of network with interval activity duration times is given. The computation complexity of five problems linked to the introduced criticality notion is presented.
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…
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 …
Quantum Finite Automata and Logics
2006
The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.
PI-algebras with slow codimension growth
2005
Let $c_n(A),\ n=1,2,\ldots,$ be the sequence of codimensions of an algebra $A$ over a field $F$ of characteristic zero. We classify the algebras $A$ (up to PI-equivalence) in case this sequence is bounded by a linear function. We also show that this property is closely related to the following: if $l_n(A), \ n=1,2,\ldots, $ denotes the sequence of colengths of $A$, counting the number of $S_n$-irreducibles appearing in the $n$-th cocharacter of $A$, then $\lim_{n\to \infty} l_n(A)$ exists and is bounded by $2$.
The small-world of 'Le Petit Prince': Revisiting the word frequency distribution
2016
[EN] Many complex systems are naturally described through graph theory, and different kinds of systems described as networks present certain important characteristics in common. One of these features is the so-called scale-free distribution for its node s connectivity, which means that the degree distribution for the network s nodes follows a power law. Scale-free networks are usually referred to as small-world because the average distance between their nodes do not scale linearly with the size of the network, but logarithmically. Here we present a mathematical analysis on linguistics: the word frequency effect for different translations of the Le Petit Prince in different languages. Compar…