Related papers: Pseudo-orientable ribbon graphs: Matrix--Quasi-tre…

We prove the equivalence between a relative bottleneck property and being quasi-isometric to a tree-graded space. As a consequence, we deduce that the quasi-trees of spaces defined axiomatically by Bestvina-Bromberg-Fujiwara are…

We generalize Baker-Bowler's theory of matroids over tracts to orthogonal matroids, define orthogonal matroids with coefficients in tracts in terms of Wick functions, orthogonal signatures, circuit sets, and orthogonal vector sets, and…

Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…

This dissertation explores applications of discrete geometry in mathematical neuroscience. We begin with convex neural codes, which model the activity of hippocampal place cells and other neurons with convex receptive fields. In Chapter 4,…

We study two notions of being well-structured for classes of graphs that are inspired by classic model theory. A class of graphs $C$ is monadically stable if it is impossible to define arbitrarily long linear orders in vertex-colored graphs…

The graph parameter shrub-depth is a dense analog of tree-depth. We characterize classes of bounded shrub-depth by forbidden induced subgraphs. The obstructions are well-controlled flips of large half-graphs and of disjoint unions of many…

By finding orthogonal representation for a family of simple connected called $\delta$-graphs it is possible to show that $\delta$-graphs satisfy delta conjecture. An extension of the argument to graphs of the form…

We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave…

We study mappings on sub-Riemannian manifolds which are quasi-regular with respect to the Carnot-Caratheodory distances and discuss several related notions. On H-type Carnot groups, quasiregular mappings have been introduced earlier using…

Gao and Xie (2021) conjectured that the inverse Kazhdan-Lusztig polynomial of any matroid is log-concave. Although the inverse Kazhdan-Lusztig polynomial may not always have only real roots, we conjecture that the Hadamard product of an…

We introduce certain torus-equivariant classes on permutohedral varieties which we call "tautological classes of matroids" as a new geometric framework for studying matroids. Using this framework, we unify and extend many recent…

Threshold graphs are a prevalent and widely studied class of simple graphs. They have several equivalent definitions which makes them a go-to class for finding examples and counter examples when testing and learning. This versatility has…

We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

The active bijection forms a package of results studied by the authors in a series of papers in oriented matroids. The present paper is intended to state the main results in the particular case, and more widespread language, of graphs. We…

(lecture delivered at the Congress of the Romanian mathematicians, Brasov, June 2011) Using graph representations a new class of computable topological invariants associated with a tame real or angle valued map were recently introduced,…

Recently, Daligault, Rao and Thomass\'e asked in [3] if every hereditary class which is well-quasi-ordered by the induced subgraph relation is of bounded clique-width. There are two reasons why this questions is interesting. First, it…

We give new examples of graphs and trees with dominating set sequences that are not log-concave. These examples were generated by PatternBoost, a transformer-based reinforcement learning software developed by…

We consider mappings between Carnot groups. In this paper, which is a continuation of "Pansu pullback and rigidity of mappings between Carnot groups" (arXiv:2004.09271), we focus on Carnot groups which are nonrigid in the sense of…

A statistical manifold is a pseudo-Riemannian manifold endowed with a Codazzi structure. This structure plays an important role in Information Geometry and its related fields, e.g., a statistical model admits this structure with the…