English
Related papers

Related papers: Computation and sampling for Schubert specializati…

200 papers

We give a new formula for double Grothendieck polynomials based on Magyar's orthodontia algorithm for diagrams. Our formula implies a similar formula for double Schubert polynomials $\mathfrak S_w(\mathbf x;\mathbf y)$. We also prove a…

Combinatorics · Mathematics 2024-10-11 Linus Setiabrata , Avery St. Dizier

For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…

Probability · Mathematics 2012-10-04 Harrie Hendriks , Martien C. A. van Zuijlen

In paper I of this series we gave positive formulae for expanding the product $\mathfrak S^\pi \mathfrak S^\rho$ of two Schubert polynomials, in the case that both $\pi,\rho$ had shared descent set of size $\leq 3$. Here we introduce and…

Combinatorics · Mathematics 2023-06-27 Allen Knutson , Paul Zinn-Justin

Given a set $A=\{a_1,\ldots,a_n\}$ of real numbers and real coefficients $b_1,\ldots,b_n$, consider the distribution of the sum obtained by pairing the $a_i$'s with the $b_i$'s according to a uniformly random permutation. A recent theorem…

Combinatorics · Mathematics 2026-01-12 Zach Hunter , Cosmin Pohoata , Daniel G. Zhu

Modifications to Swisdak [Phys. Plasmas 20, 062110 (2013)]'s rejection sampling algorithm for drawing a Maxwell-J\"{u}ttner distribution in particle simulations are presented. Handy approximations for $e$-folding points and a linear slope…

Plasma Physics · Physics 2024-09-10 Seiji Zenitani

Shannon in his 1949 paper suggested the use of derivatives to increase the W*T product of the sampled signal. Use of derivatives enables improved reconstruction particularly in the case of non-uniformly sampled signals. An FM-AM…

Information Theory · Computer Science 2009-05-05 Nirmal B. Chakrabarti

We study the complexity of smoothed agnostic learning of halfspaces on $\{\pm 1\}^n$ under uniform marginals in the model of~\cite{KM25}, where each input coordinate is independently flipped with probability $\sigma \in (0, {1}/{2})$. We…

Machine Learning · Computer Science 2026-05-14 Tim Sinen

Let $f$ be analytic on $[0,1]$ with $|f^{(k)}(1/2)|\leq A\alpha^kk!$ for some constant $A$ and $\alpha<2$. We show that the median estimate of $\mu=\int_0^1f(x)\,\mathrm{d}x$ under random linear scrambling with $n=2^m$ points converges at…

Computation · Statistics 2022-07-11 Zexin Pan , Art B. Owen

The regularity of refinable functions has been investigated deeply in the past 25 years using Fourier analysis, wavelet analysis, restricted and joint spectral radii techniques. However the shift-invariance of the underlying regular setting…

Numerical Analysis · Mathematics 2018-07-31 Maria Charina , Costanza Conti , Lucia Romani , Joachim Stöckler , Alberto Viscardi

Slicing distribution selection has been used as an effective technique to improve the performance of parameter estimators based on minimizing sliced Wasserstein distance in applications. Previous works either utilize expensive optimization…

Machine Learning · Statistics 2024-05-10 Khai Nguyen , Shujian Zhang , Tam Le , Nhat Ho

Denote by $\lambda_1(A), \ldots, \lambda_n(A)$ the eigenvalues of an $(n\times n)$-matrix $A$. Let $Z_n$ be an $(n\times n)$-matrix chosen uniformly at random from the matrix analogue to the classical $\ell_ p^n$-ball, defined as the set of…

Probability · Mathematics 2018-08-16 Zakhar Kabluchko , Joscha Prochno , Christoph Thaele

For a random sample of points in $\mathbb{R}$, we consider the number of pairs whose members are nearest neighbors (NN) to each other and the number of pairs sharing a common NN. The first type of pairs are called reflexive NNs whereas…

Probability · Mathematics 2020-10-07 Selim Bahadır , Elvan Ceyhan

We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for…

Combinatorics · Mathematics 2026-05-05 Balázs Maga

We give an elementary approach utilizing only the divided difference formalism for obtaining expansions of Schubert polynomials that are manifestly nonnegative, by studying solutions to the equation $\sum Y_i\partial_i=\mathrm{id}$ on…

Combinatorics · Mathematics 2025-07-09 Philippe Nadeau , Hunter Spink , Vasu Tewari

We establish a rather unexpected and simple criterion for the boundedness of Schur multipliers $S_M$ on Schatten $p$-classes which solves a conjecture proposed by Mikael de la Salle. Given $1 < p < \infty$, a simple form our main result…

Functional Analysis · Mathematics 2023-04-03 José M. Conde-Alonso , Adrián M. González-Pérez , Javier Parcet , Eduardo Tablate

We study weighted pseudorandom generators (WPRGs) and derandomizations for read-once branching programs (ROBPs). Denote $n$ and $w$ as the length and the width of a ROBP. We have the following results. For standard ROBPs, we give an…

Computational Complexity · Computer Science 2025-07-22 Kuan Cheng , Ruiyang Wu

In this work, we consider the approximate reconstruction of high-dimensional periodic functions based on sampling values. As sampling schemes, we utilize so-called reconstructing multiple rank-1 lattices, which combine several preferable…

Numerical Analysis · Mathematics 2019-05-14 Lutz Kämmerer , Toni Volkmer

Consider the rank-1 spiked model: $\bf{X}=\sqrt{\nu}\xi \bf{u}+ \bf{Z}$, where $\nu$ is the spike intensity, $\bf{u}\in\mathbb{S}^{k-1}$ is an unknown direction and $\xi\sim \mathcal{N}(0,1),\bf{Z}\sim \mathcal{N}(\bf{0},\bf{I})$. Motivated…

Information Theory · Computer Science 2022-05-20 Elad Romanov , Or Ordentlich

Let $\cP_n$ be the space of homogeneous polynomials of degree $n$ on $\bbR^{m+1}$. We consider the asymptotic behavior of some coefficients relating to the decomposition of $\cP_n$ into the sum of $\SO(m+1)$-irreducible components. Using…

Classical Analysis and ODEs · Mathematics 2018-02-27 V. Gichev

In NMR spectroscopy, undersampling in the indirect dimensions causes reconstruction artifacts whose size can be bounded using the so-called {\it coherence}. In experiments with multiple indirect dimensions, new undersampling approaches were…

Applications · Statistics 2017-02-08 Hatef Monajemi , David L. Donoho , Jeffrey C. Hoch , Adam D. Schuyler
‹ Prev 1 8 9 10 Next ›