Related papers: Rigorous lower bounds for the domains of definitio…
We propose a generating functional for nonrelativistic gauge invariant actions. In particular, we consider actions without the usual magnetic term. Like in the Born-Infeld theory, there is an upper bound to the electric field strength in…
Extended regular expressions with counting and interleaving are widely used in practice. However the related theoretical studies for this kind of expressions currently cannot meet the need of practical work. This paper develops syntax…
Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…
In this article, we present explicit estimates of the size of the domain on which the Implicit Function Theorem and the Inverse Function Theorem are valid. For maps that are twice continuously differentiable, these estimates depend upon the…
Graphs are important data representations for describing objects and their relationships, which appear in a wide diversity of real-world scenarios. As one of a critical problem in this area, graph generation considers learning the…
Diffusion generative models have recently been applied to domains where the available data can be seen as a discretization of an underlying function, such as audio signals or time series. However, these models operate directly on the…
Random graph models are frequently used as a controllable and versatile data source for experimental campaigns in various research fields. Generating such data-sets at scale is a non-trivial task as it requires design decisions typically…
In this work, we present some recommendations on the evaluation of state-of-the-art generative models for constrained generation tasks. The progress on generative models has been rapid in recent years. These large-scale models have had…
Constrained generative modeling is fundamental to applications such as robotic control and autonomous driving, where models must respect physical laws and safety-critical constraints. In real-world settings, these constraints rarely take…
In this work a method is presented to derive the generating functional in path integral form for a system with an arbitrary number of degrees of freedom and constrained by general conditions. The method is applied to the case of the…
We investigate meandric systems with a large number of loops using tools inspired by free probability. For any fixed integer $r$, we express the generating function of meandric systems on $2n$ points with $n-r$ loops in terms of a finite…
This paper introduces a unified theoretical perspective that views deep generative models as probability transformation functions. Despite the apparent differences in architecture and training methodologies among various types of generative…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
Conformally symplectic systems include mechanical systems with a friction proportional to the velocity. Geometrically, these systems transform a symplectic form into a multiple of itself making the systems dissipative or expanding. In the…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
In the last fifteen the subset sampling method has often been used in reliability problems as a tool for calculating small probabilities. This method is extrapolating from an initial Monte Carlo estimate for the probability content of a…
For a broad class of the Levy processes the new form (convolution type) of the infinitesimal generators is introduced. It leads to the new notions: a truncated generator, a quasi-potential. The probability of the Levy process remaining…
Let $K/k$ be a finite extension of a global field. Such an extension can be generated over $k$ by a single element. The aim of this article is to prove the existence of a "small" generator in the function field case. This answers the…
We define standardized constructions of finite fields, and standardized generators of (multiplicative) cyclic subgroups in these fields. The motivation is to provide a substitute for Conway polynomials which can be used by various software…
We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…