Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under $\theta$ ($\theta$-invariant for short).We establish an extension of the famous defect theorem. Moreover, we prove that for the so-called thin $\theta$-invariant codes, maximality and completeness are two equivalent notions. We prove that a similar property holds in the framework of some special families of $\theta$-invariant codes such as prefix (bifix) codes, codes with a finite deciphering delay, uniformly synchronized codes and circular codes. For a special class of involutive antimorphisms, we prove that any regular $\theta$-invariant code may be embedded into a complete one.Comment: To appear in Acts of WORDS 201

Electrical stimulation with non-implanted devices for stress urinary incontinence in women

The authors would like to thank Luke Vale, Imran Omar, Sheila Wallace and Suzanne MacDonald at the Cochrane Incontinence Group for their support. We would also like to thank Mette Frahm Olsen, Gavin Stewart, Miriam Brazelli, Anna Sierawska, and Beatriz Gualeo for help with translations.Peer reviewedPublisher PD

Unifying Einstein and Palatini gravities

We consider a novel class of $f(\R)$ gravity theories where the connection is related to the conformally scaled metric $\hat g_{\mu\nu}=C(\R)g_{\mu\nu}$ with a scaling that depends on the scalar curvature $\R$ only. We call them C-theories and show that the Einstein and Palatini gravities can be obtained as special limits. In addition, C-theories include completely new physically distinct gravity theories even when $f(\R)=\R$. With nonlinear $f(\R)$, C-theories interpolate and extrapolate the Einstein and Palatini cases and may avoid some of their conceptual and observational problems. We further show that C-theories have a scalar-tensor formulation, which in some special cases reduces to simple Brans-Dicke-type gravity. If matter fields couple to the connection, the conservation laws in C-theories are modified. The stability of perturbations about flat space is determined by a simple condition on the lagrangian.Comment: 17 pages, no figure

k-Spectra of weakly-c-Balanced Words

A word $u$ is a scattered factor of $w$ if $u$ can be obtained from $w$ by deleting some of its letters. That is, there exist the (potentially empty) words $u_1,u_2,..., u_n$, and $v_0,v_1,..,v_n$ such that $u = u_1u_2...u_n$ and $w = v_0u_1v_1u_2v_2...u_nv_n$. We consider the set of length-$k$ scattered factors of a given word w, called here $k$-spectrum and denoted \ScatFact_k(w). We prove a series of properties of the sets \ScatFact_k(w) for binary strictly balanced and, respectively, $c$-balanced words $w$, i.e., words over a two-letter alphabet where the number of occurrences of each letter is the same, or, respectively, one letter has $c$-more occurrences than the other. In particular, we consider the question which cardinalities n= |\ScatFact_k(w)| are obtainable, for a positive integer $k$, when $w$ is either a strictly balanced binary word of length $2k$, or a $c$-balanced binary word of length $2k-c$. We also consider the problem of reconstructing words from their $k$-spectra

College Readiness Initiative: AVID and Navigation 101

The purpose of this report is to provide summative feedback to personnel at the Office of Superintendent of Public Instruction (OSPI) and at the College Spark Washington regarding evidence of implementation and impact of the Advancement via Individual Determination (AVID) and Navigation 101 programs in schools funded by the College Readiness Initiative (CRI) in Washington State. The report, while addressing the effects of both programs, is also designed to provide formative feedback to assist in ongoing program development

The finite tiling problem is undecidable in the hyperbolic plane

In this paper, we consider the finite tiling problem which was proved undecidable in the Euclidean plane by Jarkko Kari in 1994. Here, we prove that the same problem for the hyperbolic plane is also undecidable

Pathophysiological Implications of Different Bicuspid Aortic Valve Configurations

There are numerous types of bicuspid aortic valve (BAV) configurations. Recent findings suggest that various BAV types represent different pathophysiological substrates on the aortic media level. Data imply that the BAV type is probably not related to location and extent of the aneurysm. However, BAV type is likely linked to the severity of aortic media disease. Some BAVs with raphe seem more aggressive than BAV without a raphe. Cusp fusion pattern, altered hemodynamics, and the qualitative severity of the disease in the aortic media might on the one hand share the same substrate. On the other hand, the aortopathy's longitudinal extent and location may represent a different pathophysiological substrate, probably dictated by the heritable aspects of BAV disease. The exact nature of the relation between BAV type and the aneurysm's location and extent as well as to the risk of aortic complications remains unclear. This paper reviews results of recent human and experimental studies on the significance of BAV types for local aortic media disease and location and extent of the aortopathy. We describe the known and hypothesized hemodynamic and hereditary factors that may result in aortic aneurysm formation in BAV patients

Von Neumann Regular Cellular Automata

For any group $G$ and any set $A$, a cellular automaton (CA) is a transformation of the configuration space $A^G$ defined via a finite memory set and a local function. Let $\text{CA}(G;A)$ be the monoid of all CA over $A^G$. In this paper, we investigate a generalisation of the inverse of a CA from the semigroup-theoretic perspective. An element $\tau \in \text{CA}(G;A)$ is von Neumann regular (or simply regular) if there exists $\sigma \in \text{CA}(G;A)$ such that $\tau \circ \sigma \circ \tau = \tau$ and $\sigma \circ \tau \circ \sigma = \sigma$, where $\circ$ is the composition of functions. Such an element $\sigma$ is called a generalised inverse of $\tau$. The monoid $\text{CA}(G;A)$ itself is regular if all its elements are regular. We establish that $\text{CA}(G;A)$ is regular if and only if $\vert G \vert = 1$ or $\vert A \vert = 1$, and we characterise all regular elements in $\text{CA}(G;A)$ when $G$ and $A$ are both finite. Furthermore, we study regular linear CA when $A= V$ is a vector space over a field $\mathbb{F}$; in particular, we show that every regular linear CA is invertible when $G$ is torsion-free elementary amenable (e.g. when $G=\mathbb{Z}^d, \ d \in \mathbb{N}$) and $V=\mathbb{F}$, and that every linear CA is regular when $V$ is finite-dimensional and $G$ is locally finite with $\text{Char}(\mathbb{F}) \nmid o(g)$ for all $g \in G$.Comment: 10 pages. Theorem 5 corrected from previous versions, in A. Dennunzio, E. Formenti, L. Manzoni, A.E. Porreca (Eds.): Cellular Automata and Discrete Complex Systems, AUTOMATA 2017, LNCS 10248, pp. 44-55, Springer, 201

On Factor Universality in Symbolic Spaces

The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on an operation of rescaling is receiving more and more attention in the literature. In this paper, we propose to study the factoring relation up to rescalings, and ask for the existence of universal objects for that simulation relation. In classical simulations of a system S by a system T, the simulation takes place on a specific subset of configurations of T depending on S (this is the case for intrinsic universality). Our setting, however, asks for every configurations of T to have a meaningful interpretation in S. Despite this strong requirement, we show that there exists a cellular automaton able to simulate any other in a large class containing arbitrarily complex ones. We also consider the case of subshifts and, using arguments from recursion theory, we give negative results about the existence of universal objects in some classes