Search

Solutions to most nonlinear ordinary differential equations (ODEs) rely on numerical solvers, but this gives little insight into the nature of the trajectories and is relatively expense to compute. In this paper, we derive analytic solutions to a class of nonlinear, homogeneous ODEs with linear and quadratic terms on the right-hand side. We formulate a power series expansion of each state variable, whose function depends on the eigenvalues of the linearized system, and solve for the coefficients using some linear algebra and combinatorics. Various experiments exhibit quickly decaying coefficients, such that a good approximation to the true solution consists of just a few terms. [ABSTRACT FROM AUTHOR]

Leibniz's famous proposition that God has created the best of all possible worlds holds a significant place in his philosophical system. However, the precise manner in which God determines which world is the best remains somewhat ambiguous. Leibniz suggests that a form of "Divine mathematics" is employed to construct and evaluate possible worlds. In this paper, I uncover the underlying mechanics of Divine mathematics by formally reconstructing it. I argue that Divine mathematics is a one-player combinatorial game, in which God's goal is to find the best combination among many possibilities. Drawing on the combinatorial theory, I provide new solutions to some puzzles of compossibility. [ABSTRACT FROM AUTHOR]

In 2013, while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, Blondin Massé et al. found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have specific interesting properties that involve notions of combinatorics on words such as palindromicity, periodicity and symmetry. Furthermore, they defined a notion of reducibility on double squares using homologous morphisms, so leading to a set of irreducible tile elements called prime double squares. The authors, by inspecting the boundary words of the smallest prime double squares, conjectured the strong property that no runs of two (or more) consecutive equal letters are present there. In this paper, we prove such a conjecture using combinatorics on words' tools, and setting the path to the definition of a fast generation algorithm and to the possibility of enumerating the elements of this class w.r.t. standard parameters, as perimeter and area. [ABSTRACT FROM AUTHOR]

This study develops a combinatorial approach for nonparametric short-term queue length estimation in terms of cycle-by-cycle partially observed queues from probe vehicles (PV). The method does not assume random arrivals and does not assume any primary parameters or estimation of any parameters but uses simple algebraic expressions that only depend on signal timing. For an approach lane at a traffic intersection, the conditional queue lengths given probe vehicle location, count, time, and analysis interval (e.g., at the end of the red signal phase) are represented by a Negative Hypergeometric distribution. The simple analytical estimators obtained are compared with parametric methods from literature and highway capacity manual methods using field test data and simulation data involving probe vehicles. The analysis indicates that the nonparametric models presented in this paper match the accuracy of the parametric ones used in the field test and simulated data for estimating queue lengths. • Two new models are derived for short-term queue length estimation. • The models are based on combinatorics and nonparametric. • The models are closed-form input–output formulas. • New probability mass functions for traffic queues are derived. • The models can be used in connected traffic signals. [ABSTRACT FROM AUTHOR]

In 2017, Davis, Nelson, Petersen, and Tenner (Davis et al. (2018) [1]) initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to compute p n (S) , the number of permutations in S n with pinnacle set S , and a conjectural closed formula for the related numbers q n (S). This conjecture was proved between the first draft of this paper and its final version by Fang (2022) [4] and later by Minnich [7]. We also determine the lexicographically minimal elements of the orbits of the modified Foata-Strehl action, prove that these elements form a lower ideal of the left weak order and characterize and count the maximal elements of this ideal. [ABSTRACT FROM AUTHOR]