English
Related papers

Related papers: Simplices and spectra of graphs

200 papers

Let $G=(V,E)$ be a graph and $n$ a positive integer. Let $I_n(G)$ be the abstract simplicial complex whose simplices are the subsets of $V$ that do not contain an independent set of size $n$ in $G$. We study the collapsibility numbers of…

Combinatorics · Mathematics 2024-10-15 Minki Kim , Alan Lew

Bicliques are complements of bipartite graphs; as such each consists of two cliques joined by a number of edges. In this paper we study algebraic aspects of the chromatic polynomials of these graphs. We derive a formula for the chromatic…

Combinatorics · Mathematics 2012-03-26 Adam Bohn

We study the number of facets of the convex hull of n independent standard Gaussian points in d-dimensional Euclidean space. In particular, we are interested in the expected number of facets when the dimension is allowed to grow with the…

Probability · Mathematics 2024-01-11 Karoly J Boroczky , Gabor Lugosi , Matthias Reitzner

In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…

Combinatorics · Mathematics 2017-11-29 Guidong Yu , Yi Fang , Yizheng Fan , Gaixiang Cai

Analogous to the sl(n) case, we address the computation of the index of seaweed subalgebras of sp(2n) by introducing graphical representations called symplectic meanders. Formulas for the algebra's index may be computed by counting the…

Rings and Algebras · Mathematics 2016-02-04 Vincent E. Coll, , Matthew Hyatt , Colton Magnant

In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.

Combinatorics · Mathematics 2013-07-02 Shamik Ghosh , Raibatak Sen Gupta , M. K. Sen

We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…

Functional Analysis · Mathematics 2014-10-07 Christine Bachoc , Evan DeCorte , Fernando Mario de Oliveira Filho , Frank Vallentin

Conjecturally, almost all graphs are determined by their spectra. This problem has also been studied for variants such as the spectra of the Laplacian and signless Laplacian. Here we consider the problem of determining graphs with Ihara and…

Combinatorics · Mathematics 2015-09-02 Christina Durfee , Kimball Martin

Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices…

Combinatorics · Mathematics 2019-06-19 Mark Kempton , John Sinkovic , Dallas Smith , Benjamin Webb

The richly developed theory of complex manifolds plays important roles in our understanding of holomorphic functions in several complex variables. It is natural to consider manifolds that will play similar roles in the theory of holomorphic…

Complex Variables · Mathematics 2024-04-15 Jim Agler , John E. McCarthy , N. J. Young

We prove that if an $n$-dimensional space $X$ satisfies certain topological conditions then any triangulation of $X$ as well as any its representation as a simplicial set with contractible faces has at least $2^n$ faces of dimension $n$.…

Algebraic Topology · Mathematics 2024-08-07 Sergey Avvakumov , Roman Karasev

Brenti and Welker have shown that for any simplicial complex X, the face vectors of successive barycentric subdivisions of X have roots which converge to fixed values depending only on the dimension of X. We improve and generalize this…

Combinatorics · Mathematics 2011-10-13 Emanuele Delucchi , Aaron Pixton , Lucas Sabalka

Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…

Optimization and Control · Mathematics 2022-03-04 Quoc Van Tran , Hyo-Sung Ahn

Let $G$ be a strictly pseudoconvex domain in $\mathbb{C}^2$ with $C^\infty$-smooth boundary $\partial G$. Let $S$ be a 2-dimensional sphere embedded into $\partial G$. Denote by $\mathcal{E}$ the set of all complex points on $S$. We study…

Complex Variables · Mathematics 2013-02-20 Nikolay Shcherbina

The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…

Combinatorics · Mathematics 2025-03-24 Yan-Ting Xie , Shou-Jun Xu

For a given spectral curve, we construct a family of symplectic dual spectral curves for which we prove an explicit formula expressing the $n$-point functions produced by the topological recursion on these curves via the $n$-point functions…

Mathematical Physics · Physics 2025-01-22 Alexander Alexandrov , Boris Bychkov , Petr Dunin-Barkowski , Maxim Kazarian , Sergey Shadrin

We study spectra of noncommutative dynamical systems, representations of fractal groups, and regular graphs. We explicitly compute these spectra for five examples of groups acting on rooted trees, and in three cases obtain totally…

Group Theory · Mathematics 2009-11-28 Laurent Bartholdi , Rostislav I. Grigorchuk

In this note, we initiate a study of the finite-dimensional representation theory of a class of algebras that correspond to noncommutative deformations of compact surfaces of arbitrary genus. Low dimensional representations are investigated…

Representation Theory · Mathematics 2020-05-20 Joakim Arnlind

The notion of a holomorphically symplectic manifold can be generalized to the singular one. This paper studies the birational contraction maps between symplectic varieties, and then describes the deformation of a symplectic variety which…

Algebraic Geometry · Mathematics 2007-05-23 Yoshinori Namikawa

We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…

Combinatorics · Mathematics 2018-10-12 Elie de Panafieu