Related papers: On wavelet polynomials and Weyl multipliers

For $ f\in\mathbb{Z}[X] $ an irreducible polynomial of degree $ n $, the Cilleruelo's conjecture states that$$\log(\mbox{lcm}(f(1),\dots,f(M)))\sim(n-1)M\log M$$as $ M\rightarrow+\infty $, where $ \mbox{lcm}(f(1),\dots,f(M)) $ is the least…

For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…

The main goal of our paper is to establish a connection between the Weyl modules of the current Lie superalgebras (twisted and untwisted) attached to $\mathfrak{osp}(1,2)$ and the nonsymmetric Macdonald polynomials of types $A_2^{(2)}$ and…

We give a new fractal Weyl upper bound for resonances of convex co-compact hyperbolic manifolds in terms of the dimension $n$ of the manifold and the dimension $\delta$ of its limit set. More precisely, we show that as $R\to\infty$, the…

We study the maximum $\phi_N^*$ of the partition function of the two dimensional (subcritical) Gaussian directed polymer over an $\sqrt N \times \sqrt N$ box. We show that $\phi_N^*/\log N$ converges towards a constant $\sigma^*$, which we…

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

We give an equivariant version of Packer and Rieffel's theorem on sufficient conditions for the existence of orthonormal wavelets in projective multiresolution analyses. The scaling functions that generate a projective multiresolution…

The maximum weighted matching (MWM) problem is one of the most well-studied combinatorial optimization problems in distributed graph algorithms. Despite a long development on the problem, and the recent progress of Fischer, Mitrovic, and…

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

Starting from de la Vall\'ee Poussin type (VP) interpolation, the authors have recently introduced a family of interpolating polynomial scaling and wavelet bases generating the approximation and detail spaces of a non-standard…

An explicit description of all Walsh polynomials generating tight wavelet frames is given. An algorithm for finding the corresponding wavelet functions is suggested, and a general form for all wavelet frames generated by an appropriate…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

In this paper we show that the only sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ satisfying \begin{align*} \phi(x)\mathcal{D}_q P_{n}(x)=a_n\mathcal{S}_q P_{n+1}(x) +b_n\mathcal{S}_q P_n(x) +c_n\mathcal{S}_q P_{n-1}(x),…

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…

Let $I(t)= \oint_{\delta(t)} \omega$ be an Abelian integral, where $H=y^2-x^{n+1}+P(x)$ is a hyperelliptic polynomial of Morse type, $\delta(t)$ a horizontal family of cycles in the curves $\{H=t\}$, and $\omega$ a polynomial 1-form in the…

Polynomial invariants are fundamental objects in analysis on Lie groups and symmetric spaces. Invariant differential operators on symmetric spaces are described by Weyl group invariant polynomial. In this article we give a simple criterion…

Let Phi be a reduced root system of rank r. A Weyl group multiple Dirichlet series for Phi is a Dirichlet series in r complex variables s_1,...,s_r, initially converging for Re(s_i) sufficiently large, that has meromorphic continuation to…

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

Let $f(n,\ell)$ be the maximum integer such that every set of $n$ points in the plane with at most $\ell$ collinear contains a subset of $f(n,\ell)$ points with no three collinear. First we prove that if $\ell \leq O(\sqrt{n})$ then…

Using the general framework of polynomial representations defined by Doty and generalizing the definition given by Doty, Nakano and Peters for $G = \mathrm{GL}_n$, we consider polynomial representations of $G_r T$ for an arbitrary closed…