相关论文: Rudin-Kisler ordering on the P-hierarchy

In this paper we study the fifth order Kadomtsev--Petviashvili II (KP--II) equation on the upper half-plane $U=\{(x,y)\in \R^2: y>0\}$. In particular we obtain low regularity local well-posedness using the restricted norm method of Bourgain…

We study the gaps $\Delta p_n$ between consecutive rank sizes in $r$-differential posets by introducing a projection operator whose matrix entries can be expressed in terms of the number of certain paths in the Hasse diagram. We strengthen…

Let $K$ be a compact subset of the complex plane $\mathbb C.$ Let $P(K)$ and $R(K)$ be the closures in $C(K)$ of analytic polynomials and rational functions with poles off $K,$ respectively. Let $A(K) \subset C(K)$ be the algebra of…

Let X be a projective curve over Q and t a non-constant Q-rational function on X of degree n>1. For every integer a pick a points P(a) on X such that t(P(a))=a. Dvornicich and Zannier (1994) proved that for large N the field Q(P(1), ...,…

We prove hypergraph variants of the celebrated Alon-Roichman theorem on spectral expansion of sparse random Cayley graphs. One of these variants implies that for every prime $p\geq 3$ and any $\varepsilon > 0$, there exists a set of…

In the early 1970's, Richard Stanley and Kenneth Johnson introduced and laid the groundwork for studying the order polynomial of partially ordered sets (posets). Decades later, Hamaker, Patrias, Pechenik, and Williams introduced the term…

This is an review on the point classification of second order ODE's by Ruslan Sharipov. His works were published in 1997-1998 at the Electronic Archive at LANL and undeservedly forgotten. Last chapter is an application of this…

Tverberg's theorem asserts that every (k-1)(d+1)+1 points in R^d can be partitioned into k parts, so that the convex hulls of the parts have a common intersection. Calder and Eckhoff asked whether there is a purely combinatorial deduction…

We present a new, very short proof of a conjecture by I. Ra\c{s}a, which is an inequality involving basic Bernstein polynomials and convex functions. It was affirmed positively very recently by J. Mrowiec, T. Rajba and S. W\k{a}sowicz…

For a poset $P$ and an integer $r\geq 1$, let $P_r$ be a collection of all $r$-multichains in $P$. Corresponding to each strictly increasing map $\i:[r]\rightarrow [2r]$, there is an order $\preceq_{\i}$ on $P_r$. Let $\D(G_{\i}(P_r))$ be…

We prove a conjecture of Dukes and Herke concerning the possible orders of a basis for the cyclic group Z_n, namely : For each k \in N there exists a constant c_k > 0 such that, for all n \in N, if A \subseteq Z_n is a basis of order…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

A new class of copulas based on order statistics was introduced by Baker (2008). Here, further properties of the bivariate and multivariate copulas are described, such as that of likelihood ratio dominance (LRD), and further bivariate…

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

Every set of points $\mathcal{P}$ determines $\Omega(|\mathcal{P}| / \log |\mathcal{P}|)$ distances. A close version of this was initially conjectured by Erd\H{o}s in 1946 and rather recently proved by Guth and Katz. We show that when near…

$\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\eps}{\varepsilon} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}} \newcommand{\Polygon}{\mathsf{P}} \newcommand{\IntRange}[1]{[ #1 ]}…

Sorokin gave in 1996 a new proof that pi is transcendental. It is based on a simultaneous Pad\'e approximation problem involving certain multiple polylogarithms, which evaluated at the point 1 are multiple zeta values equal to powers of pi.…

An ordered biclique partition of the complete graph $K_n$ on $n$ vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of $K_n$ is covered by at least one and at most two bicliques in the…

Guth and Katz proved that any point set $\mathcal P$ in the plane determines $\Omega(|\mathcal P|/\log|\mathcal P|)$ distinct distances. We show that when near to this lower bound, a point set $\mathcal P$ of the form $A\times A$ must…

Resolvent degree ($\operatorname{RD}$) is an invariant of finite groups in terms of the complexity of their algebraic actions. We address the problem of bounding $\operatorname{RD}(G)$ for all finite simple groups using the methods…