Related papers: Number and location of pre-images under harmonic m…

We use a method for determining the number of preimages of any permutation under the stack-sorting map in order to obtain recursive upper bounds for the numbers $W_t(n)$ and $W_t(n,k)$ of $t$-stack sortable permutations of length $n$ and…

First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…

We show that any total preorder on a set with $\binom{n}{2}$ elements coincides with the order on pairwise distances of some point collection of size $n$ in $\mathbb{R}^{n-1}$. For linear orders, a collection of $n$ points in…

We give new positive results on the long-standing open problem of geometric covering decomposition for homothetic polygons. In particular, we prove that for any positive integer k, every finite set of points in R^3 can be colored with k…

In a closed, oriented ambient manifold $(M^n,g)$ we consider the problem of finding $\mathbb{S}^1$-valued harmonic maps with prescribed singular set. We show that the boundary of any oriented $(n-1)$-submanifold can be realised as the…

For a given pair of maps f,g:X->M from an arbitrary topological space to an n-manifold, the Lefschetz homomorphism is a certain graded homomorphism L:H(X)->H(M) of degree (-n). We prove a Lefschetz-type coincidence theorem: if the Lefschetz…

Under certain conditions, we give an estimate from above on the number of differential equations of order $r+1$ with prescribed regular singular points, prescribed exponents at singular points, and having a quasi-polynomial flag of…

In this note we study common preperiodic points of rational maps of the Riemann Sphere. We show that given any degrees $d_1,d_2\geq2$, outside a Zariski closed subset of the space of pairs of rational maps $(f,g)$ of degree $d_1$ and $d_2$…

We prove that a quasiisometric map between rank one symmetric spaces is within bounded distance from a unique harmonic map. In particular, this completes the proof of the Schoen-Li-Wang conjecture.

Let $K$ be a function field over an algebraically closed field $k$ of characteristic $0$, let $\varphi\in K(z)$ be a rational function of degree at least equal to $2$ for which there is no point at which $\varphi$ is totally ramified, and…

D. Khavinson and G. Swiatek proved that harmonic polynomials p(z)+q(z), where p is holomorphic, q is antiholomorphic, and deg p = n > 1 = deg q, can have at most 3n-2 complex zeros. We show that this bound is sharp for all n by proving a…

We provide examples of nonseparable compact spaces with the property that any continuous image which is homeomorphic to a finite product of spaces has a maximal prescribed number of nonseparable factors.

In this paper we enumerate $k$-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are $1,...,n$ have degree $\le 2$, and are arranged in increasing order in a horizontal line. Its arcs are drawn in the upper…

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Suppose $v(x,y):\mathbb C\rightarrow \mathbb R$ is an entire harmonic polynomial with no critical points in the right half plane. Let $z_1, z_2\in\mathbb C$ lie on a level set of $v$ , and assume ${\rm Re}(z_2)>{\rm Re}(z_1)\geq0$. We give…

We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…

We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.

We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…

We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…