Random triangle removal

Starting from a complete graph on n   vertices, repeatedly delete the edges of a uniformly chosen triangle. This stochastic process terminates once it arrives at a triangle-free graph, and the fundamental question is to estimate the final number of edges (equivalently, the time it takes the process to finish, or how many edge-disjoint triangles are packed via the random greedy algorithm). Bollobás and Erd?s (1990) conjectured that the expected final number of edges has order n^3/2$n^{3/2}$. An upper bound of o(n²)$o(n^2)$ was shown by Spencer (1995) and independently by Rödl and Thoma (1996). Several bounds were given for variants and generalizations (e.g., Alon, Kim and Spencer (1997) and Wormald (1999)), while the best known upper bound for the original question of Bollobás and Erd?s was n^7/4+o(1)$n^{7/4+o(1)}$ due to Grable (1997). No nontrivial lower bound was available.     

On Waringʼs problem for systems of skew-symmetric forms

This paper is devoted to a problem of finding the smallest positive integer s(m,n,k)$s(m,n,k)$ such that (m+1)$(m+1)$ generic skew-symmetric (k+1)$(k+1)$-forms in (n+1)$(n+1)$ variables as linear combinations of the same s(m,n,k)$s(m,n,k)$ decomposable skew-symmetric (k+1)$(k+1)$-forms.     

Random partitions and edge-disjoint Hamiltonian cycles

Nash-Williams [1] proved that every graph with n   vertices and minimum degree n/2$n/2$ has at least ⌊5n/224⌋$\lfloor 5n/224\rfloor$ edge-disjoint Hamiltonian cycles. In [2], he raised the question of determining the maximum number of edge-disjoint Hamiltonian cycles, showing an upper bound of ⌊(n+4)/8⌋$\lfloor (n+4)/8\rfloor$.     

Re-nnd generalized inverses

In this paper, we give some necessary and sufficient conditions for the existence of Re-nnd and nonnegative definite {1,3}$\{1,3\}$- and {1,4}$\{1,4\}$-inverses of a matrix A∈C^n×n$A\in {\mathbb{C}}^{n\times n}$ and completely described these sets. Moreover, we prove that the existence of nonnegative definite {1,3}$\{1,3\}$-inverse of a matrix A   is equivalent with the existence of its nonnegative definite {1,2,3}$\{1,2,3\}$-inverse and present the necessary and sufficient conditions for the existence of Re-nnd {1,3,4}$\{1,3,4\}$-inverse of A.     

Sur la répartition des puissances modulo 1

For almost all x>1$x>1$, (xⁿ)$(x^n)$(n=1,2,…)$(n=1,2,\dots )$ is equidistributed modulo 1, a classical result. What can be said on the exceptional set? It has Hausdorff dimension one. Much more: given an (b_n)$(b_n)$ in [0,1[$[0,1[$ and ε>0$\epsilon >0$, the x  -set such that |xⁿ−b_n|<ε$|x^n-b_n|<\epsilon$ modulo 1 for n   large enough has dimension 1. However, its intersection with an interval [1,X]$[1,X]$ has a dimension <1, depending on ε and X. Some results are given and a question is proposed.     

Distances of group tables and latin squares via equilateral triangle dissections

Denote by gdist(p)$\mathrm{gdist}(p)$ the least non-zero number of cells that have to be changed to get a latin square from the table of addition modulo p  . A conjecture of Drápal, Cavenagh and Wanless states that there exists c>0$c>0$ such that gdist(p)?clog(p)$\mathrm{gdist}(p)?c\log (p)$. In this paper the conjecture is proved for c≈7.21$c\approx 7.21$, and as an intermediate result it is shown that an equilateral triangle of side n   can be non-trivially dissected into at most 5_log2(n)$5{\log }_2(n)$ integer-sided equilateral triangles. The paper also presents some evidence which suggests that gdist(p)/log(p)≈3.56$\mathrm{gdist}(p)/\log (p)\approx 3.56$ for large values of p.     

An approximation method for strictly pseudocontractive mappings

Let K$K$ be a closed convex subset of a q$q$-uniformly smooth separable Banach space, T:K→K$T:K\to K$ a strictly pseudocontractive mapping, and f:K→K$f:K\to K$ an L$L$-Lispschitzian strongly pseudocontractive mapping. For any t∈(0,1)$t\in (0,1)$, let _xt$x_t$ be the unique fixed point of tf+(1-t)T$\mathit{tf}+(1-t)T$. We prove that if T$T$ has a fixed point, then {_xt}$\{x_t\}$ converges to a fixed point of T$T$ as t$t$ approaches to 0.     

Diagonals and numerical ranges of direct sums of matrices

For any n-by-n matrix A  , we consider the maximum number k=k(A)$k=k(A)$ for which there is a k-by-k compression of A   with all its diagonal entries in the boundary ∂W(A)$\partial W(A)$ of the numerical range W(A)$W(A)$ of A. If A   is a normal or a quadratic matrix, then the exact value of k(A)$k(A)$ can be computed. For a matrix A   of the form B⊕C$B\oplus C$, we show that k(A)=2$k(A)=2$ if and only if the numerical range of one summand, say, B is contained in the interior of the numerical range of the other summand C   and k(C)=2$k(C)=2$. For an irreducible matrix A  , we can determine exactly when the value of k(A)$k(A)$ equals the size of A  . These are then applied to determine k(A)$k(A)$ for a reducible matrix A   of size 4 in terms of the shape of W(A)$W(A)$.     

Dimension spectra of random subfractals of self-similar fractals

The dimension of a point x   in Euclidean space (meaning the constructive Hausdorff dimension of the singleton set {x}$\{x\}$) is the algorithmic information density of x  . Roughly speaking, this is the least real number dim(x)$\dim (x)$ such that r×dim(x)$r\times \dim (x)$ bits suffice to specify x   on a general-purpose computer with arbitrarily high precision 2^−r$2^{-r}$. The dimension spectrum of a set X   in Euclidean space is the subset of [0,n]$[0,n]$ consisting of the dimensions of all points in X.     

Best constants in a borderline case of second-order Moser type inequalities

We study optimal embeddings for the space of functions whose Laplacian Δu   belongs to L¹(Ω)$L^1(\Omega )$, where Ω⊂RN$\Omega \subset {\mathbb{R}}^N$ is a bounded domain. This function space turns out to be strictly larger than the Sobolev space W2,1(Ω)$W^{2,1}(\Omega )$ in which the whole set of second-order derivatives is considered. In particular, in the limiting Sobolev case, when N=2$N=2$, we establish a sharp embedding inequality into the Zygmund space Lexp(Ω)$L_{\mathit{exp}}(\Omega )$. On one hand, this result enables us to improve the Brezis–Merle (Brezis and Merle (1991) [13]) regularity estimate for the Dirichlet problem Δu=f(x)∈L¹(Ω)$\mathrm{\Delta }u=f(x)\in L^1(\Omega )$, u=0$u=0$ on ∂Ω; on the other hand, it represents a borderline case of D.R. Adams' (1988) [1] generalization of Trudinger–Moser type inequalities to the case of higher-order derivatives. Extensions to dimension N?3$N?3$ are also given. Besides, we show how the best constants in the embedding inequalities change under different boundary conditions.     

Derivations and local derivations on Freudenthal almost f-algebras

Let A be an Archimedean f  -algebra and let N(A)$N(A)$ be the set of all nilpotent elements of A. Colville et al. [4] proved that a positive linear map d:A→A$d:A\to A$ is a derivation if and only if d(A)⊂N(A)$d(A)\subset N(A)$ and d(A²)={0}$d(A^2)=\{0\}$, where A²$A^2$ is the set of all products ab in A.     

Inequalities for ranks of partitions and the first moment of ranks and cranks of partitions

We prove two monotonicity properties of N(m,n)$N(m,n)$, the number of partitions of n with rank m. They are (i) for any nonnegative integers m and n,

N(m,n)?N(m+2,n),$N(m,n)?N(m+2,n),$

and, (ii) for any nonnegative integers m and n   such that n?12$n?12$, n≠m+2$n\ne m+2$,

N(m,n)?N(m,n−1).$N(m,n)?N(m,n-1).$

G.E. Andrews, B. Kim, and the first author introduced ospt(n)$\mathrm{ospt}(n)$, a function counting the difference between the first positive rank and crank moments. They proved that ospt(n)>0$\mathrm{ospt}(n)>0$. In another article, K. Bringmann and K. Mahlburg gave an asymptotic estimate for ospt(n)$\mathrm{ospt}(n)$. The two monotonicity properties for N(m,n)$N(m,n)$ lead to stronger inequalities for ospt(n)$\mathrm{ospt}(n)$ that imply the asymptotic estimate.     

Regularity of Hölder continuous solutions of the supercritical quasi-geostrophic equation

We present a regularity result for weak solutions of the 2D quasi-geostrophic equation with supercritical (α<1/2$\alpha <1/2$) dissipation α(−Δ)${(-\mathrm{\Delta })}^{\alpha }$: If a Leray–Hopf weak solution is Hölder continuous θ∈Cδ(R²)$\theta \in C^{\delta }({\mathbb{R}}^2)$ with δ>1−2α$\delta >1-2\alpha$ on the time interval [t₀,t]$[t_0,t]$, then it is actually a classical solution on (t₀,t]$(t_0,t]$.     

Generation and random generation: From simple groups to maximal subgroups

Let G   be a finite group and let d(G)$d(G)$ be the minimal number of generators for G  . It is well known that d(G)=2$d(G)=2$ for all (non-abelian) finite simple groups. We prove that d(H)?4$d(H)?4$ for any maximal subgroup H of a finite simple group, and that this bound is best possible.     

On the nonexistence of a relation between σ-left-porosity and σ-right-porosity

Given an arbitrarily weak notion of left-〈f〉$〈f〉$-porosity and an arbitrarily strong notion of right-〈g〉$〈g〉$-porosity, we construct an example of closed subset of R$\mathbb{R}$ which is not σ  -left-〈f〉$〈f〉$-porous and is right-〈g〉$〈g〉$-porous. We also briefly summarize the relations between three different definitions of porosity controlled by a function; we then observe that our construction gives the example for any combination of these definitions of left-porosity and right-porosity.