Related papers: On the structure of spikes

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…

We consider any fixed $d\in\mathbb{Z}_{>0}$ number of second class particles in the asymmetric simple exclusion process (ASEP), constructed via a basic coupling of two ASEPs. We give the joint distribution of the positions of the second…

In this paper authors have presented a power efficient scheme for implementing a spike sorting module. Spike sorting is an important application in the field of neural signal acquisition for implantable biomedical systems whose function is…

A vast majority of computation in the brain is performed by spiking neural networks. Despite the ubiquity of such spiking, we currently lack an understanding of how biological spiking neural circuits learn and compute in-vivo, as well as…

Let K be the kernel of an epimorphism G -> Z, where G is a finitely presented group. If K has infinitely many subgroups of index 2, 3, or 4, then it has uncountably many. Moreover, if K is the commutator subgroup of a classical knot group…

When a neuron breaks silence, it can emit action potentials in a number of patterns. Some responses are so sudden and intense that electrophysiologists felt the need to single them out, labeling action potentials emitted at a particularly…

There is a well-known bijection between finite binary sequences and integer partitions. Sequences of length r correspond to partitions of perimeter r+1. Motivated by work on rational numbers in the Calkin-Wilf tree, we classify partitions…

The $p$-rank of a Steiner triple system $B$ is the dimension of the linear span of the set of characteristic vectors of blocks of $B$, over GF$(p)$. We derive a formula for the number of different Steiner triple systems of order $v$ and…

We show that we can construct a model in 3+1 dimensions where it is necessary that composite vector particles take place in physical processes as incoming and outgoing particles . Cross-section of the processes in which only the constituent…

A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a…

In spin-1 collective atomic systems, the spin and nematic-tensor operators constitute the su(3) Lie algebra whose su(2) subalgebras are shown to give two distinct classes of squeezing which are unitarily equivalent to spin squeezing and…

Spiking neural networks (SNNs) compute with discrete spikes and exploit temporal structure, yet most adversarial attacks change intensities or event counts instead of timing. We study a timing-only adversary that retimes existing spikes…

We construct clusters of classical Heisenberg spins with two-spin $\vec{S}_i.\vec{S}_j$-type interactions for which the ground state manifold consists of disconnected pieces. We extend the construction to lattices and couplings for which…

Let K be a knot of genus g. If K is fibered, then it is well known that the knot group pi(K) splits only over a free group of rank 2g. We show that if K is not fibered, then pi(K) splits over non-free groups of arbitrarily large rank.…

A tuple (Z_1,...,Z_p) of matrices of size r is said to be a commuting extension of a tuple (A_1,...,A_p) of matrices of size n <r if the Z_i pairwise commute and each A_i sits in the upper left corner of a block decomposition of Z_i. This…

An ordered matching of size $n$ is a graph on a linearly ordered vertex set $V$, $|V|=2n$, consisting of $n$ pairwise disjoint edges. There are three different ordered matchings of size two on $V=\{1,2,3,4\}$: an alignment…

Understanding how the dynamics of neural networks is shaped by the computations they perform is a fundamental question in neuroscience. Recently, the framework of efficient coding proposed a theory of how spiking neural networks can compute…

Causal relationship recognition is a fundamental operation in neural networks aimed at learning behavior, action planning, and inferring external world dynamics. This operation is particularly crucial for reinforcement learning (RL). In the…

An 'induced restriction' of a simple binary matroid $M$ is a restriction $M|F$, where $F$ is a flat of $M$. We consider the class $\mathcal{M}$ of all simple binary matroids $M$ containing neither a free matroid on three elements (which we…

We introduce an algorithm to do backpropagation on a spiking network. Our network is "spiking" in the sense that our neurons accumulate their activation into a potential over time, and only send out a signal (a "spike") when this potential…