Related papers: D-log and formal flow for analytic isomorphisms of…
A classical result in descriptive complexity theory states that Datalog expresses exactly the class of polynomially computable queries on ordered databases. In this paper we extend this result to the case of higher-order Datalog. In…
The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…
We develop a canonical pairing between trees and graphs, which passes to their quotients by Jacobi identities. This pairing is an effective and simple tool for understanding the Lie and Poisson operads, providing canonical duals. In the…
Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…
A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…
We investigate the combinatorial properties of the functional equation $\phi[h(z)]=h(qz)$ for the conjugation of a formal diffeomorphism $\phi$ of $\mathbb{C}$ to its linear part $z\mapsto qz$. This is done by interpreting the functional…
We give an explanation of the $\mathrm{d}\log$-form of the coefficient matrix of canonical differential equations using the projection of ($n$+1)-$\mathrm{d}\log$ forms onto $n$-$\mathrm{d}\log$ forms. This projection is done using the…
In the cryptanalysis of stream ciphers and pseudorandom sequences, the notions of linear, jump, and 2-adic complexity arise naturally to measure the (non)randomness of a given string. We define an isometry K on F_q^\infty that is the…
We perform a systematic analysis of flow-like solutions in theories of Einstein gravity coupled to multiple scalar fields, which arise as holographic RG flows as well as in the context of cosmological solutions driven by scalars. We use the…
Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…
In this paper, we explore the interrelationship between Eulerian numbers and B splines. Specifically, using B splines, we give the explicit formulas of the refined Eulerian numbers, and descents polynomials. Moreover, we prove that the…
Generalizing results of Chou and Wang \cite{1} we study the flows of the leaves $(M_{\Theta})_{\Theta>0}$ of a foliation of $\mathbb{R}^{n+1}\setminus \{0\}$ consisting of uniformly convex hypersurfaces in the direction of their outer…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We prove a classification of additive polynomial superfunctors, which allows us to compute some extensions of a superfunctor of the form $F \circ A$ where $F$ is a classical polynomial functor and $A$ is additive. We get a formula which…
We study two generalizations of the gamma-expansion of Eulerian polynomials from the viewpoint of the decompositions of statistics. We first present an expansion formula of the trivariate Eulerian polynomials, which are the enumerators for…
We delve into the in-in formalism and derive general expressions for the computation of n-point functions for a self-interacting scalar field by means of a probability density functional (PDF). Even though in typical situations these…
We present a general formalism that allows for the computation of large-order renormalized expansions in the spacetime representation, effectively doubling the numerically attainable perturbation order of renormalized Feynman diagrams. We…
Additive tree functionals represent the cost of many divide-and-conquer algorithms. We derive the limiting distribution of the additive functionals induced by toll functions of the form (a) n^\alpha when \alpha > 0 and (b) log n (the…
The (measure-theoretical) entropy of a diffeomorphism along an expanding invariant foliation is the rate of complexity generated by the diffeomorphism along the leaves of the foliation. We prove that this number varies upper…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…