English
Related papers

Related papers: Sprout Symmetric Functions: Part 1

200 papers

The celebrated Thue-Morse sequence, or the Prouhet-Thue-Morse sequence (A010060 in the OEIS), has a number of interesting properties and is a rich source to many (counter)examples. We introduce two different square-free sequences on three…

Dynamical Systems · Mathematics 2024-02-13 Diyath Pannipitiya

The set A = {a_n} of nonnegative integers is an asymptotic basis of order h if every sufficiently large integer can be represented as the sum of h elements of A. If a_n ~ alpha n^h for some real number alpha > 0, then alpha is called an…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

Cylindric Schur functions are a family of symmetric functions that generalize skew Schur functions. We give a short proof that skew cylindric Schur functions expand positively in terms of non-skew cylindric Schur functions. In particular,…

Combinatorics · Mathematics 2026-05-21 Alexander Dobner

Nowadays, parallel computing is ubiquitous in several application fields, both in engineering and science. The computations rely on the floating-point arithmetic specified by the IEEE754 Standard. In this context, an elementary brick of…

Computation and Language · Computer Science 2022-05-12 Farah Benmouhoub , Pierre-Loïc Garoche , Matthieu Martel

We describe the symmetries present in the point-spread function (PSF) of an optical system either located in space or corrected by an adaptive o to Strehl ratios of about 70% and higher. We present a formalism for expanding the PSF to…

For a fixed nonnegative integer $u$ and positive integer $n$, we investigate the symmetric function \[\sum_{d|n} \left(c_d(\tfrac{n}{d})\right)^u p_d^{\tfrac{n}{d}},\] where $p_n$ denotes the $n$th power sum symmetric function, and $c_d(r)$…

Combinatorics · Mathematics 2025-09-09 John Shareshian , Sheila Sundaram

This paper presents STrEAM (SuperTrace Evaluation Automated for Matching), a Mathematica package that calculates all functional supertraces which arise when matching a generic UV model onto a relativistic Effective Field Theory (EFT) at one…

High Energy Physics - Phenomenology · Physics 2021-08-02 Timothy Cohen , Xiaochuan Lu , Zhengkang Zhang

The symmetric function theorem states that a polynomial that is invariant under permutation of variables, is a polynomial in the elementary symmetric polynomials. We deduce this classical result, in the analytic setting, from the…

Combinatorics · Mathematics 2022-08-02 Siegfried Van Hille

We propose \emph{Euler Mean Flows (EMF)}, a flow-based generative framework for one-step and few-step generation that enforces long-range trajectory consistency with minimal sampling cost. The key idea of EMF is to replace the trajectory…

Machine Learning · Computer Science 2026-02-04 Zhiqi Li , Yuchen Sun , Duowen Chen , Jinjin He , Bo Zhu

In this paper we classify when (row-strict) dual immaculate functions and (row-strict) extended Schur functions, as well as their skew generalizations, are symmetric. We also classify when their natural variants, termed advanced functions,…

Combinatorics · Mathematics 2026-04-02 Maria Esipova , Jinting Liang , Stephanie van Willigenburg

Regular sequences are natural generalisations of fixed points of constant-length substitutions on finite alphabets, that is, of automatic sequences. Using the harmonic analysis of measures associated with substitutions as motivation, we…

Number Theory · Mathematics 2021-08-12 Michael Coons , James Evans , Neil Manibo

The involution Stanley symmetric functions $\hat{F}_y$ are the stable limits of the analogues of Schubert polynomials for the orbits of the orthogonal group in the flag variety. These symmetric functions are also generating functions for…

Combinatorics · Mathematics 2017-11-10 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

Plane partitions have been widely studied in Mathematics since MacMahon. See, for example, the works by Andrews, Macdonald, Stanley, Sagan and Krattenthaler. The Schur process approach, introduced by Okounkov and Reshetikhin, and further…

Combinatorics · Mathematics 2019-06-07 Guo-Niu Han , Huan Xiong

We obtain the Schur positivity of spider graphs of the forms $S(a,2,1)$ and $S(a,4,1)$, which are considered to have the simpliest structures for which the Schur positivity was unknown. The proof outline has four steps. First, we find…

Combinatorics · Mathematics 2023-05-16 Jean-Yves Thibon , David G. L. Wang

In combinatorics on words, the well-studied factor complexity function $\rho_{\infw{x}}$ of a sequence $\infw{x}$ over a finite alphabet counts, for every nonnegative integer $n$, the number of distinct length-$n$ factors of $\infw{x}$. In…

Combinatorics · Mathematics 2025-05-07 Jean-Paul Allouche , John M. Campbell , Shuo Li , Jeffrey Shallit , Manon Stipulanti

For a power series which converges in some neighborhood of the origin in the complex plane, it turns out that the zeros of its partial sums---its sections---often behave in a controlled manner, producing intricate patterns as they converge…

Number Theory · Mathematics 2015-03-20 Antonio R. Vargas

H.Choi-D.Kim-S.J.Lee and S.J.Lee introduced a new kind of tableaux, semistandard oscillating tableaux (SSOT), around 2024 in the context of Lusztig $q$-weight multiplicities, KR crystals and King tableaux. In this paper, we study generating…

Combinatorics · Mathematics 2026-01-27 Masato Kobayashi , Tomoo Matsumura , Shogo Sugimoto

For a pair $(E,P)$ of an elliptic curve $E/\mathbb{Q}$ and a nontorsion point $P\in E(\mathbb{Q})$, the sequence of \emph{elliptic Fermat numbers} is defined by taking quotients of terms in the corresponding elliptic divisibility sequence…

Number Theory · Mathematics 2018-08-14 Seoyoung Kim , Alexandra Walsh

Let $\cal{N}=\{1,\cdots,n\}$. The entropy function $\bf h$ of a set of $n$ discrete random variables $\{X_i:i\in\cal N\}$ is a $2^n$-dimensional vector whose entries are ${\bf{h}}({\cal{A}})\triangleq H(X_{\cal{A}}),\cal{A}\subset{\cal N}…

Information Theory · Computer Science 2016-09-29 Qi Chen , Raymond W. Yeung

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

Combinatorics · Mathematics 2010-03-30 Aaron Abrams , Eric Babson , Henry Landau , Zeph Landau , James Pommersheim