Related papers: On the structure of spikes
Spike sorting refers to the problem of assigning action potentials observed in extra-cellular recordings of neural activity to the neuron(s) from which they originate. We cast this problem as one of learning a convolutional dictionary from…
Repeating patterns of spike sequences from a neuronal network have been proposed to be useful in the reconstruction of the network topology. Reverberations in a physiologically realistic model with various physical connection topologies…
We study a network model of two conductance-based pacemaker neurons of differing natural frequency, coupled with either mutual excitation or inhibition, and receiving shared random inhibitory synaptic input. The networks may phase-lock…
Let $R$ be an associative ring with identity and let $N$ be a nil ideal of $R$. It is shown that units of $R/N$ can be lifted to units in $R$. Under some mild conditions on the ring, a procedure is given to determine those lifted units in a…
Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley…
Given a real, symmetric matrix S, we define the slice through S as being the connected component containing S of two orbits under conjugation: the first by the orthogonal group, and the second by the upper triangular group. We describe some…
We give a Cayley type formula to count the number of spanning trees in the complete r-uniform hypergraph for all r >= 3. Similar to the bijection between spanning trees in complete graphs and Parking functions, we derive a bijection from…
In this paper, we give a complete characterization of binary matroids with no $P_9$-minor. A 3-connected binary matroid $M$ has no $P_9$-minor if and only if $M$ is one of the internally 4-connected non-regular minors of a special…
Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…
This paper considers a process for the creation and subsequent firing of sequences of neuronal patterns, as might be found in the human brain. The scale is one of larger patterns emerging from an ensemble mass, possibly through some type of…
Recent work by Arpin, Chen, Lauter, Scheidler, Stange, and Tran counted the number of cycles of length $r$ in supersingular $\ell$-isogeny graphs. In this paper, we extend this work to count the number of cycles that occur along the spine.…
Efficient pattern separation in dentate gyrus plays an important role in storing information in the hippocampus. Current knowledge of the structure and function of the hippocampus, entorhinal cortex and dentate gyrus, in pattern separation…
An essential step toward understanding neural circuits is linking their structure and their dynamics. In general, this relationship can be almost arbitrarily complex. Recent theoretical work has, however, begun to identify some broad…
In this paper we describe a physical problem, based on electromagnetic fields, whose topological constraints are higher dimensional versions of Kirchhoff's laws, involving $2-$ simplicial complexes embedded in $\mathbb{R} ^3$ rather than…
Networks of model neurons with balanced recurrent excitation and inhibition produce irregular and asynchronous spiking activity. We extend the analysis of balanced networks to include the known dependence of connection probability on the…
Based on the Zhang-Rice singlet picture, it is argued that the half-skyrmion is created by the doped hole in the single hole doped high-T_c cuprates with N'eel ordering. The spin configuration around the Zhang-Rice singlet, which has the…
For $s \ge 4$, the 3-uniform tight cycle $C^3_s$ has vertex set corresponding to $s$ distinct points on a circle and edge set given by the $s$ cyclic intervals of three consecutive points. For fixed $s \ge 4$ and $s \not\equiv 0$ (mod 3) we…
For all positive integers $\ell$ and $r$, we determine the maximum number of elements of a simple rank-$r$ positroid without the rank-$2$ uniform matroid $U_{2,\ell+2}$ as a minor, and characterize the matroids with the maximum number of…
Seymour's Splitter Theorem is a basic inductive tool for dealing with $3$-connected matroids. This paper proves a generalization of that theorem for the class of $2$-polymatroids. Such structures include matroids, and they model both sets…
We study threefolds X in a projective space having as hyperplane section a smooth surface with an elliptic fibration. We first give a general theorem about the possible embeddings of such surfaces with Picard number two. More precise…