Given a gauged linear sigma model (GLSM) $\mathcal{T}_{X}$ realizing a projective variety $X$ in one of its phases, i.e. its quantum K\"ahler moduli has a geometric point, we propose an \emph{extended} GLSM $\mathcal{T}_{\mathcal{X}}$ realizing the homological projective dual category $\mathcal{C}$ to $D^{b}Coh(X)$ as the category of B-branes of the Higgs branch of one of its phases. In most of the cases, the models $\mathcal{T}_{X}$ and $\mathcal{T}_{\mathcal{X}}$ are anomalous and the analysis of their Coulomb and mixed Coulomb-Higgs branches gives information on the semiorthogonal/Lefschetz decompositions of $\mathcal{C}$ and $D^{b}Coh(X)$. We also study the models $\mathcal{T}_{X_{L}}$ and $\mathcal{T}_{\mathcal{X}_{L}}$ that correspond to homological projective duality of linear sections $X_{L}$ of $X$. This explains why, in many cases, two phases of a GLSM are related by homological projective duality. We study mostly abelian examples: linear and Veronese embeddings of $\mathbb{P}^{n}$ and Fano complete intersections in $\mathbb{P}^{n}$. In such cases, we are able to reproduce known results as well as produce some new conjectures. In addition, we comment on the construction of the HPD to a nonabelian GLSM for the Pl\"ucker embedding of the Grassmannian $G(k,N)$.

Polyhedral combinatorics has been a topic of interest in modern day’s computational geometry. The founding of Steinitz’s Theorem in 1922 revealed consequential relations between graph theory and polyhedral combinatorics. It allows us to better investigate on the topology of convex polyhedrons. In this paper, we proposed an algorithm that generates a unique sequence of points, using the vertices of a triangulated polyhedron, pre-determined by the selection of the starting 3 vertices in the sequence. Following that, we discover an interesting relation between the sequence and the volume of the polyhedron itself, in which we presented in the form of a sufficient condition. To further investigate which polyhedrons generate sequences that satisfy the sufficient condition, we study the problem in the context of graph theory, that is, the explorer walk (corresponding to the sequence of vertices) in maximal planar graphs (skeletons of triangulated convex polyhedrons). With that, we uncovered a family of maximal planar graphs, called the explorer graphs, which exhibits volumetric properties in the polyhedrons constructed from them, in regard to the explorer walk. In this paper, we also introduce generalized methods of constructing explorer graphs of higher order from explorer graphs of lower order, demonstrating the prevalence of explorer graphs. As the edges of a maximal planar graph is of great importance in tracing an explorer walk, we investigate on the line graph of maximal planar graphs, and re-establish a better definition of explorer graphs. Lastly, our paper covers the edge contraction of explorer graphs, which allows us to solve the volume of polyhedrons constructed from non-explorer graphs. For this, we presented a possible bound for the minimum number of edge contractions a non-explorer graph requires from an explorer graph. This will generalize the proposed method of finding volumes to any triangulated convex polyhedron.

In this paper we prove the universality of covariance matrices of the form $H_{Ntimes N}={X}^{dagger}X$ where $X$ is an ${Mtimes N}$ rectangular matrix with independent real valued entries $x_{ij}$ satisfying $mathbb{E}x_{ij}=0$ and $mathbb{E}x^2_{ij}={frac{1}{M}}$, $N$, $Mto infty$. Furthermore it is assumed that these entries have sub-exponential tails or sufficiently high number of moments. We will study the asymptotics in the regime $N/M=d_Nin(0,infty),lim_{Ntoinfty}d_Nneq0,infty$. Our main result is the edge universality of the sample covariance matrix at both edges of the spectrum. In the case $lim_{Ntoinfty}d_N=1$, we only focus on the largest eigenvalue. Our proof is based on a novel version of the Green function comparison theorem for data matrices with dependent entries. En route to proving edge universality, we establish that the Stieltjes transform of the empirical eigenvalue distribution of $H$ is given by the Marcenko-Pastur law uniformly up to the edges of the spectrum with an error of order $(Neta)^{-1}$ where $eta$ is the imaginary part of the spectral parameter in the Stieltjes transform. Combining these results with existing techniques we also show bulk universality of covariance matrices. All our results hold for both real and complex valued entries.

No abstract uploaded!

No abstract uploaded!