English
Related papers

Related papers: Multi-linear forms, graphs, and $L^p$-improving me…

200 papers

The observation of extensive fractional quantum Hall states in graphene brings out the possibility of more accurate quantitative comparisons between theory and experiment than previously possible, because of the negligibility of finite…

Strongly Correlated Electrons · Physics 2016-05-25 Ajit C. Balram , Csaba Tőke , A. Wójs , J. K. Jain

We suggest a new method of describing invariant measures on Markov compacta and path spaces of graphs, and thus of describing characters of some groups and traces of AF-algebras. The method relies on properties of filtrations associated…

Representation Theory · Mathematics 2014-08-15 Anatoly Vershik

This is an exposition of results on the existence problem of $\pi_1$-injective immersed and embedded surfaces in graph-manifolds, and also of nonpositively curved metrics on graph-manifolds, obtained by different authors. The results are…

Geometric Topology · Mathematics 2007-05-23 S. Buyalo , P. Svetlov

The Colin de Verdiere number of graph G, denoted by \mu(G), is a spectral invariant of G that is related to some of its topological properties. For example, \mu(G) \leq 3 iff G is planar. A penny graph is the contact graph of equal-radii…

Metric Geometry · Mathematics 2020-06-11 A. Y. Alfakih

Let $V$ be a finite-dimensional vector space over $\mathbb{F}_p$. We say that a multilinear form $\alpha \colon V^k \to \mathbb{F}_p$ in $k$ variables is $d$-approximately symmetric if the partition rank of difference $\alpha(x_1, \dots,…

Combinatorics · Mathematics 2021-12-30 Luka Milićević

Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…

Combinatorics · Mathematics 2024-04-16 Aryan Esmailpour , Sara Saeedi Madani , Dariush Kiani

Group Field Theories (GFT) are quantum field theories over group manifolds; they can be seen as a generalization of matrix models. GFT Feynman graphs are tensor graphs generalizing ribbon graphs (or combinatorial maps); these graphs are…

Combinatorics · Mathematics 2015-05-30 Adrian Tanasa

Let $G$ be a graph with vertex set $V(G)$ and let $H:V(G)\rightarrow 2^N$ be a set function associating with $G$. An $H$-factor of graph $G$ is a spanning subgraphs $F$ such that $$d_F(v)\in H(v){4em}\hbox{for every}v\in V(G).$$ Let…

Combinatorics · Mathematics 2013-01-29 Hongliang Lu

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Group Theory · Mathematics 2021-03-29 Peter J. Cameron

We study the quantum many-body ground states of electrons on the half-filled honeycomb lattice with short- and long-ranged density-density interactions as a model for graphene. To this end, we employ the recently developed truncated-unity…

Strongly Correlated Electrons · Physics 2017-12-06 David Sánchez de la Peña , Julian Lichtenstein , Carsten Honerkamp , Michael M. Scherer

Implementing linear transformations is a key task in the decentralized signal processing framework, which performs learning tasks on data sets distributed over multi-node networks. That kind of network can be represented by a graph.…

Signal Processing · Electrical Eng. & Systems 2020-11-24 Siavash Mollaebrahim , Baltasar Beferull-Lozano

Let $(X, \mathscr{L}, \lambda)$ and $(Y, \mathscr{M}, \mu)$ be finite measure spaces for which there exist $A \in \mathscr{L}$ and $B \in \mathscr{M}$ with either $0 < \lambda(A) < 1 < \lambda(X)$ and $0 < \mu(B) < \mu(Y)$, or the other way…

Functional Analysis · Mathematics 2023-05-08 Dorota Glazowska , Paolo Leonetti , Janusz Matkowski , Salvatore Tringali

Large Multimodal Models (LMMs) have shown generalized zero-shot capabilities in diverse domain question-answering (QA) tasks, including graph QA that involves complex graph topologies. However, most current approaches use only a single type…

Computation and Language · Computer Science 2025-08-11 Yanbin Wei , Jiangyue Yan , Chun Kang , Yang Chen , Hua Liu , James T. Kwok , Yu Zhang

We study a problem motivated by a question related to quantum-error-correcting codes. Combinatorially, it involves the following graph parameter: $$f(G)=\min\set{|A|+|\{x\in V\setminus A : d_A(x)\text{is odd}\}| : A\neq\emptyset},$$ where…

Combinatorics · Mathematics 2009-03-13 Tom Bohman , Andrzej Dudek , Alan Frieze , Oleg Pikhurko

The past few years have seen a revived interest in quantum geometrical characterizations of band structures due to the rapid development of topological insulators and semi-metals. Although the metric tensor has been connected to many…

Mesoscale and Nanoscale Physics · Physics 2023-03-07 Adrien Bouhon , Abigail Timmel , Robert-Jan Slager

Let G be a finite simple group. We show that the commutator map $a : G \times G \to G$ is almost equidistributed as the order of G goes to infinity. This somewhat surprising result has many applications. It shows that for a subset X of G we…

Group Theory · Mathematics 2010-03-16 Shelly Garion , Aner Shalev

Let ${\bf M}=(M_1,\ldots, M_k)$ be a tuple of real $d\times d$ matrices. Under certain irreducibility assumptions, we give checkable criteria for deciding whether ${\bf M}$ possesses the following property: there exist two constants…

Dynamical Systems · Mathematics 2017-02-24 De-Jun Feng , Chiu-Hong Lo , Shuang Shen

Study of the hadronic matrix elements can provide not only tests of the QCD sector of the Standard Model (in comparing with existing experiments) but also reliable low-energy hadronic quantities applicable to a wide range of…

High Energy Physics - Lattice · Physics 2013-01-01 Huey-Wen Lin

We propose a new point of view in the study of Fourier analysis on graphs, taking advantage of localization in the Fourier domain. For a signal $f$ on vertices of a weighted graph $\mathcal{G}$ with Laplacian matrix $\mathcal{L}$, standard…

Signal Processing · Electrical Eng. & Systems 2021-12-02 Basile de Loynes , Fabien Navarro , Baptiste Olivier

Given an undirected, edge-weighted graph G together with pairs of vertices, called pairs of terminals, the minimum multicut problem asks for a minimum-weight set of edges such that, after deleting these edges, the two terminals of each pair…

Data Structures and Algorithms · Computer Science 2016-11-24 Éric Colin de Verdière