Related papers: Multiple addition, deletion and restriction theore…
In this paper, we study the class of free multiarrangements of hyperplanes. Specifically, we investigate the relations between freeness over a field of finite characteristic and freeness over the rationals.
The increasing use of multivariate methods, and in particular the Matrix Element Method (MEM), represents a revolution in experimental particle physics. With continued exponential growth in computing capabilities, the use of sophisticated…
Random matrix theory (RMT) is based on two assumptions: (1) matrix-element independence, and (2) base invariance. Most of the proposed generalizations keep the first assumption and violate the second. Recently, several authors presented…
In connection with the needs of solving optimization problems, the development of conditional minimization methods with convenient numerical implementation continues to attract the attention of mathematicians. In this monograph we propose…
It is known that the alternation hierarchy of least and greatest fixpoint operators in the mu-calculus is strict. However, the strictness of the alternation hierarchy does not necessarily carry over when considering restricted classes of…
Partons are effective degrees of freedom describing the structure of hadrons involved in high-energy collisions. Familiar theories of partons are QCD light-front quantization and soft-collinear effective theory, both of which are…
We study the maximum likelihood (ML) degree of discrete exponential independence models and models defined by the second hypersimplex. For models with two independent variables, we show that the ML degree is an invariant of a matroid…
Classical Edgeworth expansions provide asymptotic correction terms to the Central Limit Theorem (CLT) up to an order that depends on the number of moments available. In this paper, we provide subsequent correction terms beyond those given…
We construct an addition and a multiplication on the set of planar binary trees, closely related to addition and multiplication on the integers. This gives rise to a new kind of (noncommutative) arithmetic theory. The price to pay for this…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
The paper contains a new non-perturbative representation for subleading contribution to the free energy of multicut solution for hermitian matrix model. This representation is a generalisation of the formula, proposed by Klemm, Marino and…
This work aims at providing new bounds for the diversity multiplexing gain trade-off of a general class of division algebra based lattice codes. In the low multiplexing gain regime, some bounds were previously obtained from the high…
Finite Unified Theories (FUTs) are N=1 supersymmetric Grand Unified Theories that can be made all-loop finite, leading to a severe reduction of the free parameters. We review the investigation of FUTs based on SU(5) in the context of…
In this series of three articles, we give an exposition of various results and open problems in three areas of algebraic and geometric combinatorics: totally non-negative matrices, representations of the symmetric group, and hyperplane…
Multiple imputation (MI) inference handles missing data by imputing the missing values $m$ times, and then combining the results from the $m$ complete-data analyses. However, the existing method for combining likelihood ratio tests (LRTs)…
Max-Plus Linear (MPL) systems are an algebraic formalism with practical applications in transportation networks, manufacturing and biological systems. In this paper, we investigate the problem of automatically analyzing the properties of…
Multi-term floating-point addition appears in vector dot-product computations, matrix multiplications, and other forms of floating-point data aggregation. A critical step in multi-term floating point addition is the alignment of fractions…
In 2002, Terao showed that every reflection multi-arrangement of a real reflection group with constant multiplicity is free by providing a basis of the module of derivations. We first generalize Terao's result to multi-arrangements stemming…
Optimization Modulo Theories (OMT) has emerged as an important extension of the highly successful Satisfiability Modulo Theories (SMT) paradigm. The OMT problem requires solving an SMT problem with the restriction that the solution must be…
In this article, we introduce the parametric matroid $\ell$-interdiction problem, where $\ell\in\mathbb{N}_{>0}$ is a fixed number of elements allowed to be interdicted. Each element of the matroid's ground set is assigned a weight that…