相关论文: Inverses of monomial Cremona maps

We show that for a monic polynomial p of degree d, the length of the level set {z: |p(z)|=1} is at most 9.2 d, which improves an earlier estimate due to P. Borwein. For d=2 we show that the extremal level set is the Bernoullis' Lemniscate.…

Plane mirror can make one object into two for observers on the object's side. Yet, there seems no way to achieve the same effect for observers from all directions. In this letter, we will design a new class of gradient index lenses from…

This paper studies the space of degree $d>1$ invariant q-laminations, i.e., geodesic laminations invariant under the $d$-tupling map of the circle and associated with equivalence relations. Our main construction associates a q-lamination…

Explicit inversion formulas for a subclass of integral operators with $D$-difference kernels on a finite interval are obtained. A case of the positive operators is treated in greater detail. An application to the inverse problem to recover…

Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…

We give equivalent conditions for a monomial sequence to be a d-sequence or a proper sequence, and a sufficient condition for a monomial sequence to be an s-sequence in order to compute invariants of the symmetric algebra of the ideal…

The diameter of a directed graph is the maximum distance between any pair of vertices. We study a problem that generalizes \textsc{Oriented Diameter}: For a given directed graph and a positive integer $d$, what is the minimum number of arc…

We study distortion of elements in two-dimensional Cremona groups over algebraically closed fields of characteristic zero. Namely, we obtain the following trichotomy: non-elliptic elements (i.e., those whose powers have unbounded degree)…

We look at sequences of positive integers that can be realized as degree sequences of iterates of rational dominant maps of smooth projective varieties over arbitrary fields. New constraints on the degree growth of endomorphisms of the…

A polynomial of degree $n$ in two variables is shown to be uniquely determined by its Radon projections taken over $[n/2]+1$ parallel lines in each of the $(2[(n+1)/2]+1)$ equidistant directions along the unit circle.

This is a note on the classical Waring's problem for several homogeneous forms. For positive integers (n,d,r,s), fix a general r-dimensional subspace of degree d forms in n+1 variables. We describe the family of s-sided polar polyhedra of…

We suggest two related conjectures dealing with the existence of spanning irregular subgraphs of graphs. The first asserts that any $d$-regular graph on $n$ vertices contains a spanning subgraph in which the number of vertices of each…

This article studies the sequence of iterative degrees of a birational map of the plane. This sequence is known either to be bounded or to have a linear, quadratic or exponential growth. The classification elements of infinite order with a…

For a positive integer $k\ge 1$, a graph $G$ is $k$-stepwise irregular ($k$-SI graph) if the degrees of every pair of adjacent vertices differ by exactly $k$. Such graphs are necessarily bipartite. Using graph products it is demonstrated…

In Micchelli's paper "Interpolation of scattered data: distance matrices and conditionally positive functions", deep results were obtained concerning the invertibility of matrices arising from radial basis function interpolation. In…

In this paper, we give some results on the number of meromorphic mappings of C^m into P^n under a condition on the inverse images of hyperplanes in P^n. At the same time, we give an answer for an open question by H.Fujimoto.

Degree-$d$-invariant laminations of the disk model the dynamical action of a degree-$d$ polynomial; such a lamination defines an equivalence relation on $S^1$ that corresponds to dynamical rays of an associated polynomial landing at the…

We show that if $p_1,p_2$ are injective, integer polynomials that vanish at the origin, such that either both are of degree $1$ or both are of degree $2$ or higher, then double recurrence fails for non-commuting, mixing, zero entropy…

We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective…

We introduce a simple, rank-based algorithm for inverting the sweep map on (2n,n)-Dyck paths.