Related papers: Distances between factorizations in the Chicken Mc…

The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but…

We study the problem of invariance of indices of thematic factorizations. Such factorizations were introduced in [PY1] for studying superoptimal approximation by bounded analytic matrix functions. As shown in [PY1], the indices may depend…

For a numerical monoid $\langle n_1, \dots, n_k \rangle$ minimally generated by $n_1, \dots, n_k \in \mathbb{N}$ with $n_1 < \cdots < n_k$, the longest and shortest factorization lengths of an element $x$, denoted as $L(x)$ and $\ell(x)$,…

Chains of minimal degree rational curves have been used as an important tool in the study of Fano manifolds. Their own geometric properties, however, have not been studied much. The goal of the paper is to introduce an infinitesimal method…

This is a report on aspects of the theory and use of monoidal categories. The first section introduces the main concepts through the example of the category of vector spaces. String notation is explained and shown to lead naturally to a…

We show how a commutative monad gives rise to a theory of extensive quantities, including (under suitable further conditions) a differential calculus of such. The relationship to Schwartz distributions is dicussed. The paper is a companion…

We present a simple way of separating the overlap between the soft and collinear factorization formulae of QCD squared matrix elements. We check its validity explicitly for single and double unresolved emissions of tree-level processes. The…

We establish strong factorization for pairs of smooth fans which are refined by the braid arrangement fan. Our method uses a correspondence between cones and preposets.

Define the $n$-th fibotomic polynomial to be the product of the monic irredicible factors of the $n$-th Fibonacci polynomial which are not factors of any Fibonacci polynomial of smaller degree. In this paper, we prove a number of properties…

Quantifying the distance between datasets is a fundamental question in mathematics and machine learning. We propose \textit{magnitude distance}, a novel distance metric defined on finite datasets using the notion of the \emph{magnitude} of…

In this talk we highlight recent lattice calculations of the nucleon form factors and structure functions.

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restricted to the special case of partitions with 2 columns. We…

We investigate conditions under which the identity matrix $I_n$ can be continuously factorized through a continuous $N\times N$ matrix function $A$ with domain in $\mathbb{R}$. We study the relationship of the dimension $N$, the diagonal…

We find all factorized duality functions for a class of interacting particle systems. The functions we recover are self-duality functions for interacting particle systems such as zero-range processes, symmetric inclusion and exclusion…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Many apparently contradictory approaches to TMD factorization and its non-perturbative content exist. This talk evaluated the different methods and proposed tools for resolving the contradictions and experimentally adjudicating the results.

As highlighted in a series of recent papers by Tringali and the author, fundamental aspects of the classical theory of factorization can be significantly generalized by blending the languages of monoids and preorders. Specifically, the…

Let F=(F_1,...,F_n):C^n --> C^n be a polynomial mapping. By the multidegree of the mapping F we mean mdeg F=(deg F_1,...,deg F_n), an element of N^n. The aim of this paper is to study the following problem (especially for n=3): for which…

We describe a compression-based distance for genomic sequences. Instead of using the usual conjoint information content, as in the classical Normalized Compression Distance (NCD), it uses the conditional information content. To compute this…

I review recent results and prospects for improvement in calculations of hadronic matrix elements relevant to quark flavour phenomenology. I will focus on key quantities for CKM unitarity triangle analyses and for the study of discrepancies…