Related papers: Poincar\'{e} functions with spiders' webs

We determine what appears to be the bare-bones categorical framework for Poincar\'e-Birkhoff-Witt type theorems about universal enveloping algebras of various algebraic structures. Our language is that of endofunctors; we establish that a…

Given a polynomial diffeomorphism f: C^2 -> C^2 there is a set $J_f\subset{\bf C}^2$ which we call the Julia set of f. The set $J_f\subset C^2$ plays the role of the Julia set $J\subset{\bf C}$ for a polynomial map of C. In the study of…

For a ring $R$, Hilbert's Tenth Problem $HTP(R)$ is the set of polynomial equations over $R$, in several variables, with solutions in $R$. We view $HTP$ as an enumeration operator, mapping each set $W$ of prime numbers to $HTP(\mathbb…

We study the module $C^r(\mathcal{P})$ of piecewise polynomial functions of smoothness $r$ on a pure $n$-dimensional polytopal complex $\mathcal{P}\subset\mathbb{R}^n$, via an analysis of certain subcomplexes $\mathcal{P}_W$ obtained from…

The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…

We show that for large classes of entire functions the Julia set and the escaping set have packing dimension two. For example, this is the case for entire functions which are bounded on a curve tending to infinity. More generally, we show…

Let $G/H$ be a $p$-adic symmetric space. We compute explicitly the higher relative extension groups for all discrete series representations of $G$ in two examples: the symplectic case and the linear case. The results have immediate…

We prove that, for many parameterized problems in the class FPT, the existence of polynomial kernels implies the collapse of the W-hierarchy (i.e., W[P] = FPT). The collapsing results are also extended to assumed exponential kernels for…

Using the general theory of [10] ( hep-th 9412058 ), quantum Poincar\'e groups (without dilatations) are described and investigated. The description contains a set of numerical parameters which satisfy certain polynomial equations. For most…

In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P,…

Let $\Re_n$ be the set of all rational functions of the type $r(z) = p(z)/w(z),$ where $p(z)$ is a polynomial of degree at most $n$ and $w(z) = \prod_{j=1}^{n}(z-a_j)$, $|a_j|>1$ for $1\leq j\leq n$. In this paper, we set up some results…

A set of points $S \subseteq \mathbb{F}_p^n$ is called \emph{$p$-divisible} if every affine hyperplane in $\mathbb{F}_p^n$ intersects $S$ in $0 \pmod p$ points. The Strong Cylinder Conjecture of Ball asserts that if $S$ is a $p$-divisible…

We consider the W-extended logarithmic minimal model WLM(p,p'). As in the rational minimal models, the so-called fundamental fusion algebra of WLM(p,p') is described by a simple graph fusion algebra. The fusion matrices in the regular…

This paper, being the sequel of [An inverse problem in Polya-Schur theory. I. Non-genegerate and degenerate operators], studies a class of linear ordinary differential operators with polynomial coefficients called \emph{exactly solvable};…

For each link type $K$ in the 3-sphere, we show that there is a polynomial $p_K$ such that any two diagrams of $K$ with $c_1$ and $c_2$ crossings differ by at most $p_K(c_1) + p_K(c_2)$ Reidemeister moves. As a consequence, the problem of…

The irreducible representations of symmetric groups can be realized as certain graded pieces of invariant rings, equivalently as global sections of line bundles on partial flag varieties. There are various ways to choose useful bases of…

We obtain a unique, canonical one-to-one correspondence between the space of marked postcritically finite Newton maps of polynomials and the space of postcritically minimal Newton maps of entire maps that take the form $p(z)…

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

In this paper we study the complexity of the problems: given a loop, described by linear constraints over a finite set of variables, is there a linear or lexicographical-linear ranking function for this loop? While existence of such…

The Polyhedral Escape Problem for continuous linear dynamical systems consists of deciding, given an affine function $f: \mathbb{R}^{d} \rightarrow \mathbb{R}^{d}$ and a convex polyhedron $\mathcal{P} \subseteq \mathbb{R}^{d}$, whether, for…