Search results for "Complex."
showing 10 items of 5824 documents
Polynomial codimension growth and the Specht problem
2017
Abstract We construct a continuous family of algebras over a field of characteristic zero with slow codimension growth bounded by a polynomial of degree 4. This is achieved by building, for any real number α ∈ ( 0 , 1 ) a commutative nonassociative algebra A α whose codimension sequence c n ( A α ) , n = 1 , 2 , … , is polynomially bounded and lim log n c n ( A α ) = 3 + α . As an application we are able to construct a new example of a variety with an infinite basis of identities.
Nonlinear embeddings: Applications to analysis, fractals and polynomial root finding
2016
We introduce $\mathcal{B}_{\kappa}$-embeddings, nonlinear mathematical structures that connect, through smooth paths parameterized by $\kappa$, a finite or denumerable set of objects at $\kappa=0$ (e.g. numbers, functions, vectors, coefficients of a generating function...) to their ordinary sum at $\kappa \to \infty$. We show that $\mathcal{B}_{\kappa}$-embeddings can be used to design nonlinear irreversible processes through this connection. A number of examples of increasing complexity are worked out to illustrate the possibilities uncovered by this concept. These include not only smooth functions but also fractals on the real line and on the complex plane. As an application, we use $\mat…
Polynomial identities on superalgebras: Classifying linear growth
2006
Abstract We classify, up to PI-equivalence, the superalgebras over a field of characteristic zero whose sequence of codimensions is linearly bounded. As a consequence we determine the linear functions describing the graded codimensions of a superalgebra.
Codimension and colength sequences of algebras and growth phenomena
2015
We consider non necessarily associative algebras over a field of characteristic zero and their polynomial identities. Here we describe some of the results obtained in recent years on the sequence of codimensions and the sequence of colengths of an algebra.
Deciding reachability for planar multi-polynomial systems
1996
In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state space corresponds to the standard Euclidean plane, which is partitioned into a finite number of (polyhedral) regions. To each of these regions is assigned some vector field which governs the dynamical behaviour of the system within this region. We prove the decidability of point to point and region to region reachability problems for planar hybrid systems for the case when trajectories within the regions can be described by polynomials of arbitrary degree.
On algebras of polynomial codimension growth
2016
Let A be an associative algebra over a field F of characteristic zero and let $$c_n(A), n=1, 2, \ldots $$ , be the sequence of codimensions of A. It is well-known that $$c_n(A), n=1, 2, \ldots $$ , cannot have intermediate growth, i.e., either is polynomially bounded or grows exponentially. Here we present some results on algebras whose sequence of codimensions is polynomially bounded.
Amount of Nonconstructivity in Finite Automata
2009
When D. Hilbert used nonconstructive methods in his famous paper on invariants (1888), P.Gordan tried to prevent the publication of this paper considering these methods as non-mathematical. L. E. J. Brouwer in the early twentieth century initiated intuitionist movement in mathematics. His slogan was "nonconstructive arguments have no value for mathematics". However, P. Erdos got many exciting results in discrete mathematics by nonconstructive methods. It is widely believed that these results either cannot be proved by constructive methods or the proofs would have been prohibitively complicated. R.Freivalds [7] showed that nonconstructive methods in coding theory are related to the notion of…
A note on Sturmian words
2012
International audience; We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the same length in the lexicographic order in linear time. It is based on a combinatorial property of Sturmian words which is related with the Burrows-Wheeler transformation.
Codimension growth and minimal superalgebras
2003
A celebrated theorem of Kemer (1978) states that any algebra satisfying a polynomial identity over a field of characteristic zero is PI-equivalent to the Grassmann envelope G(A) of a finite dimensional superalgebra A. In this paper, by exploiting the basic properties of the exponent of a PI-algebra proved by Giambruno and Zaicev (1999), we define and classify the minimal superalgebras of a given exponent over a field of characteristic zero. In particular we prove that these algebras can be realized as block-triangular matrix algebras over the base field. The importance of such algebras is readily proved: A is a minimal superalgebra if and only if the ideal of identities of G(A) is a product…
Symplectic automorphisms of prime order on K3 surfaces
2006
The aim of this paper is to study algebraic K3 surfaces (defined over the complex number field) with a symplectic automorphism of prime order. In particular we consider the action of the automorphism on the second cohomology with integer coefficients. We determine the invariant sublattice and its perpendicular complement, and show that the latter coincides with the Coxeter-Todd lattice in the case of automorphism of order three. We also compute many explicit examples, with particular attention to elliptic fibrations.