English
Related papers

Related papers: Weak Separation and Plabic Graphs

200 papers

Pickrell has fully characterized the unitarily invariant probability measures on infinite Hermitian matrices, and an alternative proof of this classification has been found by Olshanski and Vershik. Borodin and Olshanski deduced from this…

Probability · Mathematics 2020-04-27 Joseph Najnudel

The tower Weak Gravity Conjecture predicts infinitely many super-extremal states along every ray in the charge lattice of a consistent quantum gravity theory. We show this far-reaching claim in five-dimensional compactifications of M-theory…

High Energy Physics - Theory · Physics 2023-08-15 Cesar Fierro Cota , Alessandro Mininno , Timo Weigand , Max Wiesner

Haagerup's proof of the non commutative little Grothendieck inequality raises some questions on the commutative little inequality, and it offers a new result on scalar matrices with non negative entries. The theory of completely bounded…

Functional Analysis · Mathematics 2024-04-05 Erik Christensen

We construct minor-closed addable families of graphs that are subcritical and contain all planar graphs. This contradicts (one direction of) a well-known conjecture of Noy.

Combinatorics · Mathematics 2018-01-08 Agelos Georgakopoulos , Stephan Wagner

We study arrangements of slightly skewed tropical hyperplanes, called blades by A. Ocneanu, on the vertices of a hypersimplex $\Delta_{k,n}$, and we investigate the resulting induced polytopal subdivisions. We show that placing a blade on a…

Combinatorics · Mathematics 2022-06-03 Nick Early

A partially embedded graph (or PEG) is a triple (G,H,\H), where G is a graph, H is a subgraph of G, and \H is a planar embedding of H. We say that a PEG (G,H,\H) is planar if the graph G has a planar embedding that extends the embedding \H.…

Discrete Mathematics · Computer Science 2012-04-16 Vít Jelínek , Jan Kratochvíl , Ignaz Rutter

Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…

Data Structures and Algorithms · Computer Science 2013-12-09 Shayan Oveis Gharan , Luca Trevisan

We give a detailed comparison between the notion of a weak Hopf algebra (also called a quantum groupoid by Nikshych and Vainerman), and that of a $\times_R$-bialgebra due to Takeuchi (and also called a bialgebroid or quantum (semi)groupoid…

Quantum Algebra · Mathematics 2007-05-23 Peter Schauenburg

Given a configuration $A$ of $n$ points in $\mathbb{R}^{d-1}$, we introduce the higher secondary polytopes $\Sigma_{A,1},\dots, \Sigma_{A,n-d}$, which have the property that $\Sigma_{A,1}$ agrees with the secondary polytope of…

Combinatorics · Mathematics 2019-09-13 Pavel Galashin , Alexander Postnikov , Lauren Williams

A gain graph is a graph whose edges are labelled invertibly by "gains" from a group. "Switching" is a transformation of gain graphs that generalizes conjugation in a group. A "weak chromatic function" of gain graphs with gains in a fixed…

Combinatorics · Mathematics 2010-01-26 Pascal Berthome , Raul Cordovil , David Forge , Veronique Ventos , Thomas Zaslavsky

A $k$-weak bisection of a cubic graph $G$ is a partition of the vertex-set of $G$ into two parts $V_1$ and $V_2$ of equal size, such that each connected component of the subgraph of $G$ induced by $V_i$ ($i=1,2$) is a tree of at most $k-2$…

Combinatorics · Mathematics 2017-09-15 Louis Esperet , Giuseppe Mazzuoccolo , Michael Tarsi

A combinatorial principle CECA is formulated and its equivalence with GCH+ certain weakenings of Box_lambda for singular lambda is proved. CECA is used to show that certain ``almost point- < tau'' families can be refined to point- < tau…

In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…

Rings and Algebras · Mathematics 2023-07-10 Ivan Gonzales Gargate , Thiago Castilho de Mello

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

Combinatorics · Mathematics 2007-05-23 Harry Buhrman , Ming Li , John Tromp , Paul Vitanyi

Let $P$ be a Markov kernel on a measurable space $\X$ and let $V:\X\r[1,+\infty)$. This paper provides explicit connections between the $V$-geometric ergodicity of $P$ and that of finite-rank nonnegative sub-Markov kernels $\Pc_k$…

Probability · Mathematics 2014-01-24 Loïc Hervé , James Ledoux

The classification of one parameter local Coulomb branch solution of theories with eight supercharges is given by assuming that it is given by a genus $g$ fiberation of Riemann surfaces. The crucial point is the fact that certain conjugacy…

High Energy Physics - Theory · Physics 2023-04-27 Dan Xie

The present note is a strengthening of a recent paper by K. Takazawa and Y. Yokoi (A generalized-polymatroid approach to disjoint common independent sets in two matroids, Discrete Mathematics (2019)). For given two matroids on $E$, under…

Combinatorics · Mathematics 2019-10-01 Satoru Fujishige , Kenjiro Takazawa , Yu Yokoi

In the present note we focus on conic line arrangements in the plane with quasihomogeneous ordinary singularities from the perspective of weak Ziegler pairs. The foundations of this article come from an active area of research devoted to…

Algebraic Geometry · Mathematics 2024-03-26 Magdalena Lampa-Baczyńska , Daniel Wojcik

As an extension of positive and almost positive diagrams and links, we study two classes of links we call successively almost positive and weakly successively almost positive links. We prove various properties of polynomial invariants and…

Geometric Topology · Mathematics 2022-08-24 Tetsuya Ito , Alexander Stoimenow

Sampling from the $q$-state ferromagnetic Potts model is a fundamental question in statistical physics, probability theory, and theoretical computer science. On general graphs, this problem may be computationally hard, and this hardness…

Probability · Mathematics 2024-12-24 Antonio Blanca , Reza Gheissari
‹ Prev 1 8 9 10 Next ›