Related papers: Grassmann-Berezin Calculus and Theorems of the Mat…
We generalize Mattei's result relative to the Brian\c{c}on-Skoda theorem for foliations to the family of foliations of the second type. We use this generalization to establish relationships between the Milnor and Tjurina numbers of…
Let $T$ be a tree on $n$ vertices with $q$-Laplacian $L_T^q$ and Laplacian matrix $L_T$. Let $GTS_n$ be the generalized tree shift poset on the set of unlabelled trees on $n$ vertices. Inequalities are known between coefficients of the…
A universal and rigorous ensemble framework for nonequilibrium system remains lacking. Here, we provide a concise framework for the generalized ensemble theory of nonequilibrium discrete systems using matrix-based approach. By introducing…
This paper brings a contribution to the Bayesian theory of nonparametric and semiparametric estimation. We are interested in the asymptotic normality of the posterior distribution in Gaussian linear regression models when the number of…
In this work we present an algebraic approach to the dynamics and perturbation theory at tree-level for gauge theories coupled to matter. The field theories we will consider are: Chern-Simons-Matter, Quantum Chromodynamics, and scalar…
This thesis studies matrix field theories, which are a special type of matrix models. First, the different types of applications are pointed out, from (noncommutative) quantum field theory over 2-dimensional quantum gravity up to algebraic…
We study the conjecture stated by Jensen and Len on a tropical version on Martens' theorem via the Brill--Noether rank of a tropical curve. We recall Coppens' counterexample of Martens-special chain of cycles, and we generalize the…
We construct a model in which all $C$-sequences are trivial, yet there exists a $\kappa$-Souslin tree with full vanishing levels. This answers a question of Lambie-Hanson and Rinot, and provides an optimal combination of compactness and…
Methods of phylogenetic inference use more and more complex models to generate trees from data. However, even simple models and their implications are not fully understood. Here, we investigate the two-state Markov model on a tripod tree,…
In this short note we present new results on a higher-dimensional generalization of De~Giorgi's conjecture for Allen--Cahn type equations, focusing on dimensions $n \ge 9$. Although counterexamples are known in this regime, our goal is to…
In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…
The EFT coefficients in any gapped, scalar, Lorentz invariant field theory must satisfy positivity requirements if there is to exist a local, analytic Wilsonian UV completion. We apply these bounds to the tree level scattering amplitudes…
The Grassmann convexity conjecture gives a conjectural formula for the maximal total number of real zeros of the consecutive Wronskians of an arbitrary fundamental solution to a disconjugate linear ordinary differential equation with real…
In two dimensions, Gallagher's theorem is a strengthening of the Littlewood conjecture that holds for almost all pairs of real numbers. We prove an inhomogeneous fibre version of Gallagher's theorem, sharpening and making unconditional a…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
We apply recent knowledge and techniques of the new generalized upper and lower Legendre conjugates to the theory of weight functions in the sense of Braun-Meise-Taylor and study in detail the effects on the corresponding associated weight…
Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…
Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
We prove that the principal minors of the distance matrix of a tree satisfy a combinatorial expression involving counts of rooted spanning forests of the underlying tree. This generalizes a result of Graham and Pollak, and refines a result…