Related papers: Bias and dessins
The theme of this article is a "reciprocity" between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity" manifests itself by the fact that the extension of the sequence of numbers of paths of…
A crucial step in the history of General Relativity was Einstein's adoption of the principle of general covariance which demands a coordinate independent formulation for our spacetime theories. General covariance helps us to disentangle a…
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…
A new construction of BPS monodromies for 4d ${\mathcal N}=2$ theories of class S is introduced. A novel feature of this construction is its manifest invariance under Kontsevich-Soibelman wall crossing, in the sense that no information on…
In this survey article, we recall some facts about split Kac-Moody groups as defined by J. Tits, describe their main properties and then propose an analogue of Borel-Tits theory for a non-split version of them. The main result is a Galois…
Explainable artificial intelligence has emerged as a promising field of research to address reliability concerns in artificial intelligence. Despite significant progress in explainable artificial intelligence, few methods provide a…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
This thesis studies two problems in modern statistics. First, we study selective inference, or inference for hypothesis that are chosen after looking at the data. The motiving application is inference for regression coefficients selected by…
We construct Galois theory for sublattices of certain complete modular lattices and their automorphism groups. A well-known description of the intermediate subgroups of the general linear group over a semilocal ring containing the group of…
We study the set of networks, which consist of sources, sinks and neutral points, bijective to the permutations. The set of directed edges, which characterizes a network, is constructed from a polyomino or a Rothe diagram of a permutation…
We provide a framework for modeling social network formation through conditional multinomial logit models from discrete choice and random utility theory, in which each new edge is viewed as a "choice" made by a node to connect to another…
Some sorts of generalized morphisms are defined from very basic mathematical objects such as sets, functions, and partial functions. A wide range of mathematical notions such as continuous functions between topological spaces, ring…
Cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in…
We study the balance of $G$-gain graphs, where $G$ is an arbitrary group, by investigating their adjacency matrices and their spectra. As a first step, we characterize switching equivalence and balance of gain graphs in terms of their…
There is a profound connection between copositive matrices and graph theory. Copositive matrices provide a powerful tool for formulating and solving various challenging graph-related problems. Conversely, graph theory provides a rich set of…
Graph Neural Networks (GNNs) have become essential tools for graph representation learning in various domains, such as social media and healthcare. However, they often suffer from fairness issues due to inherent biases in node attributes…
We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…
Gain graphs are graphs where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges. Generalizing the notion of gain graphs, skew…
A prime labeling on a graph of order $m$ is an assignment of $\{ 1, 2, \ldots, m \}$ to the vertices of the graph such that each pair of adjacent vertices has coprime labels. The ladder of order $2n$ is the $2 \times n$ grid graph graph…
A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…