Related papers: Upper Bounds of Schubert Polynomials
Jel\'inek, Mansour, and Shattuck studied Wilf-equivalence among pairs of patterns of the form $\{\sigma,\tau\}$ where $\sigma$ is a set partition of size $3$ with at least two blocks. They obtained an upper bound for the number of…
Let $f_1(x),\ldots,f_n(x)$ be some polynomials. The upper bound on the number of $x\in\mathbb F_p$ such that $f_1(x),\ldots,f_n(x)$ are roots of unit of order $t$ is obtained. This bound generalize the bound of the paper \cite{V-S} to the…
We study symmetric arithmetic circuits and improve on lower bounds given by Dawar and Wilsenach (ArXiv 2020). Their result showed an exponential lower bound of the permanent computed by symmetric circuits. We extend this result to show a…
In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum…
The Weisfeiler-Leman (WL) dimension of a graph is a measure for the inherent descriptive complexity of the graph. While originally derived from a combinatorial graph isomorphism test called the Weisfeiler-Leman algorithm, the WL dimension…
We continue with the investigation began in "The Dixmier conjecture and the shape of possible counterexamples". In that paper we introduced the notion of an irreducible pair (P,Q) as the image of the pair (X,Y) of the canonical generators…
The coefficients of the Kazhdan-Lusztig polynomials $P_{v,w}(q)$ are nonnegative integers that are upper semicontinuous on Bruhat order. Conjecturally, the same properties hold for $h$-polynomials $H_{v,w}(q)$ of local rings of Schubert…
Let lambda_s(n) denote the maximum length of a Davenport-Schinzel sequence of order s on n symbols. For s=3 it is known that lambda_3(n) = Theta(n alpha(n)) (Hart and Sharir, 1986). For general s>=4 there are almost-tight upper and lower…
Let $\mathcal{F}$ be a family of subsets of $[n]$ and $L$ be a subset of $[n]$. We say $\mathcal{F}$ is an $L$-differencing Sperner system if $|A\setminus B|\in L$ for any distinct $A,B\in\mathcal{F}$. Let $p$ be a prime and $q$ be a power…
In this paper it is proved that the ideal $I_w$ of the weak polynomial identities of the superalgebra $M_{1,1}(E)$ is generated by the proper polynomials $[x_1,x_2,x_3]$ and $[x_2,x_1][x_3,x_1][x_4,x_1]$. This is proved for any infinite…
Let S be a finite subset of a field. For multivariate polynomials the generalized Schwartz-Zippel bound [2], [4] estimates the number of zeros over Sx...xS counted with multiplicity. It does this in terms of the total degree, the number of…
Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…
The main results of this paper are accessible with only basic linear algebra. Given an increasing sequence of dimensions, a flag in a vector space is an increasing sequence of subspaces with those dimensions. The set of all such flags (the…
Suppose that $M$ is a compact Riemannian manifold with boundary and $u$ is an $L^2$-normalized Dirichlet eigenfunction with eigenvalue $\lambda$. Let $\psi$ be its normal derivative at the boundary. Scaling considerations lead one to expect…
A permutation $\sigma \in S_n$ is a $k$-superpattern (or $k$-universal) if it contains each $\tau \in S_k$ as a pattern. This notion of "superpatterns" can be generalized to words on smaller alphabets, and several questions about…
Motivated by Stanley's ``Schubert shenanigans'' paper, commendable attempts have been made to understand the principal specializations of Schubert or Grothendieck polynomials. In this paper, we prove that when a permutation $w$ does not…
This paper uses W. M. Schmidt's idea formulated in 1967 to generalise the classical theory of Diophantine approximation to subspaces of $\mathbb{R}^n$. Given two subspaces of $\mathbb{R}^n$ $A$ and $B$ of respective dimensions $d$ and $e$…
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…
Suppose $\mathcal{H}_1, \mathcal{H}_2, \ldots, \mathcal{H}_n$ are arbitrary complex Hilbert spaces, and ${\bf A}=[A_{ij}]$ is an $n\times n$ operator matrix with $A_{ij}\in \mathcal{B}(\mathcal{H}_j, \mathcal{H}_i).$ We show that $w({\bf…
Revisiting Kra\'skiewicz and Pragacz's construction of Schubert modules, we provide a new proof that their characters are equal to Schubert polynomials. The main innovation is a representation-theoretic interpretation of a recurrence…