English
Related papers

Related papers: A Little bijection for affine Stanley symmetric fu…

200 papers

We introduce a Littlewood-Richardson rule based on an algorithmic deformation of skew Young diagrams and present a bijection with the classical rule. The result is a direct combinatorial interpretation and proof of the geometric rule…

Combinatorics · Mathematics 2008-12-03 Ricky Ini Liu

LSTD is a popular algorithm for value function approximation. Whenever the number of features is larger than the number of samples, it must be paired with some form of regularization. In particular, L1-regularization methods tend to perform…

Machine Learning · Computer Science 2012-07-03 Matthieu Geist , Bruno Scherrer , Alessandro Lazaric , Mohammad Ghavamzadeh

We consider the expansion of the square of a complete homogeneous function $h_\lambda$, or of an elementary symmetric function $e_\lambda$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_\lambda]$…

Combinatorics · Mathematics 2022-03-17 Florence Maas-Gariépy , Étienne Tétreault

In this paper we look at a class of random optimization problems that arise in the forms typically known in statistical physics as Little models. In \cite{BruParRit92} the Little models were studied by means of the well known tool from the…

Optimization and Control · Mathematics 2013-06-19 Mihailo Stojnic

A distributed discrete-time algorithm is proposed for multi-agent networks to achieve a common least squares solution of a group of linear equations, in which each agent only knows some of the equations and is only able to receive…

Systems and Control · Computer Science 2017-10-02 Xuan Wang , Jingqiu Zhou , Shaoshuai Mou , Martin J. Corless

We use Stein's method to provide non asymptotic $L^1$ bounds to the normal for functionals of associated point processes. As for supporting tools, we use the connection between association and $\alpha$-mixing properties that was recently…

Probability · Mathematics 2020-04-03 Nathakhun Wiroonsri

The problem of fitting experimental data to a given model function $f(t; p_1,p_2,\dots,p_N)$ is conventionally solved numerically by methods such as that of Levenberg-Marquardt, which are based on approximating the Chi-squared measure of…

Optimization and Control · Mathematics 2017-03-14 Alberto Herrera-Gomez , R. Michael Porter

This book is an exposition of the current state of research of affine Schubert calculus and $k$-Schur functions. This text is based on a series of lectures given at a workshop titled "Affine Schubert Calculus" that took place in July 2010…

Combinatorics · Mathematics 2017-03-01 Thomas Lam , Luc Lapointe , Jennifer Morse , Anne Schilling , Mark Shimozono , Mike Zabrocki

Since the early work of Richard Stanley, it has been observed that several permutation statistics have a remarkable property with respect to shuffles of permutations. We formalize this notion of a shuffle-compatible permutation statistic…

Combinatorics · Mathematics 2018-06-13 Ira M. Gessel , Yan Zhuang

We present a variational algorithm for solving the classical inverse Sturm-Liouville problem in one dimension when two spectra are given. All critical points of the least squares functional are at global minima, which which suggests…

Numerical Analysis · Mathematics 2009-11-11 Norbert Roehrl

A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.

Combinatorics · Mathematics 2014-11-25 Hacène Belbachir , Amine Belkhir , Imad Eddine Bousbaa

By considering the specialisation $s_{\lambda}(1,q,q^2,...,q^{n-1})$ of the Schur function, Stanley was able to describe a formula for the number of semistandard Young tableaux of shape $\lambda$ in terms of two properties of the boxes in…

Combinatorics · Mathematics 2019-08-15 Peter S. Campbell , Anna Stokke

Stochastic symmetries and related invariance properties of finite dimensional SDEs driven by general cadlag semimartingales taking values in Lie groups are defined and investigated. The considered set of SDEs, first introduced by S. Cohen,…

Probability · Mathematics 2020-08-04 Sergio Albeverio , Francesco C. De Vecchi , Paola Morando , Stefania Ugolini

We relate the combinatorial definitions of the type $A_n$ and type $C_n$ Stanley symmetric functions, via a combinatorially defined "double Stanley symmetric function," which gives the type $A$ case at $(\mathbf{x},\mathbf{0})$ and gives…

Combinatorics · Mathematics 2022-01-11 Graham Hawkes

We introduce a quasisymmetric refinement of Stanley's chromatic symmetric function. We derive refinements of both Gasharov's Schur-basis expansion of the chromatic symmetric function and Chow's expansion in Gessel's basis of fundamental…

Combinatorics · Mathematics 2016-03-30 John Shareshian , Michelle L. Wachs

In this work, we propose a novel optimization model termed "sum-of-minimum" optimization. This model seeks to minimize the sum or average of $N$ objective functions over $k$ parameters, where each objective takes the minimum value of a…

Optimization and Control · Mathematics 2024-06-11 Lisang Ding , Ziang Chen , Xinshang Wang , Wotao Yin

The first order condition of the constrained minimization problem leads to a saddle point problem. A multigrid method using a multiplicative Schwarz smoother for saddle point problems can thus be interpreted as a successive subspace…

Numerical Analysis · Mathematics 2016-01-19 Long Chen

Inspired by the spin-inversion statistics of Schilling et al. and Haglund et al., we relate the symmetry of ribbon functions to a result of van Leeuwen, and also describe the multiplication of a domino function by a Schur function.

Combinatorics · Mathematics 2007-05-23 Thomas Lam

This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed…

Combinatorics · Mathematics 2023-05-31 Álvaro Gutiérrez , Mercedes H. Rosas

Many combinatorial generating functions can be expressed as combinations of symmetric functions, or extracted as sub-series and specializations from such combinations. Gessel has outlined a large class of symmetric functions for which the…

Combinatorics · Mathematics 2012-11-14 Frédéric Chyzak , Marni Mishna , Bruno Salvy