Related papers: Strong factorization and the braid arrangement fan
We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff's Matrix-Tree Theorem with…
Heavy-to-light transition form factors at large recoil energy of the light meson have been conjectured to obey a factorization formula, where the set of form factors is reduced to a smaller number of universal form factors up to…
We propose the study of the inclusive hadroproduction of a heavy-flavored jet in association with a light jet, as a probe channel of strong interactions at high energies. We build up a hybrid factorization that encodes genuine high-energy…
Hybrid Bayesian networks (HBN) contain complex conditional probabilistic distributions (CPD) specified as partitioned expressions over discrete and continuous variables. The size of these CPDs grows exponentially with the number of parent…
We investigate the local contribution of the braid monodromy factorization in the context of the links obtained by the closure of these braids. We consider plane curves which are arrangements of lines and conics as well as some algebraic…
For a complex connected semisimple linear algebraic group $G$ of adjoint type and of rank $n$, De Concini and Procesi constructed its wonderful compactification $\bar{G}$, which is a smooth Fano $G \times G$-variety of Picard number $n$…
We work with symmetric inner models of forcing extensions based on strongly compact Prikry forcing to extend some known results.
In light of recent data science trends, new interest has fallen in alternative matrix factorizations. By this, we mean various ways of factorizing particular data matrices so that the factors have special properties and reveal insights into…
The increasing size of transformer-based models in NLP makes the question of compressing them important. In this work, we present a comprehensive analysis of factorization based model compression techniques. Specifically, we focus on…
From a detailed analysis of cone-jet cross sections in effective field theory, we obtain novel factorization theorems which separate the physics associated with different energy scales present in such processes. The relevant low-energy…
We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating…
The production of hard photons in hadronic collisions is studied using Soft-Collinear Effective Theory (SCET). This is the first application of SCET to a physical, observable cross section involving energetic partons in more than two…
Factorization-based models have gained popularity since the Netflix challenge {(2007)}. Since that, various factorization-based models have been developed and these models have been proven to be efficient in predicting users' ratings…
We show that factorization systems, both strict and orthogonal, can be equivalently described as double categories satisfying certain properties. This provides conceptual reasons for why the category of sets and partial maps or the category…
Mott noted a one-to-one correspondence between saturated multiplicatively closed subsets of a domain D and directed convex subgroups of the group of divisibility D. With this, we construct a functor between inclusions into saturated…
We analyze two consequences of the relationship between collinear factorization and $k_t$-factorization. First, we show that the $k_t$-factorization gives a fundamental justification for the choice of the hard scale $Q^2$ done in the…
It has become routine to collect data that are structured as multiway arrays (tensors). There is an enormous literature on low rank and sparse matrix factorizations, but limited consideration of extensions to the tensor case in statistics.…
For ferrofluids that are described by a system of hard spheres interacting via dipolar forces we evaluate the magnetization as a function of the internal magnetic field with a Born--Mayer technique and an expansion in the dipolar coupling…
A method of fast linear transform algorithm synthesis for an arbitrary tensor, matrix, or vector is proposed. The method is based on factorization of a tensor and using the factors for building computational structures performing fast…
The Fast Reciprocal Square Root Algorithm is a well-established approximation technique consisting of two stages: first, a coarse approximation is obtained by manipulating the bit pattern of the floating point argument using integer…