中文
相关论文

相关论文: Sur une conjecture de Dehornoy

200 篇论文

Let $M_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are iid Bernoulli random variables (which take value -1 and 1 with probability 1/2). Improving the earlier result by Costello, Tao and Vu, we show that…

组合数学 · 数学 2019-12-19 Hoi H. Nguyen

Let p_n denote the sequence of all primes and let d_n=p_n-p_{n-1} denote the sequence of all gaps between consecutive primes. In 1948 Erd\H{o}s and Tur\'an showed that d_{n+1}-d_n changes sign infinitely often and together with P\'olya…

数论 · 数学 2015-04-28 János Pintz

We prove the following conjecture of Leighton and Moitra. Let $T$ be a tournament on $[n]$ and $S_n$ the set of permutations of $[n]$. For an arc $uv$ of $T$, let $A_{uv}=\{\sigma \in S_n \, : \, \sigma(u)<\sigma(v) \}$. $\textbf{Theorem.}$…

组合数学 · 数学 2017-03-13 Hüseyin Acan , Pat Devlin , Jeff Kahn

We extend and generalize many of the enumerative results concerning West's stack-sorting map $s$. First, we prove a useful theorem that allows one to efficiently compute $|s^{-1}(\pi)|$ for any permutation $\pi$, answering a question of…

组合数学 · 数学 2019-02-12 Colin Defant

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

计算复杂性 · 计算机科学 2014-05-14 Pascal Koiran , Natacha Portier , Sébastien Tavenas , Stéphan Thomassé

Consider an $N\times n$ random matrix $Y_n=(Y^n_{ij})$ where the entries are given by $Y^n_{ij}=\frac{\sigma_{ij}(n)}{\sqrt{n}}X^n_{ij}$, the $X^n_{ij}$ being independent and identically distributed, centered with unit variance and…

概率论 · 数学 2009-09-29 Walid Hachem , Philippe Loubaton , Jamal Najim

We prove expressions for the inequalities in Hermite's theorem which are conditions for a real polynomial to have real zeros. These expressions generalize the discriminant of a quadratic polynomial and the expression of J. Mar\'ik for a…

复变函数 · 数学 2019-09-04 Mario DeFranco

Let $n \ge 3$ be an integer. Let $P_n = \{1, 2, 3, ..., n-1, n \}$ and let $S_n$ be the symmetric group of permutations on $P_n$. Motivated by the theory of discrete dynamical systems on the interval, we associate each permutation $\si_n$…

环与代数 · 数学 2009-09-30 Bau-Sen Du

Let $K$ be an algebraically closed field of characteristic $0$. For $m\geq n$, we define $\tau_{m,n,k}$ to be the set of $m\times n$ matrices over $K$ with kernel dimension $\geq k$. This is a projective subvariety of $\bbP^{mn-1}$, and is…

代数几何 · 数学 2017-10-24 Xiping Zhang

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

组合数学 · 数学 2007-05-23 Leonid Gurvits

We consider polynomials $Q:=\sum _{j=0}^da_jx^j$, $a_j\in \mathbb{R}^*$, with all roots real. When the {\em sign pattern} $\sigma (Q):=({\rm sgn}(a_d),{\rm sgn}(a_{d-1})$, $\ldots$, ${\rm sgn}(a_0))$ has $\tilde{c}$ sign changes, the…

经典分析与常微分方程 · 数学 2024-05-30 Vladimir Petrov Kostov

We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…

数学物理 · 物理学 2007-05-23 Victor Tapia

Given a diagonalizable $N\times N$ matrix $H$, whose non-degenerate spectrum consists of $p$ pairs of complex conjugate eigenvalues and additional $N-2p$ real eigenvalues, we determine all metrics $M$, of all possible signatures, with…

数学物理 · 物理学 2022-01-20 Joshua Feinberg , Miloslav Znojil

We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…

概率论 · 数学 2018-09-17 Valentin Bahier

Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…

环与代数 · 数学 2021-12-15 Rod Gow

Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…

Let S_n denote the symmetric group on n letters. We consider the S_n-root lattice A_{n-1} = {(z1,...,zn) in Z^n | z1+...+zn = 0}, where S_n acts on Z^n by permuting the coordinates, and its tensor, symmetric, and exterior squares. For odd…

环与代数 · 数学 2007-05-23 Nicole Lemire , Martin Lorenz

We consider three realization problems about monic real univariate polynomials without vanishing coefficients. Such a polynomial $P:=\sum_{j=0}^db_jx^j$ defines the sign pattern $\sigma (P):=({\rm sgn}(b_d)$, $\ldots$, ${\rm sgn}(b_0))$.…

经典分析与常微分方程 · 数学 2026-01-16 Vladimir Petrov Kostov

We consider the probability $p(S_n)$ that a pair of random permutations generates either the alternating group $A_n$ or the symmetric group $S_n$. Dixon (1969) proved that $p(S_n)$ approaches $1$ as $n\to\infty$ and conjectured that…

群论 · 数学 2017-07-14 Sean Eberhard , Stefan-Christoph Virchow

Consider the algebra M(n,F) of n x n matrices over an infinite field F of arbitrary characteristic. An identity for M(n,F) with forms is such a polynomial in n x n generic matrices and in \sigma_k(x), 0<k\leq n, coefficients in the…

环与代数 · 数学 2012-10-19 Artem A. Lopatin