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

We study finite-dimensional integrals in a way that elucidates the mathematical meaning behind the formal manipulations of path integrals occurring in quantum field theory. This involves a proper understanding of how Wick's theorem allows…

In this work a theory is developed for unifying large classes of nonlinear discrete-time dynamical systems obeying a superposition of a weighted maximum or minimum type. The state vectors and input-output signals evolve on nonlinear spaces…

In this note we observe that a bijection related to Littelmann's root operators (for type $A_1$) transparently explains the well known enumeration by length of walks on $\N$ (left factors of Dyck paths), as well as some other enumerative…

In this paper by using $W_{n}$-mapping, we introduce a composite iterative method for finding a common fixed point for infinite family of nonexpansive mappings and a solution of a certain variational inequality. Furthermore, the strong…

Mensky has suggested to account for "continuous measurement" by attaching to a path integral a weight function centered around the classical path that the integral assigns a probability amplitude to. We show that in fact this weight…

We establish three identities involving Dyck paths and alternating Motzkin paths, whose proofs are based on variants of the same bijection. We interpret these identities in terms of closed random walks on the halfline. We explain how these…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

We present an algorithm to build an automaton from a rational expression. This approach introduces support for extended weighted expressions. Inspired by derived-term based algorithms, its core relies on a different construct, rational…

Quantum Dirac constraints in generic constrained system are solved by directly calculating in the one-loop approximation the path integral with relativistic gauge fixing procedure. The calculations are based on the reduction algorithms for…

We describe an efficient position space technique to calculate lattice Feynman integrals in infinite volume. The method applies to diagrams with massless propagators. For illustration a set of two-loop integrals is worked out explicitly. An…

This paper establishes the existence of infinitely many solutions for nonlinear problems without any symmetry, achieving three major advances. First, in the setting of semilinear elliptic PDEs, we introduce a refined variational truncation…

Asinowski, Bacher, Banderier and Gittenberger (A. Asinowski, A. Bacher, C. Banderier and B. Gittenberger. Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown…

It is well known that the emptiness problem for binary probabilistic automata and so for quantum automata is undecidable. We present the current status of the emptiness problems for unary probabilistic and quantum automata with connections…

The lattice formulation provides a way to regularize, define and compute the Path Integral in a Quantum Field Theory. In this paper we review the theoretical foundations and the most basic algorithms required to implement a typical lattice…

The notion of comparison between system runs is fundamental in formal verification. This concept is implicitly present in the verification of qualitative systems, and is more pronounced in the verification of quantitative systems. In this…

A path-integral approach for the computation of quantum-mechanical propagators and energy Green's functions is presented. Its effectiveness is demonstrated through its application to singular interactions, with particular emphasis on the…

This article deals with the enumeration of directed lattice walks on the integers with any finite set of steps, starting at a given altitude $j$ and ending at a given altitude $k$, with additional constraints such as, for example, to never…

In the 1980s, Viennot developed a combinatorial approach to studying mixed moments of orthogonal polynomials using Motzkin paths. Recently, an alternative combinatorial model for these mixed moments based on lecture hall paths was…

Let $G$ be a directed graph on $n$ vertices. Given an integer $k<=n$, the SIMPLE $k$-PATH problem asks whether there exists a simple $k$-path in $G$. In case $G$ is weighted, the MIN-WT SIMPLE $k$-PATH problem asks for a simple $k$-path in…

Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…