Related papers: On the structure of spikes

We give necessary and sufficient conditions for the existence of pin+, pin- and spin structures on Riemannian manifolds with holonomy group $Z_2^k$. For any n>3 (resp. n>5) we give examples of pairs of compact manifolds (resp. compact…

A minor-closed class of matroids is (strongly) fractal if the number of n-element matroids in the class is dominated by the number of n-element excluded minors. We conjecture that when K is an infinite field, the class of K-representable…

The origin of the spin gap in the underdoped cuprate superconductors is still mysterious. Experimental evidence from neutron scattering and NMR experiments indicates that the spin gap might be present only in the bilayer compounds. A naive…

Spin-conserving and spin-flip opaque reflections of electrons from a potential barrier in heterostructures are described. An electric field of the barrier is considered to be the only source of energy spin splitting in the presence of…

Mixing (of all orders) rank-one actions $T$ of Heisenberg group $H_3(\Bbb R)$ are constructed. The restriction of $T$ to the center of $H_3(\Bbb R)$ is simple and commutes only with $T$. Mixing Poisson and mixing Gaussian actions of…

We construct, for every $r \ge 3$ and every prime power $q > 10$, a rank-$r$ matroid with no $U_{2,q+2}$-minor, having more hyperplanes than the rank-$r$ projective geometry over $\mathrm{GF}(q)$.

Let $S$ be a finite set of points in the plane that are in convex position. We present an algorithm that constructs a plane $\frac{3+4\pi}{3}$-spanner of $S$ whose vertex degree is at most 3. Let $\Lambda$ be the vertex set of a finite…

A graph $G$ is nonseparating projective planar if $G$ has a projective planar embedding without a nonsplit link. Nonseparating projective planar graphs are closed under taking minors and are a superclass of projective outerplanar graphs. We…

There is a long list of open questions rooted in the same underlying problem: understanding the structure of bases or common bases of matroids. These conjectures suggest that matroids may possess much stronger structural properties than are…

In this paper, we say that a rank 2 bundle splits if it is given by an extension of two line bundles. In the previous works, we gave a necessary condition for Lazarsfeld-Mukai bundles of rank 2 to split, under a numerical condition ([W2],…

The r-fold-n-point-splitting operation is an important operation in Graph Theory defined by Slater [15]. Later, Ghafari [6] extended 3-fold-n-point-splitting operation in binary matroids and obtained the result for Eulerian matroids whose…

Let $S$ be a planar point set in general position, and let $\mathcal{P}(S)$ be the set of all plane straight-line paths with vertex set $S$. A flip on a path $P \in \mathcal{P}(S)$ is the operation of replacing an edge $e$ of $P$ with…

The cut-rank of a set $X$ in a graph $G$ is the rank of the $X\times (V(G)-X)$ submatrix of the adjacency matrix over the binary field. A split is a partition of the vertex set into two sets $(X,Y)$ such that the cut-rank of $X$ is less…

Spike-sorting techniques attempt to classify a series of noisy electrical waveforms according to the identity of the neurons that generated them. Existing techniques perform this classification ignoring several properties of actual neurons…

For $r,n\ge2$, an ordered $r$-uniform matching of size $n$ is an $r$-uniform hypergraph on a linearly ordered vertex set $V$, with $|V|=rn$, consisting of $n$ pairwise disjoint edges. There are $\tfrac12\binom{2r}r$ different ways two edges…

Now that spike trains from many neurons can be recorded simultaneously, there is a need for methods to decode these data to learn about the networks that these neurons are part of. One approach to this problem is to adjust the parameters of…

We develop a new semi-algebraic proof system called Stabbing Planes which formalizes modern branch-and-cut algorithms for integer programming and is in the style of DPLL-based modern SAT solvers. As with DPLL there is only a single rule:…

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

We determine the excitations and $S$ matrix of an integrable isotropic antiferromagnetic quantum spin chain of alternating spin 1/2 and spin 1. There are two types of gapless one-particle excitations: the usual spin 1/2 (``spinor'') kink,…

We introduce the zip tree, a form of randomized binary search tree that integrates previous ideas into one practical, performant, and pleasant-to-implement package. A zip tree is a binary search tree in which each node has a numeric rank…