Related papers: Bias and dessins
This work introduces a new concept, the so-called Darboux family, which is employed to determine, to analyse geometrically, and to classify up to Lie algebra automorphisms, in a relatively easy manner, coboundary Liebialgebras on real…
Gaussian graphical models are nowadays commonly applied to the comparison of groups sharing the same variables, by jointy learning their independence structures. We consider the case where there are exactly two dependent groups and the…
Signed graphs are complex systems that represent trust relationships or preferences in various domains. Learning node representations in such graphs is crucial for many mining tasks. Although real-world signed relationships can be…
We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of a semidistrim lattice correspond to the independent sets in…
Dessin d'Enfants on elliptic curves are a powerful way of encoding doubly-periodic brane tilings, and thus, of four-dimensional supersymmetric gauge theories whose vacuum moduli space is toric, providing an interesting interplay between…
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
We present a theory for splitting algebras of monic polynomials over rings, and apply the results to symmetric functions, and Galois theory. Our main result is that the ring of invariants of a splitting algebra under the symmetric group…
We show that Hall conductance and its non-abelian and higher-dimensional analogs are obstructions to promoting a symmetry of a state to a gauge symmetry. To do this, we define a local Lie algebra over a Grothendieck site as a pre-cosheaf of…
A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to B\'ina and…
Node representation learning has demonstrated its efficacy for various applications on graphs, which leads to increasing attention towards the area. However, fairness is a largely under-explored territory within the field, which may lead to…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
In this paper, we introduce tiled graphs as models of learning and maturing processes. We show how tiled graphs can combine graphs of learning spaces or antimatroids (partial hypercubes) and maturity models (total orders) to yield models of…
We explicitly identify the algebra generated by symplectic Fourier-Deligne transforms (i.e. convolution with Kazhdan-Laumon sheaves) acting on the Grothendieck group of perverse sheaves on the basic affine space $G/U$, answering a question…
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
A mixed lattice is a lattice-type structure consisting of a set with two partial orderings, and generalizing the notion of a lattice. Mixed lattice theory has previously been studied in various algebraic structures, such as groups and…
This paper introduces Polynomial Graphical Lasso (PGL), a new approach to learning graph structures from nodal signals. Our key contribution lies in modeling the signals as Gaussian and stationary on the graph, enabling the development of a…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…
We introduce families of two-parameter multivariate polynomials indexed by pairs of partitions $v,w$ -- biaxial double $(\beta,q)$-Grothendieck polynomials -- which specialize at $q=0$ and $v=1$ to double $\beta$-Grothendieck polynomials…
We develop several combinatorial notions about laminations, some with clear implications for parameter space. We introduce a simplified class of laminations called finite dynamical laminations (FDL). In order to count FDL, we introduce…