Bounding sequence extremal functions with formations

An $(r, s)$-formation is a concatenation of $s$ permutations of $r$ letters. If $u$ is a sequence with $r$ distinct letters, then let $\mathit{Ex}(u, n)$ be the maximum length of any $r$-sparse sequence with $n$ distinct letters which has no subsequence isomorphic to $u$. For every sequence $u$ define $\mathit{fw}(u)$, the formation width of $u$, to be the minimum $s$ for which there exists $r$ such that there is a subsequence isomorphic to $u$ in every $(r, s)$-formation. We use $\mathit{fw}(u)$ to prove upper bounds on $\mathit{Ex}(u, n)$ for sequences $u$ such that $u$ contains an alternation with the same formation width as $u$. We generalize Nivasch's bounds on $\mathit{Ex}((ab)^{t}, n)$ by showing that $\mathit{fw}((12 \ldots l)^{t})=2t-1$ and $\mathit{Ex}((12\ldots l)^{t}, n) =n2^{\frac{1}{(t-2)!}\alpha(n)^{t-2}\pm O(\alpha(n)^{t-3})}$ for every $l \geq 2$ and $t\geq 3$, such that $\alpha(n)$ denotes the inverse Ackermann function. Upper bounds on $\mathit{Ex}((12 \ldots l)^{t} , n)$ have been used in other papers to bound the maximum number of edges in $k$-quasiplanar graphs on $n$ vertices with no pair of edges intersecting in more than $O(1)$ points. If $u$ is any sequence of the form $a v a v' a$ such that $a$ is a letter, $v$ is a nonempty sequence excluding $a$ with no repeated letters and $v'$ is obtained from $v$ by only moving the first letter of $v$ to another place in $v$, then we show that $\mathit{fw}(u)=4$ and $\mathit{Ex}(u, n) =\Theta(n\alpha(n))$. Furthermore we prove that $\mathit{fw}(abc(acb)^{t})=2t+1$ and $\mathit{Ex}(abc(acb)^{t}, n) = n2^{\frac{1}{(t-1)!}\alpha(n)^{t-1}\pm O(\alpha(n)^{t-2})}$ for every $t\geq 2$.Comment: 25 page

Time Minimal Trajectories for a Spin 1/2 Particle in a Magnetic Field

In this paper we consider the minimum time population transfer problem for the $z$-component of the spin of a (spin 1/2) particle driven by a magnetic field, controlled along the x axis, with bounded amplitude. On the Bloch sphere (i.e. after a suitable Hopf projection), this problem can be attacked with techniques of optimal syntheses on 2-D manifolds. Let $(-E,E)$ be the two energy levels, and $|\Omega(t)|\leq M$ the bound on the field amplitude. For each couple of values $E$ and $M$, we determine the time optimal synthesis starting from the level $-E$ and we provide the explicit expression of the time optimal trajectories steering the state one to the state two, in terms of a parameter that can be computed solving numerically a suitable equation. For $M/E<<1$, every time optimal trajectory is bang-bang and in particular the corresponding control is periodic with frequency of the order of the resonance frequency $\omega_R=2E$. On the other side, for $M/E>1$, the time optimal trajectory steering the state one to the state two is bang-bang with exactly one switching. Fixed $E$ we also prove that for $M\to\infty$ the time needed to reach the state two tends to zero. In the case $M/E>1$ there are time optimal trajectories containing a singular arc. Finally we compare these results with some known results of Khaneja, Brockett and Glaser and with those obtained by controlling the magnetic field both on the $x$ and $y$ directions (or with one external field, but in the rotating wave approximation). As byproduct we prove that the qualitative shape of the time optimal synthesis presents different patterns, that cyclically alternate as $M/E\to0$, giving a partial proof of a conjecture formulated in a previous paper.Comment: 31 pages, 10 figures, typos correcte

Forbidden subposet problems for traces of set families

In this paper we introduce a problem that bridges forbidden subposet and forbidden subconfiguration problems. The sets $F_1,F_2, \dots,F_{|P|}$ form a copy of a poset $P$, if there exists a bijection $i:P\rightarrow \{F_1,F_2, \dots,F_{|P|}\}$ such that for any $p,p'\in P$ the relation $p<_P p'$ implies $i(p)\subsetneq i(p')$. A family $\mathcal{F}$ of sets is \textit{$P$-free} if it does not contain any copy of $P$. The trace of a family $\mathcal{F}$ on a set $X$ is $\mathcal{F}|_X:=\{F\cap X: F\in \mathcal{F}\}$. We introduce the following notions: $\mathcal{F}\subseteq 2^{[n]}$ is $l$-trace $P$-free if for any $l$-subset $L\subseteq [n]$, the family $\mathcal{F}|_L$ is $P$-free and $\mathcal{F}$ is trace $P$-free if it is $l$-trace $P$-free for all $l\le n$. As the first instances of these problems we determine the maximum size of trace $B$-free families, where $B$ is the butterfly poset on four elements $a,b,c,d$ with $a,b<c,d$ and determine the asymptotics of the maximum size of $(n-i)$-trace $K_{r,s}$-free families for $i=1,2$. We also propose a generalization of the main conjecture of the area of forbidden subposet problems