Related papers: Rotor-Routing Induces the Only Consistent Sandpile…
Decision trees and logistic regression are one of the most popular and well-known machine learning algorithms, frequently used to solve a variety of real-world problems. Stability of learning algorithms is a powerful tool to analyze their…
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed order. Cooper and Spencer (Comb. Probab. Comput. (2006)) show a…
We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees…
We give an algorithm to construct a translation-invariant transport kernel between ergodic stationary random measures $\Phi$ and $\Psi$ on $\mathbb R^d$, given that they have equal intensities. As a result, this yields a construction of a…
Tree decompositions were developed by Robertson and Seymour. Since then algorithms have been developed to solve intractable problems efficiently for graphs of bounded treewidth. In this paper we extend tree decompositions to allow cycles to…
Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…
Rylls tilt-rotor is a UAV with eight inputs; the four magnitudes of the thrusts as well as four tilting angles of the thrusts can be specified in need, e.g., based on a control rule. Despite of the success in simulation, conventional…
Provably finding stationary points on bounded-rank tensors turns out to be an open problem [E. Levin, J. Kileel, and N. Boumal, Math. Program., 199 (2023), pp. 831--864] due to the inherent non-smoothness of the set of bounded-rank tensors.…
The two components for infinite exchangeability of a sequence of distributions $(P_n)$ are (i) consistency, and (ii) finite exchangeability for each $n$. A consequence of the Aldous-Hoover theorem is that any node-exchangeable,…
This is an expository paper giving a proof of the existence and uniqueness of smooth structures (hence also PL structures) on topological surfaces. Most published proofs rely on the topological Schoenflies theorem, but here we use instead…
Stability is an important issue in order to characterize the performance of a network, and it has become a major topic of study in the last decade. Roughly speaking, a communication network system is said to be stable if the number of…
This work proposes a cooperative strategy for a group of quadrotors interacting over ring digraphs with macro-vertices of size two. Consensus for a group of general double integrators has been initially investigated, and it has been proved…
In this paper, we study an extension of the CPE conjecture to manifolds $M$ which support a structure relating curvature to the geometry of a smooth map $\varphi : M \to N$. The resulting system, denoted by $(\varphi-\mathrm{CPE})$, is…
In this article, we give combinatorial formulas for the regularity and the projective dimension of $3$-path ideals of chordal graphs, extending the well-known formulas for the edge ideals of chordal graphs given in terms of the induced…
We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…
An algorithm is described for the construction of actions for scalar, spinor, and vector gauge fields that remains well-defined when the metric is degenerate and that involve no contravariant tensor fields. These actions produce the…
This paper provides some technical results needed in "Formalism for Relative Gromov-Witten Invariants." We study line-bundles on the moduli stacks of relative stable and rubber maps that are used to define relative Gromov-Witten invariants…
A cycle basis in an undirected graph is a minimal set of simple cycles whose symmetric differences include all Eulerian subgraphs of the given graph. We define a rooted cycle basis to be a cycle basis in which all cycles contain a specified…
The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…