相关论文: A solution to the tennis ball problem

We discuss initial value problems for time evolution equations in one dimensional space which are expressed by the lattice operators and propose some new equations to which complexity of solutions is of polynomial class. Novel type of…

We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…

Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…

The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…

This letter presents the solution to a counting problem, to the best of our knowledge not known in full generality, which can be mapped to both (i) ways to lace a $N$-holes-per-side shoe with $\ell$ shoestrings and (ii) a sum over the…

This paper is devoted to the study of periodic solutions for a radially symmetric semilinear wave equation in an $n$-dimensional ball. By combining the variational methods and saddle point reduction technique, we prove there exist at least…

The following game in a similar formulation to Petri nets and chip-firing games is studied: Given a finite collection of baskets, each has an infinite number of balls of the same value. Initially, a ball from some basket is chosen to put on…

We propose a new second-order accurate lattice Boltzmann scheme that solves the quasi-static equations of linear elasticity in two dimensions. In contrast to previous works, our formulation solves for a single distribution function with a…

In this study, we present two results that relate Tutte polynomials. First, we provide new and complete polynomial invariants for graphs. We note that the number of variables of our polynomials is one. Second, let L_1 and L_2 be two…

This work presents a novel lattice-based methodology for incorporating multidimensional constraints into continuous decision variables within a genetic algorithm (GA) framework. The proposed approach consolidates established transcription…

Using the framework of pastures and foundations of matroids developed by Baker-Lorscheid, we give algorithms to: (i) compute the foundation of a matroid, and (ii) compute all morphisms between two pastures. Together, these provide an…

We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this…

We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x\ (0\leq k\leq m\leq n)$. These closed formulas consist of terms which are a…

This paper presents an iterative scheme that converges to the solution of a pseudo-monotone variational inequality problem in the setting of $\mathbb{R}^{n}$. Traditional methods often require projections onto the feasible set…

Synthesis problems for linkages in kinematics often yield large structured parameterized polynomial systems which generically have far fewer solutions than traditional upper bounds would suggest. This paper describes statistical models for…

Novel classes of dynamical systems are introduced, including many-body problems characterized by nonlinear equations of motion of Newtonian type ("acceleration equals forces") which determine the motion of points in the complex plane. These…

We consider inhomogeneous lattice walk models in a half-space and in the quarter plane. For the models in a half-space, we show by a generalization of the kernel method to linear systems of functional equations that their generating…

The paper describes a numerical method for solving acoustic multibody scattering problems in two and three dimensions. The idea is to compute a highly accurate approximation to the scattering operator for each body through a local…

We investigate the NP-Complete problem SAT and the geometry of its instances. For a particular type that we call {\it non-interlaced formulas}, we propose a polynomial time algorithm for their resolution using graphs and matrices.

We formulate the inverse scattering method for a periodic box-ball system and solve the initial value problem. It is done by a synthesis of the combinatorial Bethe ansa"tze at q=1 and q=0, which provides the ultradiscrete analogue of…