Related papers: Grassmann Integral Representation for Spanning Hyp…

The basic mathematical framework for super Hilbert spaces over a Grassmann algebra with a Grassmann number-valued inner product is formulated. Super Hilbert spaces over infinitely generated Grassmann algebras arise in the functional…

We study the problem of maximizing the number of spanning trees in a connected graph by adding at most $k$ edges from a given candidate edge set. We give both algorithmic and hardness results for this problem: - We give a greedy algorithm…

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

There are several good reasons you might want to read about uniform spanning trees, one being that spanning trees are useful combinatorial objects. Not only are they fundamental in algebraic graph theory and combinatorial geometry, but they…

We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly perturbed dense graphs.…

The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…

One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…

In recent years there has been a paradigm shift from the study of local task-related activation to the organization and functioning of large-scale functional and structural brain networks. However, a long-standing challenge in this…

We give a new presentation of the Yangian for the orthosymplectic Lie superalgebra $\mathfrak{osp}_{1|2m}$. It relies on the Gauss decomposition of the generator matrix in the $R$-matrix presentation. The defining relations between the…

We investigate the support of a distribution $f$ on the real grassmannian $\mathrm{Gr}_k(\mathbb R^n)$ whose spectrum, namely its nontrivial $\mathrm O(n)$-components, is restricted to a subset $\Lambda$ of all $\mathrm O(n)$-types. We…

In the context of reconstructing phylogenetic networks from a collection of phylogenetic trees, several characterisations and subsequently algorithms have been established to reconstruct a phylogenetic network that collectively embeds all…

For any connected multigraph $G=(V,E)$ and any $M\subseteq E$, if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are complete graphs, a formula for $\tau_G(M)$ is obtained,…

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

We define a new large $N$ limit for general $\text{O}(N)^{R}$ or $\text{U}(N)^{R}$ invariant tensor models, based on an enhanced large $N$ scaling of the coupling constants. The resulting large $N$ expansion is organized in terms of a…

Amplitudes in open topological string theory may be described completely by certain A-infinity-categories. We detail a general construction of all cyclic minimal models for a given A-infinity-algebra and apply this result to the case of N=2…

Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…

Using the pure spinor formalism in part I [1] we compute the complete tree-level amplitude of N massless open strings and find a striking simple and compact form in terms of minimal building blocks: the full N-point amplitude is expressed…

We define a generalization $\mathfrak{G}$ of the Grassmann algebra $G$ which is well-behaved over arbitrary commutative rings $C$, even when $2$ is not invertible. In particular, this enables us to define a notion of superalgebras that does…

We introduce iterated sequences for Grassmannians, a new class of Fang-Fourier-Littelmanns' birational sequences and explain how they give rise to points in $\text{trop}(\text{Gr}(k,\mathbb C^n))$, Speyer-Sturmfels' tropical Grassmannian.…

For any graph $G$, let $t(G)$ be the number of spanning trees of $G$, $L(G)$ be the line graph of $G$ and for any non-negative integer $r$, $S_r(G)$ be the graph obtained from $G$ by replacing each edge $e$ by a path of length $r+1$…