English
Related papers

Related papers: Properties of plactic monoid centralizers

200 papers

The Sun polynomials $g_n(x)$ are defined by \begin{align*} g_n(x)=\sum_{k=0}^n{n\choose k}^2{2k\choose k}x^k. \end{align*} We prove that, for any positive integer $n$, there hold \begin{align*} &\frac{1}{n}\sum_{k=0}^{n-1}(4k+3)g_k(x)…

Number Theory · Mathematics 2015-12-29 Victor J. W. Guo , Guo-Shuai Mao , Hao Pan

We obtain two equivalent conditions for m polynomials in n variables to form a p-basis of a ring of constants of some polynomial K-derivation, where K is a UFD of characteristic p>0. One of these conditions involves jacobians, and the…

Commutative Algebra · Mathematics 2013-06-21 Piotr Jedrzejewicz

We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…

Complex Variables · Mathematics 2026-02-25 Greg Knese , James Eldred Pascoe , Alan Sola

This paper consists of two related parts. In the first part we give a self-contained proof of homological stability for the spaces C_n(M;X) of configurations of n unordered points in a connected open manifold M with labels in a…

Algebraic Topology · Mathematics 2013-04-12 Oscar Randal-Williams

Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…

Computer Science and Game Theory · Computer Science 2024-08-30 Naoyuki Kamiyama

The Motzkin numbers $M_n=\sum_{k=0}^n\binom n{2k}\binom{2k}k/(k+1)$ $(n=0,1,2,\ldots)$ and the central trinomial coefficients $T_n$ ($n=0,1,2,\ldots)$ given by the constant term of $(1+x+x^{-1})^n$, have many combinatorial interpretations.…

Combinatorics · Mathematics 2022-02-02 Zhi-Wei Sun

Let m be a probability measure supported on some infinite and compact set K in the complex plane and let p_n(z) be the corresponding degree n orthonormal polynomial with positive leading coefficient. Let v_n be the normalized zero counting…

Spectral Theory · Mathematics 2012-02-14 Brian Simanek

A multivariate polynomial is {\em stable} if it is nonvanishing whenever all variables have positive imaginary parts. We classify all linear partial differential operators in the Weyl algebra $\A_n$ that preserve stability. An important…

Classical Analysis and ODEs · Mathematics 2012-04-18 Julius Borcea , Petter Brändén

Let P_{n,m} denote the graph taken uniformly at random from the set of all planar graphs on {1,2,..., n} with exactly m(n) edges. We use counting arguments to investigate the probability that P_{n,m} will contain given components and…

Combinatorics · Mathematics 2011-01-27 Chris Dowden

We consider a continuous family $(f_s)$, $s\in[0,1]$ of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant (or…

Algebraic Geometry · Mathematics 2007-05-23 Arnaud Bodin

The classical Steinitz theorem states that if the origin belongs to the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points of $S$ whose convex hull contains the origin in the interior.…

Metric Geometry · Mathematics 2024-03-06 Grigory Ivanov , Márton Naszódi

A weighted U-statistic based on a random sample X_1,...,X_n has the form U_n=\sum_{1\le i,j\le n}w_{i-j}K(X_i,X_j), where K is a fixed symmetric measurable function and the w_i are symmetric weights. A large class of statistics can be…

Probability · Mathematics 2007-05-23 Tailen Hsing , Wei Biao Wu

P. Frankl and J. Pach proved the following uniform version of Sauer's Lemma. Let $n,d,s$ be natural numbers such that $d\leq n$, $s+1\leq n/2$. Let $\cF \subseteq {[n] \choose d}$ be an arbitrary $d$-uniform set system such that $\cF$ does…

Combinatorics · Mathematics 2016-10-10 Gabor Hegedüs , Lajos Ronyai

A sequence of representations \(V_n\) of the symmetric group \(S_n\) is called representation (multiplicity) stable if, after some \(n\), the irreducible decomposition of \(V_n\) stabilizes. In particular, Church, Ellenburg and Farb (2015)…

Combinatorics · Mathematics 2025-07-17 Xinxuan Wang

We study the problem of expanding the product of two Stanley symmetric functions $F_w\cdot F_u$ into Stanley symmetric functions in some natural way. Our approach is to consider a Stanley symmetric function as a stabilized Schubert…

Combinatorics · Mathematics 2012-08-15 Nan Li

By a theorem of A.Bj\"orner, for every interval $[u,v]$ in the Bruhat order of a Coxeter group $W$, there exists a stratified space whose strata are labeled by the elements of $[u,v]$, adjacency is described by the Bruhat order, and each…

Combinatorics · Mathematics 2007-05-23 Sergey Fomin , Michael Shapiro

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

Number Theory · Mathematics 2023-10-05 Tong Lin , Qiang Wang

Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). In previous…

Representation Theory · Mathematics 2014-12-05 Laurent Manivel

In this paper, we show that various kinds of integer polynomials with prescribed properties of their roots have positive density. For example, we prove that almost all integer polynomials have exactly one or two roots with maximal modulus.…

Number Theory · Mathematics 2015-09-08 Artūras Dubickas , Min Sha

A word~$w$ has a border $u$ if $u$ is a non-empty proper prefix and suffix of $u$. A word~$w$ is said to be \emph{closed} if $w$ is of length at most $1$ or if $w$ has a border that occurs exactly twice in $w$. A word~$w$ is said to be…

Combinatorics · Mathematics 2024-05-24 Daniel Gabric
‹ Prev 1 3 4 5 6 7 10 Next ›