Related papers: D-log and formal flow for analytic isomorphisms of…
We show that a pair of complementary dagger-Frobenius algebras, equipped with a self-conjugate comonoid homomorphism onto one of the algebras, produce a nontrivial unitary morphism on the product of the algebras. This gives an abstract…
We consider a generalization of (pro)algebraic loops defined on general categories of algebras and the dual notion of a coloop bialgebra suitable to represent them as functors. Our main result is the proof that the natural loop of formal…
Present notes can be viewed as an attempt to extend the notion of Schubert/Grothendieck polynomial to the context of an arbitrary algebraic oriented cohomology theory and, hence, of a commutative one-dimensional formal group law.
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
The algebra B of bicomplex numbers is viewed as a complexification of the Archimedean f-algebra of hyperbolic numbers D. This lattice-theoretic approach allows us to establish new properties of the so-called D-norms. In particular, we show…
This paper provides the technical tools needed in ongoing work of the authors to compute p-adic \'etale Abel-Jacobi maps in order to obtain explicit reciprocity laws for GSp4. In particular, we define and study syntomic polynomial…
We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…
We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…
Logical formalisms such as first-order logic (FO) and fixpoint logic (FP) are well suited to express in a declarative manner fundamental graph functionalities required in distributed systems. We show that these logics constitute good…
Reduction trees are a way of encoding a substitution procedure dictated by the relations of an algebra. We use reduction trees in the subdivision algebra to construct canonical triangulations of flow polytopes which are shellable. We…
Motivated by applications in conditional sampling, given a probability measure $\mu$ and a diffeomorphism $\phi$, we consider the problem of simultaneously approximating $\phi$ and the pushforward $\phi_{\#}\mu$ by means of the flow of a…
The possibility for the Jacobi equation to admit in some cases general solutions that are polynomials has been recently highlighted by Calogero and Yi, who termed them para-Jacobi polynomials. Such polynomials are used here to build seed…
We prove an analog of Perron-Frobenius theorem for multilinear forms with nonnegative coefficients, and more generally, for polynomial maps with nonnegative coefficients. We determine the geometric convergence rate of the power algorithm to…
We present positivity conjectures for the Schur expansion of Jack symmetric functions in two bases given by binomial coefficients. Partial results suggest that there are rich combinatorics to be found in these bases, including Eulerian…
We survey some recent advances in the study of (area-preserving) flows on surfaces, in particular on the typical dynamical, ergodic and spectral properties of smooth area-preserving (or locally Hamiltonian) flows, as well as recent…
Similarity in formal argumentation has recently gained attention due to its significance in problems such as argument aggregation in semantics and enthymeme decoding. While existing approaches focus on propositional logic, we address the…
Normalizing flows are deep generative models that enable efficient likelihood estimation and sampling through invertible transformations. A key challenge is to design linear layers that enhance expressiveness while maintaining efficient…
We study the convergence of the derivative expansion for flow equations. The convergence strongly depends on the choice for the infrared regularisation. Based on the structure of the flow, we explain why optimised regulators lead to better…
We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs…
For certain dimensionally-regulated one-, two- and three-loop diagrams, problems of constructing the epsilon-expansion and the analytic continuation of the results are studied. In some examples, an arbitrary term of the epsilon-expansion…