18,342 research outputs found

    Confessions of Womanhood

    Get PDF

    Kronecker Coefficients For Some Near-Rectangular Partitions

    Full text link
    We give formulae for computing Kronecker coefficients occurring in the expansion of sμsνs_{\mu}*s_{\nu}, where both μ\mu and ν\nu are nearly rectangular, and have smallest parts equal to either 1 or 2. In particular, we study s(n,n1,1)s(n,n)s_{(n,n-1,1)}*s_{(n,n)}, s(n1,n1,1)s(n,n1)s_{(n-1,n-1,1)}*s_{(n,n-1)}, s(n1,n1,2)s(n,n)s_{(n-1,n-1,2)}*s_{(n,n)}, s(n1,n1,1,1)s(n,n)s_{(n-1,n-1,1,1)}*s_{(n,n)} and s(n,n,1)s(n,n,1)s_{(n,n,1)}*s_{(n,n,1)}. Our approach relies on the interplay between manipulation of symmetric functions and the representation theory of the symmetric group, mainly employing the Pieri rule and a useful identity of Littlewood. As a consequence of these formulae, we also derive an expression enumerating certain standard Young tableaux of bounded height, in terms of the Motzkin and Catalan numbers

    On the Finite Time Convergence of Cyclic Coordinate Descent Methods

    Full text link
    Cyclic coordinate descent is a classic optimization method that has witnessed a resurgence of interest in machine learning. Reasons for this include its simplicity, speed and stability, as well as its competitive performance on 1\ell_1 regularized smooth optimization problems. Surprisingly, very little is known about its finite time convergence behavior on these problems. Most existing results either just prove convergence or provide asymptotic rates. We fill this gap in the literature by proving O(1/k)O(1/k) convergence rates (where kk is the iteration counter) for two variants of cyclic coordinate descent under an isotonicity assumption. Our analysis proceeds by comparing the objective values attained by the two variants with each other, as well as with the gradient descent algorithm. We show that the iterates generated by the cyclic coordinate descent methods remain better than those of gradient descent uniformly over time.Comment: 20 page

    A Mathematical Model of Tripartite Synapse: Astrocyte Induced Synaptic Plasticity

    Full text link
    In this paper we present a biologically detailed mathematical model of tripartite synapses, where astrocytes modulate short-term synaptic plasticity. The model consists of a pre-synaptic bouton, a post-synaptic dendritic spine-head, a synaptic cleft and a peri-synaptic astrocyte controlling Ca2+ dynamics inside the synaptic bouton. This in turn controls glutamate release dynamics in the cleft. As a consequence of this, glutamate concentration in the cleft has been modeled, in which glutamate reuptake by astrocytes has also been incorporated. Finally, dendritic spine-head dynamics has been modeled. As an application, this model clearly shows synaptic potentiation in the hippocampal region, i.e., astrocyte Ca2+ mediates synaptic plasticity, which is in conformity with the majority of the recent findings (Perea & Araque, 2007; Henneberger et al., 2010; Navarrete et al., 2012).Comment: 42 pages, 14 figures, Journal of Biological Physics (to appear
    corecore