Related papers: Invariant spanning trees for quadratic rational ma…
We introduce new methods for phylogenetic tree quartet construction by using machine learning to optimize the power of phylogenetic invariants. Phylogenetic invariants are polynomials in the joint probabilities which vanish under a model of…
We study the dynamics of Thurston maps under iteration. These are branched covering maps $f$ of 2-spheres $S^2$ with a finite set $\mathop{post}(f)$ of postcritical points. We also assume that the maps are expanding in a suitable sense.…
We construct a topological invariant of algebraic plane curves, which is in some sense an adaptation of the linking number of knot theory. This invariant is shown to be a generalization of the I-invariant of line arrangements developed by…
We study isomorphism invariant point processes of $\mathbb{R}^d$ whose groups of symmetries are almost surely trivial. We define a 1-ended, locally finite tree factor on the points of the process, that is, a mapping of the point…
We study completely independent spanning trees (CIST), \textit{i.e.}, trees that are both edge-disjoint and internally vertex-disjoint, in split graphs. We establish a correspondence between the existence of CIST in a split graph and some…
We study the problem of connecting the parts of a multipartite graph using a minimum number of edges under a matching constraint. We introduce interconnection trees, defined as matchings whose projections onto the quotient graph form a…
Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…
Decision trees are powerful machine learning algorithms, widely used in fields such as economics and medicine for their simplicity and interpretability. However, decision trees such as CART are prone to overfitting, especially when grown…
The logarithm of the Kontsevich-Kuperberg-Thurston invariant counts embeddings of connected trivalent graphs in an oriented rational homology sphere, using integrals on configuration spaces of points in the given manifold. It is a universal…
Achieving invariance to nuisance transformations is a fundamental challenge in the construction of robust and reliable vision systems. Existing approaches to invariance scale exponentially with the dimension of the family of…
Column expansion identities of determinants give a source of quadratic spanning forest polynomial identities and allow us determine the dimension of the space of certain quadratic spanning forest identities, settling a conjecture of one of…
A vertex of degree one in a tree is called an end vertex and a vertex of degree at least three is called a branch vertex. For a graph $G$, let $\sigma_2$ be the minimum degree sum of two nonadjacent vertices in $G$. We consider tree…
In this article, we study the invariant differential forms which a correspondence of curves admits. We also try to classify the correspondences of $\mathbb{P}^1$ that admits such invariant differential forms.
We introduce a new type of fully computable problems, for DSS dedicated to maximal spanning tree problems, based on deduction and choice: preferential consistency problems. To show its interest, we describe a new compact representation of…
In this paper we introduce a new ingredient, invariant systems of differential equations, to our study of character sheaves on graded Lie algebras. The character sheaves we construct in this paper, together with the ones constructed in…
Thurston parameterized quadratic invariant laminations with a non-invariant lamination, the quotient of which yields a combinatorial model for the Mandelbrot set. As a step toward generalizing this construction to cubic polynomials, we…
An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…
A non-negative integer invariant, estimating from below the number of geometrically different critical points of a smooth function $f$ defined in the 2-disk, $f:\mathbb{B}^{2}\rightarrow\mathbb{R}$, is considered. (We denote it by…