Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Bump attractor (1)
- Chaotic dynamical systems (1)
- Circuit models of neurons (1)
- Conjugate embedding (1)
- Continuous attractors (1)
-
- Dense orbit (1)
- Evolutions (1)
- Fat points (1)
- Feigenbaum constant (1)
- Inhomogeneous neural media (1)
- Isospiking bifurcation (1)
- Neural fields (1)
- Parametric working memory (1)
- Period-doubling bifurcation (1)
- Periodic orbit (1)
- Poincaré return maps (1)
- Projective space (1)
- Renormalization universality (1)
- Ring model (1)
- Sensitive dependence on initial conditions (1)
- Spike renormalization operator (1)
- Symbolic powers (1)
- Synaptic facilitation (1)
- Working memory (1)
Articles 1 - 7 of 7
Full-Text Articles in Physical Sciences and Mathematics
Are Symbolic Powers Highly Evolved?, Brian Harbourne, Craig Hunkeke
Are Symbolic Powers Highly Evolved?, Brian Harbourne, Craig Hunkeke
Department of Mathematics: Faculty Publications
Searching for structural reasons behind old results and conjectures of Chudnovksy regarding the least degree of a nonzero form in an ideal of fat points in PN, we make conjectures which explain them, and we prove the conjectures in certain cases, including the case of general points in P2. Our conjectures were also partly motivated by the Eisenbud-Mazur Conjecture on evolutions, which concerns symbolic squares of prime ideals in local rings, but in contrast we consider higher symbolic powers of homogeneous ideals in polynomial rings.
How Do Neurons Work Together? Lessons From Auditory Cortex, Kenneth D. Harris, Peter Bartho, Paul Chadderton, Carina Curto, Jaime De La Rocha, Liad Hollender, Vladimir Itskov, Artur Luczak, Stephan Marguet, Alfonso Renart, Shuzo Sakata
How Do Neurons Work Together? Lessons From Auditory Cortex, Kenneth D. Harris, Peter Bartho, Paul Chadderton, Carina Curto, Jaime De La Rocha, Liad Hollender, Vladimir Itskov, Artur Luczak, Stephan Marguet, Alfonso Renart, Shuzo Sakata
Department of Mathematics: Faculty Publications
Recordings of single neurons have yielded great insights into the way acoustic stimuli are represented in auditory cortex. However, any one neuron functions as part of a population whose combined activity underlies cortical information processing. Here we review some results obtained by recording simultaneously from auditory cortical populations and individual morphologically identified neurons, in urethane-anesthetized and unanesthetized passively listening rats. Auditory cortical populations produced structured activity patterns both in response to acoustic stimuli, and spontaneously without sensory input. Population spike time patterns were broadly conserved across multiple sensory stimuli and spontaneous events, exhibiting a generally conserved sequential organization lasting approximately …
Neural Spike Renormalization. Part I — Universal Number 1, Bo Deng
Neural Spike Renormalization. Part I — Universal Number 1, Bo Deng
Department of Mathematics: Faculty Publications
For a class of circuit models for neurons, it has been shown that the transmembrane electrical potentials in spike bursts have an inverse correlation with the intra-cellular energy conversion: the fewer spikes per burst the more energetic each spike is. Here we demonstrate that as the per-spike energy goes down to zero, a universal constant to the bifurcation of spike-bursts emerges in a similar way as Feigenbaum’s constant does to the period-doubling bifurcation to chaos generation, and the new universal constant is the first natural number 1.
Neural Spike Renormalization. Part Ii — Multiversal Chaos, Bo Deng
Neural Spike Renormalization. Part Ii — Multiversal Chaos, Bo Deng
Department of Mathematics: Faculty Publications
Reported here for the first time is a chaotic infinite-dimensional system which contains infinitely many copies of every deterministic and stochastic dynamical system of all finite dimensions. The system is the renormalizing operator of spike maps that was used in a previous paper to show that the first natural number 1 is a universal constant in the generation of metastable and plastic spike-bursts of a class of circuit models of neurons.
An Entropy Proof Of The Kahn-Lovasz Theorem, Jonathan Cutler, A. J. Radcliffe
An Entropy Proof Of The Kahn-Lovasz Theorem, Jonathan Cutler, A. J. Radcliffe
Department of Mathematics: Faculty Publications
Bregman [2], gave a best possible upper bound for the number of perfect matchings in a balanced bipartite graph in terms of its degree sequence. Recently Kahn and Lovasz [8] extended Bregman’s theorem to general graphs. In this paper, we use entropy methods to give a new proof of the Kahn-Lovasz theorem. Our methods build on Radhakrishnan’s [9] use of entropy to prove Bregman’s theorem.
Short-Term Facilitation May Stabilize Parametric Working Memory Trace, Vladimir Itskov, David Hansel, Misha Tsodyks
Short-Term Facilitation May Stabilize Parametric Working Memory Trace, Vladimir Itskov, David Hansel, Misha Tsodyks
Department of Mathematics: Faculty Publications
Networks with continuous set of attractors are considered to be a paradigmatic model for parametric working memory (WM), but require fine tuning of connections and are thus structurally unstable. Here we analyzed the network with ring attractor, where connections are not perfectly tuned and the activity state therefore drifts in the absence of the stabilizing stimulus. We derive an analytical expression for the drift dynamics and conclude that the network cannot function as WM for a period of several seconds, a typical delay time in monkey memory experiments. We propose that short-term synaptic facilitation in recurrent connections significantly improves the …
Extremal Problems For Independent Set Enumeration, Jonathan Cutler, A. J. Radcliffe
Extremal Problems For Independent Set Enumeration, Jonathan Cutler, A. J. Radcliffe
Department of Mathematics: Faculty Publications
The study of the number of independent sets in a graph has a rich history. Recently, Kahn proved that disjoint unions of Kr,r’s have the maximum number of independent sets amongst r-regular bipartite graphs. Zhao extended this to all r-regular graphs. If we instead restrict the class of graphs to those on a fixed number of vertices and edges, then the Kruskal-Katona theorem implies that the graph with the maximum number of independent sets is the lex graph, where edges form an initial segment of the lexicographic ordering. In this paper, we study three related questions. Firstly, we …