83,214 research outputs found
On prefixal factorizations of words
We consider the class of all infinite words over
a finite alphabet admitting a prefixal factorization, i.e., a factorization
where each is a non-empty prefix of With
each one naturally associates a "derived" infinite word
which may or may not admit a prefixal factorization. We are
interested in the class of all words of
such that for all . Our primary
motivation for studying the class stems from its connection
to a coloring problem on infinite words independently posed by T. Brown in
\cite{BTC} and by the second author in \cite{LQZ}. More precisely, let be the class of all words such that for every finite
coloring there exist and a factorization
with for each In \cite{DPZ}
we conjectured that a word if and only if is purely
periodic. In this paper we show that so
in other words, potential candidates to a counter-example to our conjecture are
amongst the non-periodic elements of We establish several
results on the class . In particular, we show that a
Sturmian word belongs to if and only if is
nonsingular, i.e., no proper suffix of is a standard Sturmian word
The sequence of open and closed prefixes of a Sturmian word
A finite word is closed if it contains a factor that occurs both as a prefix
and as a suffix but does not have internal occurrences, otherwise it is open.
We are interested in the {\it oc-sequence} of a word, which is the binary
sequence whose -th element is if the prefix of length of the word is
open, or if it is closed. We exhibit results showing that this sequence is
deeply related to the combinatorial and periodic structure of a word. In the
case of Sturmian words, we show that these are uniquely determined (up to
renaming letters) by their oc-sequence. Moreover, we prove that the class of
finite Sturmian words is a maximal element with this property in the class of
binary factorial languages. We then discuss several aspects of Sturmian words
that can be expressed through this sequence. Finally, we provide a linear-time
algorithm that computes the oc-sequence of a finite word, and a linear-time
algorithm that reconstructs a finite Sturmian word from its oc-sequence.Comment: Published in Advances in Applied Mathematics. Journal version of
arXiv:1306.225
Some characterizations of Sturmian words in terms of the lexicographic order
In this paper we present three new characterizations of Sturmian words based
on the lexicographic ordering of their factors
User fees impact access to healthcare for female children in rural Zambia
The World Bank and International Monetary Fund favor healthcare user fees. User fees offer revenue and may decrease inappropriate care. However, user fees may deter needed care, especially in vulnerable populations. A cross-sectional analysis of healthcare utilization in a large Zambian hospital was conducted for children 3-6 years of age during a 1-month observation period. Diagnoses and treatments were compared using paired t-tests. Chi-squared tests compared outpatient service use. The relative risk of admission was determined for each stratum. Logistic models were developed to evaluate the impact of age, gender, and the age-gender interaction on hospital admissions. Trends suggest female children may be less likely to present for care when user fees are imposed. However, treatment type, treatment number, and number of diagnoses did not differ between genders. The relative risk of admission was highest for males 5-6 years old. Neither age nor gender alone was a significant determinant of hospital admission. However, the age-gender interaction was significant with female admissions least likely when costs were incurred. We conclude that user fees appear to decrease differentially utilization of inpatient care for female children in rural Zambia
A Coloring Problem for Infinite Words
In this paper we consider the following question in the spirit of Ramsey
theory: Given where is a finite non-empty set, does there
exist a finite coloring of the non-empty factors of with the property that
no factorization of is monochromatic? We prove that this question has a
positive answer using two colors for almost all words relative to the standard
Bernoulli measure on We also show that it has a positive answer for
various classes of uniformly recurrent words, including all aperiodic balanced
words, and all words satisfying
for all sufficiently large, where denotes the number of
distinct factors of of length Comment: arXiv admin note: incorporates 1301.526
Analyses of pion-nucleon elastic scattering amplitudes up to in extended-on-mass-shell subtraction scheme
We extend the analysis of elastic pion-nucleon scattering up to
level using extended-on-mass-shell subtraction scheme within the framework of
covariant baryon chiral perturbation theory. Numerical fits to partial wave
phase shift data up to GeV are performed to pin down the free
low energy constants. A good description to the existing phase shift data is
achieved. We find a good convergence for the chiral series at ,
considerably improved with respect to the -level analyses found in
previous literature. Also, the leading order contribution from explicit
resonance and partially-included loop
contribution are included to describe phase shift data up to
GeV. As phenomenological applications, we investigate chiral correction to the
Goldberger-Treiman relation % and find that it converges rapidly,
and the correction is found to be very small: . We also
get a reasonable prediction of pion-nucleon sigma term up to
by performing fits including both the pion-nucleon partial wave phase
shift data and the lattice QCD data. We report that MeV
from the fit without , and MeV from the
fit with explicit .Comment: The final version published in Phys.Rev. D 87, 054019 (2013
Modeling soil system:complexity under your feet
This is an introductory articl
Dark Matter, Sparticle Spectroscopy and Muon in
We explore the sparticle mass spectra including LSP dark matter within the
framework of supersymmetric (422)
models, taking into account the constraints from extensive LHC and cold dark
matter searches. The soft supersymmetry-breaking parameters at can be
non-universal, but consistent with the 422 symmetry. We identify a variety of
coannihilation scenarios compatible with LSP dark matter, and study the
implications for future supersymmetry searches and the ongoing muon g-2
experiment.Comment: 21 pages, 8 fig
- …