相关论文: Virial Expansion Bounds Through Tree Partition Sch…

We provide polynomial upper bounds for the minimal sizes of distal cell decompositions in several kinds of distal structures, particularly weakly $o$-minimal and $P$-minimal structures. The bound in general weakly $o$-minimal structures…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

It is well known that the spectral radius of a tree whose maximum degree is $D$ cannot exceed $2\sqrt{D-1}$. In this paper we derive similar bounds for arbitrary planar graphs and for graphs of bounded genus. It is proved that a the…

A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta+1)/2\rceil$ linear forests. We prove that $\Delta/2…

We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees in the d-dimensional Banach spaces \ell_p^d independent of d. This is in contrast to Minimal Spanning Trees, where the maximum degree of vertices…

Recursive decision trees are widely used to estimate heterogeneous causal treatment effects in experimental and observational studies. These methods are typically implemented using CART-type recursive partitioning and are often viewed as…

Decision tree learning is increasingly being used for pointwise inference. Important applications include causal heterogenous treatment effects and dynamic policy decisions, as well as conditional quantile regression and design of…

We present numerical solutions to the extended Doering-Constantin variational principle for upper bounds on the energy dissipation rate in turbulent plane Couette flow. Using the compound matrix technique in order to reformulate this…

Exact results are given for the fourth virial coefficient of hard spheres in even dimensions up through 12. The fifth and sixth virial coefficients are numerically computed for dimensions 2 through 50 and it is found that the sixth virial…

A scaling theory is developed for diffusion-limited cluster aggregation in a porous medium, where the primary particles and clusters stick irreversibly to the walls of the pore space as well as to each other. Three scaling regimes are…

We study a model of growing planar tree graphs where in each time step we separate the tree into two components by splitting a vertex and then connect the two pieces by inserting a new link between the daughter vertices. This model…

We study a general model of recursive trees where vertices are equipped with independent weights and at each time-step a vertex is sampled with probability proportional to its fitness function (a function of its weight and degree) and…

Based on the density of connections between the nodes of high degree, we introduce two bounds of the spectral radius. We use these bounds to split a network into two sets, one of these sets contains the high degree nodes, we refer to this…

Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…

The main purpose of this paper is to prove that the point-line incidence bound due to Vinh (2011) over arbitrary finite fields can be improved in certain ranges by using tools from the VC-dimension theory. As consequences, a number of…

One proves a far-reaching upper bound for the degree of a generically finite rational map between projective varieties over a base field of arbitrary characteristic. The bound is expressed as a product of certain degrees that appear…

Fix a container polygon $P$ in the plane and consider the convex hull $P_n$ of $n\geq 3$ independent and uniformly distributed in $P$ random points. In the focus of this paper is the vertex number of the random polygon $P_n$. The precise…

We give upper bounds for the dimension of the set of hypersurfaces of $\mathbb{P}^N$ whose intersection with a fixed integral projective variety is not integral. Our upper bounds are optimal. As an application, we construct, when possible,…

A decision tree is commonly restricted to use a single hyperplane to split the covariate space at each of its internal nodes. It often requires a large number of nodes to achieve high accuracy, hurting its interpretability. In this paper,…

We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…