arXiv research

Counting HCMU sphere components using weighted trees.

Solves weighted bi-colored plane tree enumeration and applies to geometric problems.

This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of perfect matchings (or dimers) of this graph. The weights are Tutte'…

Asymptotic subcone of an unbounded metric space is another metric space, capturing the structure of the original space at infinity. In this paper we define a functional metric space S which is an asymptotic subcone of the hyperbolic plane. This space is a real tree branching at every its point. Moreover, it is a homoge…

Paper introduces clock moves for plane graphs and proves Alexander polynomial properties.

We give a criterion when a planar tree-like curve, i.e. a generic immersed plane curve each double point of which cuts it into two disjoint parts, can be send by a diffeomorphism of the plane onto a curve with no inflection points. We also present some upper and lower bounds for the minimal number of inflection points …

The study proves a conjecture about arborescent links with many twigs.

Study on inflection points of plane curve shadows with fixed embedded shapes.

Study of Ricci flow on trees, focusing on edge weights and curvatures.

We construct a geodesic net in the plane with four unbalanced (boundary) vertices that has 16 balanced vertices and does not contain proper geodesic subnets. This is the first example of an irreducible geodesic net in the Euclidean plane with 4 boundary vertices that is not a tree.

Let $F$ be a non-singular foliation on the plane with all leaves being closed subsets, $H^{+}(F)$ be the group of homeomorphisms of the plane which maps leaves onto leaves endowed with compact open topology, and $H^{+}_{0}(F)$ be the identity path component of $H^{+}(F)$. The quotient $π_0 H^{+}(F) = H^{+}(F)/H^{+}_{0}…

In this work, we study a family of Cremona transformations of weighted projective planes which generalize the standard Cremona transformation of the projective plane. Starting from special plane projective curves we construct families of curves in weighted projective planes with special properties. We explain how to co…

AF improves classification models by adaptively weighting trees.

New isoperimetric inequalities in the plane with radial weights identified.

We study periodic wind-tree models, billiards in the plane endowed with $\mathbb{Z}^2$-periodically located identical connected symmetric right-angled obstacles. We show asymptotic formulas for the number of (isotopy classes of) closed billiard trajectories (up to $\mathbb{Z}^2$-translations) on the wind-tree billiard.…

AGBoost uses attention weights to improve GBM for regression problems.

Study of circle configurations in the plane, proving aspherical space and computing fundamental groups.

Among all torus links, we characterise those arising as links of simple plane curve singularities by the property that their fibre surfaces admit only a finite number of cutting arcs that preserve fibredness. The same property allows a characterisation of Coxeter-Dynkin trees (i.e., $A_n$, $D_n$, $E_6$, $E_7$ and $E_8$…

New method embeds phylogenetic trees for clustering, recovering evolutionary relationships.

Introduces a theorem for groups acting on trees.

To every tree we associate a filtered cochain complex. Its cohomology and the corresponding spectral sequence have clear combinatorial description. If a tree is the Dynkin diagram of a simple plane curve singularity, the graded Euler characteristic of this complex coincides with the Alexander polynomial of the link. In…

We deduce from a rooted tree in the disk a slalom divide and a slalom knot. A slalom knot is either the local link of a simple plane curve singularity of type A_2n, E_6, E_8 or a fibered hyperbolic knot with very special monodromy.

The paper proposes a method to improve random forest classification accuracy by weighting trees based on their decision path reliability.

In this paper, we investigate the statistical features of the weighted international-trade network. By finding the maximum weight spanning trees for this network we make the extraction of the truly relevant connections forming the network's backbone. We discuss the role of large-sized countries (strongest economies) in…

Alexander polynomial equals spanning tree count at t=1.

Paper proposes an algorithm to reconstruct optimal model structure from graph adjacency matrix.

This work presents an approach to automatically induction for non-greedy decision trees constructed from neural network architecture. This construction can be used to transfer weights when growing or pruning a decision tree, allowing non-greedy decision tree algorithms to automatically learn and adapt to the ideal arch…

New relation on paths is not transitive.

We introduce a new spatial data structure for high dimensional data called the \emph{approximate principal direction tree} (APD tree) that adapts to the intrinsic dimension of the data. Our algorithm ensures vector-quantization accuracy similar to that of computationally-expensive PCA trees with similar time-complexity…

Uniform proof reconstructs spaces using cross ratio on boundary.

In this paper, we classify the class of constant weighted curvature curves in the plane with a log-linear density, or in other words, classify all traveling curved fronts with a constant forcing term in $\Bbb R^2.$ The classification gives some interesting phenomena and consequences including: the family of curves conv…

In "The Gel'fand-Kalinin-Fuks class and characteristic classes of transversely symplectic foliations", arXiv:0910.3414, (October 2009) by D.Kotschick and S.Morita, the relative Gel'fand-Kalinin-Fuks cohomology groups of the formal Hamiltonian vector fields without constant vector fields on 2n-plane were characterized b…

New method improves feature selection in tree-based models.

Study of $n$-cylinder surfaces to calculate Masur-Veech volumes.

Let $S$ be a projective plane with $3$ holes. We prove that there is an exhaustion of the curve complex $\mathcal{C}(S)$ by a sequence of finite rigid sets. As a corollary, we obtain that the group of simplicial automorphisms of $\mathcal{C}(S)$ is isomorphic to the mapping class group $\mathrm{Mod}(S)$. We also prove …

We study colorings of the hyperbolic plane, analogously to the Hadwiger-Nelson problem for the Euclidean plane. The idea is to color points using the minimum number of colors such that no two points at distance exactly $d$ are of the same color. The problem depends on $d$ and, following a strategy of Kloeckner, we show…

We investigate the problem of sequentially predicting the binary labels on the nodes of an arbitrary weighted graph. We show that, under a suitable parametrization of the problem, the optimal number of prediction mistakes can be characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the g…

New system studies trapped light paths in Euclidean space.

The purpose of this paper is twofold. On one hand, we introduce a modification of the dual canonical basis for invariant tensors of the 3-dimensional irreducible representation of $U_q(sl_2)$, given in terms of Jacobi diagrams, a central tool in quantum topology. On the other hand, we use this modified basis to study t…

G-FIGS uses instance weights to create interpretable models from diverse data.

Constructs weight 1/2 multiplier systems for a specific group and relates to geometric edge paths.

Symmetric TSP is structurally equivalent to a constrained Group Steiner Tree Problem.

We introduce a new class of lower bounds on the log partition function of a Markov random field which makes use of a reversed Jensen's inequality. In particular, our method approximates the intractable distribution using a linear combination of spanning trees with negative weights. This technique is a lower-bound count…

Enhanced Random Forests outperform XGBoost across binary classification datasets.

WildWood improves Random Forest predictions using bootstrap out-of-bag samples.

Classifies pseudo-Anosov flows on 3-manifolds up to orbit equivalence.

Sparse oblique decision tree improves security rules for renewable power systems.

TREX explains tree ensembles by identifying key training examples.