Related papers: Bias and dessins
We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…
Artificial intelligence (AI) has undergone a renaissance recently, making major progress in key domains such as vision, language, control, and decision-making. This has been due, in part, to cheap data and cheap compute resources, which…
According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
Derivations extend the concept of differentiation from functions to algebraic structures as linear operators satisfying the Leibniz rule. In Lie algebras, derivations form a Lie algebra via the commutator bracket of linear endomorphisms.…
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph,…
We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…
Apart from a few remarks on lattice systems with global or gauge symmetries, most of this talk is devoted to some interesting ancient examples of symmetries and their breakdowns in elasticity theory and hydrodynamics. Since Galois Theory is…
The celebrated Robinson-Schensted algorithm and each of its variants that have attracted substantial attention can be constructed using Fomin's "growth diagram" construction from a modular lattice that is also a weighted-differential poset.…
This paper presents a neurosymbolic approach to classifying Galois groups of polynomials, integrating classical Galois theory with machine learning to address challenges in algebraic computation. By combining neural networks with symbolic…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
In many applications involving binary variables, only pairwise dependence measures, such as correlations, are available. However, for multi-way tables involving more than two variables, these quantities do not uniquely determine the joint…
We show that the absolute Galois group acts faithfully on the set of Hubbard trees. Hubbard trees are finite planar trees, equipped with self-maps, which classify postcritically finite polynomials as holomorphic dynamical systems on the…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called balanced, such that no theta subgraph contains exactly two balanced circles. A biased graph $\Omega$ has two natural matroids, the frame matroid…
In this paper, we give a geometrization and a generalization of a lemma of differential Galois theory. This geometrization, in addition of giving a nice insight on this result, offers us the occasion to investigate several points of…
The notion of Poisson dialgebras was introduced by Loday. In this article, we propose a new definition with some modifications that is supported by several canonical examples coming from Poisson algebra modules, averaging operators on…
Graph embedding methods transform high-dimensional and complex graph contents into low-dimensional representations. They are useful for a wide range of graph analysis tasks including link prediction, node classification, recommendation and…