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

We give the cumulative distribution functions, the expected values, and the moments of weighted lattice polynomials when regarded as real functions of independent random variables. Since weighted lattice polynomial functions include…

In this paper, we first describe how to find the generating function for the sum of the areas under generalized Dyck paths (with an arbitrary set of steps) using Motzkin paths as a motivating example. We then focus on Motzkin and Dyck…

Applying a unifying Lax operator approach to statistical systems a new class of integrable vertex models based on quantum algebra is proposed, which exhibits a rich variety for generic q, q roots of unity and q -> 1. Exact solutions are…

This paper is motivated by two problems recently proposed by Coker on combinatorial identities related to the Narayana polynomials and the Catalan numbers. We find that a bijection of Chen, Deutsch and Elizalde can be used to provide…

We consider a variation of Dyck paths, where additionally to steps $(1,1)$ and $(1,-1)$ down-steps $(1,-j)$, for $j\ge2$ are allowed. We give credits to Emeric Deutsch for that. The enumeration of such objects living in a strip is…

Path integrals represent a powerful route to quantization: they calculate probabilities by summing over classical configurations of variables such as fields, assigning each configuration a phase equal to the action of that configuration.…

A detailed combinatorial analysis of planar lattice convex polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained. The…

"Quantitative languages are extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the…

We study the higher-order Euler polynomials and give the corresponding monic orthogonal polynomials, which are Meixner-Pollaczek polynomials with certain arguments and constant factors. Moreover, through a general connection between moments…

We present counting reward automata-a finite state machine variant capable of modelling any reward function expressible as a formal language. Unlike previous approaches, which are limited to the expression of tasks as regular languages, our…

Let $(W,S)$ be a Coxeter system. A $W$-graph encodes a representation of the Hecke algebra $\mathcal{H}$ of $W$. We construct universal representations of multi-parameter Hecke algebras on certain quotients of path algebras, and study their…

In this paper we present a CAT generation algorithm for Dyck paths with a fixed length n. It is the formalization of a method for the exhaustive generation of this kind of paths which can be described by means of two equivalent strategies.…

The semiclassical solution of quantum Dirac constraints in generic constrained system is obtained by directly calculating in the one-loop approximation the gauge field path integral with relativistic gauge fixing procedure. The gauge…

We consider infinite weighted graphs $G$, i.e., sets of vertices $V$, and edges $E$ assumed countable infinite. An assignment of weights is a positive symmetric function $c$ on $E$ (the edge-set), conductance. From this, one naturally…

Since the seminal work by Angluin and the introduction of the L*-algorithm, active learning of automata by membership and equivalence queries has been extensively studied to learn various extensions of automata. For weighted automata,…

In complex algebraic geometry, the problem of enumerating plane elliptic curves of given degree with fixed complex structure has been solved by R.Pandharipande using Gromov-Witten theory. In this article we treat the tropical analogue of…

In this paper, we investigate the expressive power and the algorithmic properties of weighted expressions, which define functions from finite words to integers. First, we consider a slight extension of an expression formalism, introduced by…

Using the technique of the metrization theorem of uniformities with countable bases, in this note we provide, test and compare an explicit algorithm to produce a metric $d(x,y)$ between the vertices $x$ and $y$ of an affinity weighted…

We study the determinisation and unambiguisation problems of weighted automata over the rational field: Given a weighted automaton, can we determine whether there exists an equivalent deterministic, respectively unambiguous, weighted…

This is a book on weighted tree automata. We present the basic definitions and some of the important results in a coherent form with full proofs. The concept of weighted tree automata is part of Automata Theory and it touches the area of…