Search

We consider one parameter families of vector fields introduced by Rovella, obtained through modifying the eigenvalues of the geometric Lorenz attractor, replacing the expanding condition on the eigenvalues of the singularity by a contracting one. We show that there is no statistical stability within the set of parameters for which there is a physical measure supported on the attractor. This is achieved obtaining a similar conclusion at the level of the corresponding one-dimensional contracting Lorenz maps., Comment: 29 pages, 3 figures

Reid conjectured that any finite set of non-negative integers is the score set of some tournament and Yao gave a non-constructive proof of Reid's conjecture using arithmetic arguments. No constructive proof has been found since. In this paper, we investigate a related problem, namely, which sets of integers are imbalance sets of tournaments. We completely solve the tournament imbalance set problem (TIS) and also estimate the minimal order of a tournament realizing an imbalance set. Our proofs are constructive and provide a pseudo-polynomial time algorithm to realize any imbalance set. Along the way, we generalize the well-known equal sum subsets problem (ESS) to define the equal sum sequences problem (ESSeq) and show it to be NP-complete. We then prove that ESSeq reduces to TIS and so, due to the pseudo-polynomial time complexity, TIS is weakly NP-complete., Comment: Presented at the Retrospective Workshop on Discrete Geometry, Optimization and Symmetry, 25-29 Nov 2013, The Fields Institute, Toronto, Canada

Bose proved the inequality $b\geq v+r-1$ for resolvable balanced incomplete block designs (RBIBDs) and Kageyama improved it for RBIBDs which are not affine resolvable. In this note we prove a new lower bound on the number of blocks $b$ that holds for all BIBDs. We further prove that for a significantly large number of BIBDs our bound is tighter than the bounds given by the inequalities of Bose and Kageyama., Comment: 7 pages