A pairwise almost disjoint subspace of kN of maximal dimension

We show that if k is an infinite field, then there exists a subspace $W?k^{\mathbb{N}}$ of dimension $|k{|}^{{\mathrm{?}}_0}$, such that no nonzero member of W has infinitely many zeros. This generalizes a result from a paper by Bergman and Nahlus, and partly answers another question from the same paper.     

Fermat-type configurations of lines in P3 and the containment problem

The purpose of this note is to show a new series of examples of homogeneous ideals I in $\mathbb{K}[x,y,z,w]$ for which the containment $I^{(3)}?I^2$ fails. These ideals are supported on certain arrangements of lines in ${\mathbb{P}}^3$, which resemble Fermat configurations of points in ${\mathbb{P}}^2$, see [14]. All examples exhibiting the failure of the containment $I^{(3)}?I^2$ constructed so far have been supported on points or cones over configurations of points. Apart from providing new counterexamples, these ideals seem quite interesting on their own.     

Analysis of random walks in dynamic random environments via L2-perturbations

We consider random walks in dynamic random environments given by Markovian dynamics on ${\mathbb{Z}}^d$. We assume that the environment has a stationary distribution $\mu$ and satisfies the Poincaré inequality w.r.t. $\mu$. The random walk is a perturbation of another random walk (called “unperturbed”). We assume that also the environment viewed from the unperturbed random walk has stationary distribution $\mu$. Both perturbed and unperturbed random walks can depend heavily on the environment and are not assumed to be finite-range. We derive a law of large numbers, an averaged invariance principle for the position of the walker and a series expansion for the asymptotic speed. We also provide a condition for non-degeneracy of the diffusion, and describe in some details equilibrium and convergence properties of the environment seen by the walker. All these results are based on a more general perturbative analysis of operators that we derive in the context of $L^2$- bounded perturbations of Markov processes by means of the so-called Dyson–Phillips expansion.     

A note on exact convergence rate in the local limit theorem for a lattice branching random walk

Consider a branching random walk, where the underlying branching mechanism is governed by a Galton-Watson process and the moving law of particles by a discrete random variable on the integer lattice Z. Denote by Z_n(z) the number of particles in the n-th generation in the model for each z ∈ Z. We derive the exact convergence rate in the local limit theorem for Z_n(z) assuming a condition like "EN(log N)~(1+λ) ∞" for the offspring distribution and a finite moment condition on the motion law. This complements the known results for the strongly non-lattice branching random walk on the real line and for the simple symmetric branching random walk on the integer lattice.     

A sharp bound on the expected number of upcrossings of an L2-bounded Martingale

For a martingale $M$ starting at $x$ with final variance ${\sigma }^2$, and an interval $(a,b)$, let $\Delta =\frac{b?a}{\sigma }$ be the normalized length of the interval and let $\delta =\frac{|x?a|}{\sigma }$ be the normalized distance from the initial point to the lower endpoint of the interval. The expected number of upcrossings of $(a,b)$ by $M$ is at most $\frac{\sqrt{1+{\delta }^2}?\delta }{2\Delta }$ if ${\Delta }^2\le 1+{\delta }^2$ and at most $\frac{1}{1+{(\Delta +\delta )}^2}$ otherwise. Both bounds are sharp, attained by Standard Brownian Motion stopped at appropriate stopping times. Both bounds also attain the Doob upper bound on the expected number of upcrossings of $(a,b)$ for submartingales with the corresponding final distribution. Each of these two bounds is at most $\frac{\sigma }{2(b?a)}$, with equality in the first bound for $\delta =0$. The upper bound $\frac{\sigma }{2}$ on the length covered by $M$ during upcrossings of an interval restricts the possible variability of a martingale in terms of its final variance. This is in the same spirit as the Dubins & Schwarz sharp upper bound $\sigma$ on the expected maximum of $M$ above $x$, the Dubins & Schwarz sharp upper bound $\sigma \sqrt{2}$ on the expected maximal distance of $M$ from $x$, and the Dubins, Gilat & Meilijson sharp upper bound $\sigma \sqrt{3}$ on the expected diameter of $M$.     

Subspace partitions of Fqn containing direct sums

Let $q$ be a prime power and $n$ be a positive integer. A subspace partition of $V={\mathbb{F}}_q^n$, the vector space of dimension $n$ over ${\mathbb{F}}_q$, is a collection $\Pi$ of subspaces of $V$ such that each nonzero vector of $V$ is contained in exactly one subspace in $\Pi$; the multiset of dimensions of subspaces in $\Pi$ is then called a Gaussian partition of $V$. We say that $\Pi$contains a direct sum if there exist subspaces $W_1,\dots ,W_k\in \Pi$ such that $W_1\oplus ?\oplus W_k=V$. In this paper, we study the problem of classifying the subspace partitions that contain a direct sum. In particular, given integers $a_1$ and $a_2$ with $n>a_1>a_2\ge 1$, our main theorem shows that if $\Pi$ is a subspace partition of ${\mathbb{F}}_q^n$ with $m_i$ subspaces of dimension $a_i$ for $i=1,2$, then $\Pi$ contains a direct sum when $a_1{x}_1+a_2{x}_2=n$ has a solution $(x_1,x_2)$ for some integers $x_1,x_2\ge 0$ and $m_2$ belongs to the union $I$ of two natural intervals. The lower bound of $I$ captures all subspace partitions with dimensions in $\{a_1,a_2\}$ that are currently known to exist. Moreover, we show the existence of infinite classes of subspace partitions without a direct sum when $m_2?I$ or when the condition on the existence of a nonnegative integral solution $(x_1,x_2)$ is not satisfied. We further conjecture that this theorem can be extended to any number of distinct dimensions, where the number of subspaces in each dimension has appropriate bounds. These results offer further evidence of the natural combinatorial relationship between Gaussian and integer partitions (when $q\to 1$) as well as subspace and set partitions.     

Global,decaying solutions of a focusing energy-critical heat equation in R4

We study solutions of the focusing energy-critical nonlinear heat equation $u_t=\mathrm{\Delta }u?|u{|}^{2}u$ in ${\mathbb{R}}^4$. We show that solutions emanating from initial data with energy and ${\dot{H}}^1$-norm below those of the stationary solution W are global and decay to zero, via the “concentration-compactness plus rigidity” strategy of Kenig–Merle [33], [34]. First, global such solutions are shown to dissipate to zero, using a refinement of the small data theory and the $L^2$-dissipation relation. Finite-time blow-up is then ruled out using the backwards-uniqueness of Escauriaza–Seregin–Sverak [17], [18] in an argument similar to that of Kenig–Koch [32] for the Navier–Stokes equations.     

On q-Steiner systems from rank metric codes

In this paper we prove that rank metric codes with special properties imply the existence of $q$-analogs of suitable designs. More precisely, we show that the minimum weight vectors of a $[2d,d,d]$ dually almost MRD code $C\le {\mathbb{F}}_{q^m}^{2d}$$(2d\le m)$ which has no code words of rank weight $d+1$ form a $q$-Steiner system $S{(d?1,d,2d)}_q$. This is the q-analog of a result in classical coding theory and it may be seen as a first step to prove a q-analog of the famous Assmus–Mattson Theorem.     

Bijections between generalized Catalan families of types A and C

Motivated by the relation ${\mathsf{N}}^m\left(C_n\right)=(mn+1){\mathsf{N}}^m\left(A_{n?1}\right)$, holding for the $m$-generalized Catalan numbers of type $A$ and $C$, the connection between dominant regions of the $m$-Shi arrangement of type $A_{n?1}$ and $C_n$ is investigated. More precisely, it is explicitly shown how $mn+1$ copies of the set of dominant regions of the $m$-Shi arrangement of type $A_{n?1}$, biject onto the set of type $C_n$ such regions. This is achieved by exploiting two different viewpoints of the representative alcove of each region: the Shi tableau and the abacus diagram. In the same line of thought, a bijection between $mn+1$ copies of the set of $m$-Dyck paths of height $n$ and the set of $N?E$ lattice paths inside an $n\times mn$ rectangle is provided.     

Spread of a catalytic branching random walk on a multidimensional lattice

For a supercritical catalytic branching random walk on ${\mathbb{Z}}^d$, $d\in \mathbb{N}$, with an arbitrary finite catalysts set we study the spread of particles population as time grows to infinity. It is shown that in the result of the proper normalization of the particles positions in the limit there are a.s. no particles outside the closed convex surface in ${\mathbb{R}}^d$ which we call the propagation front and, under condition of infinite number of visits of the catalysts set, a.s. there exist particles on the propagation front. We also demonstrate that the propagation front is asymptotically densely populated and derive its alternative representation.     

2p-cycle decompositions of some regular graphs and digraphs

In this paper, we consider $2k$-cycle decomposition of $K_m\times K_n$ and directed $2k$-cycle decompositions of ${(K_m°{\overline{K}}_n)}^1$ and ${(K_m\times K_n)}^1$, where $°$ and $\times$ denote the wreath product and tensor product of graphs, respectively. Using the results obtained here, we prove that for $m,n\ge 3$, the obvious necessary conditions for the existence of a $C_{2k}$-decomposition of $K_m\times K_n$ are sufficient whenever $k\in \{p,2^{?}\},$ where $p$ is a prime and $?\ge 2$. Also, we show that the necessary conditions for the existence of ${\overrightarrow{C}}_{2p}$-decompositions of ${(K_m°{\overline{K}}_n)}^1$ and ${(K_m\times K_n)}^1$ are sufficient whenever $p$ is a prime, where ${\overrightarrow{C}}_{2p}$ denotes the directed cycle of length $2p$.