相关论文: Applications in Enumerative Combinatorics of Infin…

In this work we consider two different aspects of weighted walks in cones. To begin we examine a particular weighted model, known as the Gouyou-Beauchamps model. Using the theory of analytic combinatorics in several variables we obtain the…

We present a generalization of the master solution to the quantum Yang-Baxter equation (obtained recently in arXiv:1006.0651) to the case of multi-component continuous spin variables taking values on a circle. The Boltzmann weights are…

We propose a new iterative scheme to compute the numerical solution to an over-determined boundary value problem for a general quasilinear elliptic PDE. The main idea is to repeatedly solve its linearization by using the quasi-reversibility…

In this paper, we address a class of specially structured problems that include speed planning, for mobile robots and robotic manipulators, and dynamic programming. We develop two new numerical procedures, that apply to the general case and…

We recall the main types of lattice paths, which are sequences in the lattice of integer coordinates points in the plane. We start with the fundamental central lattice paths and Dyck paths and proceed in elementary terms through recently…

We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems, two from the theory of matroids and the third from graph theory. The input to the Weighted Diverse Bases problem…

Consider a weighted directed acyclic graph $G$ having an upward planar drawing. We give a formula for the total weight of the families of non-intersecting paths on $G$ with any given starting and ending points. While the…

We study an ancient problem that in a static or dynamical system, sought an optimal path, which the context always means within an extremal condition. In fact, through those discussions about this theme, we established a universal essential…

Let $G=(V,E)$ be a locally finite graph. Firstly, using calculus of variations, including a direct method of variation and the mountain-pass theory, we get sequences of solutions to several local equations on $G$ (the Schr\"odinger…

We consider directed graphs with edge labels from a semiring. We present an algorithm that allows efficient execution of queries for existence and weights of paths, and allows updates of the graph: adding nodes and edges, and changing…

We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…

We present a generalized unitarity method for theories of point-particle worldlines coupled to gravity, analogous to that of scattering amplitudes in quantum field theory. This method allows the computation of perturbative observables from…

In this article we propose a general method of obtaining infinite sums of products with functions that count patterns in numbers.

A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…

The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…

In this paper we consider an alternative formulation of a class of stochastic wave and master equations with scalar noise that are used in quantum optics for modelling open systems and continuously monitored systems. The reformulation is…

In the present paper, employing properties of the complete elliptic integrals of the first and second kind, we deduce closed-form formulae for the lattice sums and other new formulae. Applications to the effective properties of regular and…

Compact representations of automata are important for efficiency. In this paper, we study methods to compute reduced automata, in which no two states accept the same language. We do this for finitary automata (FA), an abstract definition…

We present guidelines for deriving new Nitsche Finite Element Methods to enforce equality and inequality constraints that act on the value of the unknown mechanical quantity. We first formulate the problem as a stabilized finite element…

Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to design a (probabilistic or deterministic) cellular…