相关论文: A solution to the tennis ball problem
In this paper we present in detail Newton's method and its modification, based on the Continuous analog of Newton's method for computing periodic orbits of the planar three-body problem. The linear system at each step of the method is…
Let $f \in L_{loc}^1 (\R^n)\cap \mathcal{S}$, where $\mathcal{S}$ is the Schwartz class of distributions, and $$\int_{\sigma (D)} f(x) dx = 0 \quad \forall \sigma \in G, \qquad (*)$$ where $D\subset \R^n$ is a bounded domain, the closure…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
We construct a matrix model equivalent (exactly, not asymptotically), to the random plane partition model, with almost arbitrary boundary conditions. Equivalently, it is also a random matrix model for a TASEP-like process with arbitrary…
This is a survey of results in the enumeration of lattice paths.
In this paper, we consider the {\it tensor absolute value equations} (TAVEs), which is a newly introduced problem in the context of multilinear systems. Although the system of TAVEs is an interesting generalization of matrix {\it absolute…
This paper presents a unified optimization-based path planning approach to efficiently compute locally optimal solutions to advanced path planning problems. The approach is motivated by first showing that a lattice-based path planner can be…
Recent work of the author connected several parking function enumeration problems to enumerations of Catalan paths with respect to certain weight functions that are expressed in terms of the ascent lengths. Motivated by this, we generalise…
As a prelude to what might be expected as forthcoming breakthroughs in finding new approaches toward solving three-dimensional lattice models in the twenty-first century, we review the exact solutions of two lattice models in three…
The scattering equations are a set of algebraic equations connecting the kinematic space of massless particles and the moduli space of Riemann spheres with marked points. We present an efficient method for solving the scattering equations…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
Counting the number of permutations of a given total displacement is equivalent to counting weighted Motzkin paths of a given area (Guay-Paquet and Petersen, 2014). The former combinatorial problem is still open. In this work, we show that…
We study a group of new methods to solve an open problem that is the shortest paths problem on a given fix-weighted instance. It is the real significance at a considerable altitude to reach our aim to meet these qualities of generic,…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
Mathematics has been used in the exploration and enumeration of juggling patterns. In the case when we catch and throw one ball at a time the number of possible juggling patterns is well-known. When we are allowed to catch and throw any…
We introduce a new representation concept for lattices by boolean matrices, and utilize it to prove that any matroid is boolean representable. We show that such a representation can be easily extracted from a representation of the…
We give mean square bounds for the remainder in the lattice point counting problem, counting the number of lattice points in a large ball in $\mathbb{R}^d$, when averaged over families of shears of the lattice.
A full multigrid finite element method is proposed for semilinear elliptic equations. The main idea is to transform the solution of the semilinear problem into a series of solutions of the corresponding linear boundary value problems on the…
In this thesis we develop generalized versions of the Chung-Feller theorem for lattice paths constrained in the half plane. The beautiful cycle method which was developed by Devoretzky and Motzkin as a means to prove the ballot problem is…
We present a theoretical framework for characterizing the geometrical properties of the space of solutions in constraint satisfaction problems, together with practical algorithms for studying this structure on particular instances. We apply…