34,872 research outputs found
The rank of variants of nilpotent pseudovarieties
We investigate the rank of pseudovarieties defined by several of the variants
of nilpotency conditions for semigroups in the sense of Mal'cev. For several of
them, we provide finite bases of pseudoidentities. We also show that the
Neumann-Taylor variant does not have finite rank.Comment: 41 page
DMRG study of the Bond Alternating \textbf{S}=1/2 Heisenberg ladder with Ferro-Antiferromagnetic couplings
We obtain the phase diagram in the parameter space and an
accurate estimate of the critical line separating the different phases. We show
several measuments of the magnetization, dimerization, nearest neighbours
correlation, and density of energy in the different zones of the phase diagram,
as well as a measurement of the string order parameter proposed as the non
vanishing phase order parameter characterizing Haldane phases. All these
results will be compared in the limit with the behaviour of the
Bond Alternated Heisenberg Chain (BAHC). The analysis of our
data supports the existence of a dimer phase separated by a critical line from
a Haldane one, which has exactly the same nature as the Haldane phase in the
BAHC.Comment: Version 4. 8 pages, 15 figures (12 figures in document
New zoarcid fish species from deep-sea hydrothermal vents of the Atlantic
International Ridge-Crest Research: Biological Studies. Vol. 10(1): 15-1
The omega-inequality problem for concatenation hierarchies of star-free languages
The problem considered in this paper is whether an inequality of omega-terms
is valid in a given level of a concatenation hierarchy of star-free languages.
The main result shows that this problem is decidable for all (integer and half)
levels of the Straubing-Th\'erien hierarchy
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine
regular languages equality. Antimirov and Mosses proposed a rewrite system for
deciding regular expressions equivalence of which Almeida et al. presented an
improved variant. Hopcroft and Karp proposed an almost linear algorithm for
testing the equivalence of two deterministic finite automata that avoids
minimisation. In this paper we improve the best-case running time, present an
extension of this algorithm to non-deterministic finite automata, and establish
a relationship between this algorithm and the one proposed in Almeida et al. We
also present some experimental comparative results. All these algorithms are
closely related with the recent coalgebraic approach to automata proposed by
Rutten
Generalized Euler-Lagrange equations for variational problems with scale derivatives
We obtain several Euler-Lagrange equations for variational functionals
defined on a set of H\"older curves. The cases when the Lagrangian contains
multiple scale derivatives, depends on a parameter, or contains higher-order
scale derivatives are considered.Comment: Submitted on 03-Aug-2009; accepted for publication 16-March-2010; in
"Letters in Mathematical Physics"
- …