Searcharxiv⌕ Search

arXiv subjects

Fatemeh Mohammadi

Publications and source records attributed to Fatemeh Mohammadi.

At least 73 records · Page 4Linked to original sources

Designing $\mathbb{Z}_2$ and $\mathbb{Z}_2 \times \mathbb{Z}_2$ topological orders in networks of Majorana bound states

Topological orders have been intrinsically identified in a class of systems such as fractional quantum Hall states and spin liquids. Accessing such states often requires extreme conditions such as low temperatures, high magnetic fields, pure samples, etc. Another approach would be to engineer the topological orders in systems with more accessible ingredients. In this work, we present networks of Majorana bound states, which are currently accessible in semiconductor nanowires proximitized to conventional superconductors, and show that the effective low-energy theory is topologically ordered. We first demonstrate the main principles in a lattice made of Kitaev superconducting chains comprising both spin species. The lattice is coupled to free magnetic moments through the Kondo interaction. We then show that at the weak coupling limit, effective ring spin interactions are induced between magnetic moments with a topological order enjoying a local $\mathbb{Z}_2 \times \mathbb{Z}_2$ gauge symmetry. We then show that the same topological order and also the $\mathbb{Z}_2$ one can be engineered in architecture patterns of semiconductor nanowires hosting Majorana bound states. The basic blocks of patterns are the time-reversal Majorana Cooper boxes coupled to each other by metallic leads, and the Majorana states are allowed to tunnel to quantum dots sitting on the vertices of the lattices. In the limit of strong onsite Coulomb interactions, where the charge fluctuations are suppressed, the magnetic moments of dots on the square and honeycomb lattices are described by topologically ordered spin models with underlying $\mathbb{Z}_2$ and $\mathbb{Z}_2 \times \mathbb{Z}_2$ gauge symmetries, respectively. Finally, we show that the latter topological order can also be realized in a network of purely Majorana zero modes in the absence of coupling to quantum dots.

cond-mat.supr-con↗

Toric and tropical Bertini theorems in positive characteristic

We generalize the toric Bertini theorem of Fuchs, Mantova, and Zannier to positive characteristic. A key part of the proof is a new algebraically closed field containing the field \kk(t_1,\dots,t_d) of rational functions over an algebraically closed field \kk of prime characteristic. As a corollary, we extend the tropical Bertini theorem of Maclagan and Yu to arbitrary characteristic, which removes the characteristic dependence from the d-connectivity result for tropical varieties from that paper.

math.AG↗

Triangulations and Canonical Forms of Amplituhedra: a fiber-based approach beyond polytopes

Any totally positive $(k+m)\times n$ matrix induces a map $π_+$ from the positive Grassmannian ${\rm Gr}_+(k,n)$ to the Grassmannian ${\rm Gr}(k,k+m)$, whose image is the amplituhedron $\mathcal{A}_{n,k,m}$ and is endowed with a top-degree form called the canonical form ${\bfΩ}(\mathcal{A}_{n,k,m})$. This construction was introduced by Arkani-Hamed and Trnka, where they showed that ${\bfΩ}(\mathcal{A}_{n,k,4})$ encodes scattering amplitudes in $\mathcal{N}=4$ super Yang-Mills theory. Moreover, the computation of ${\bfΩ}(\mathcal{A}_{n,k,m})$ is reduced to finding the triangulations of $\mathcal{A}_{n,k,m}$. However, while triangulations of polytopes are fully captured by their secondary polytopes, the study of triangulations of objects beyond polytopes is still underdeveloped. We initiate the geometric study of subdivisions of $\mathcal{A}_{n,k,m}$ and provide a concrete birational parametrization of fibers of $π: {\rm Gr}(k,n)\dashrightarrow {\rm Gr}(k,k+m)$. We then use this to explicitly describe a rational top-degree form $ω_{n,k,m}$ (with simple poles) on the fibers and compute ${\bfΩ}(\mathcal{A}_{n,k,m})$ as a summation of certain residues of $ω_{n,k,m}$. As main application of our approach, we develop a well-structured notion of secondary amplituhedra for conjugate to polytopes, i.e. when $n-k-1=m$ (even). We show that, in this case, each fiber of $π$ is parametrized by a projective space and its volume form $ω_{n,k,m}$ has only poles on a hyperplane arrangement. Using such linear structures, for amplituhedra which are cyclic polytopes or conjugate to polytopes, we show that the Jeffrey-Kirwan residue computes ${\bfΩ}(\mathcal{A}_{n,k,m})$ from $ω_{n,k,m}$. Finally, we propose a more general framework of fiber positive geometries and analyze new families of examples such as fiber polytopes and Grassmann polytopes.

math.CO↗

Families of Gröbner Degenerations, Grassmannians and Universal Cluster Algebras

Let $V$ be the weighted projective variety defined by a weighted homogeneous ideal $J$ and $C$ a maximal cone in the Gröbner fan of $J$ with $m$ rays. We construct a flat family over $\mathbb A^m$ that assembles the Gröbner degenerations of $V$ associated with all faces of $C$. This is a multi-parameter generalization of the classical one-parameter Gröbner degeneration associated to a weight. We explain how our family can be constructed from Kaveh-Manon's recent work on the classification of toric flat families over toric varieties: it is the pull-back of a toric family defined by a Rees algebra with base $X_C$ (the toric variety associated to $C$) along the universal torsor $\mathbb A^m \to X_C$. We apply this construction to the Grassmannians ${\rm Gr}(2,\mathbb C^n)$ with their Plücker embeddings and the Grassmannian ${\rm Gr}\big(3,\mathbb C^6\big)$ with its cluster embedding. In each case, there exists a unique maximal Gröbner cone whose associated initial ideal is the Stanley-Reisner ideal of the cluster complex. We show that the corresponding cluster algebra with universal coefficients arises as the algebra defining the flat family associated to this cone. Further, for ${\rm Gr}(2,\mathbb C^n)$ we show how Escobar-Harada's mutation of Newton-Okounkov bodies can be recovered as tropicalized cluster mutation.

math.AG↗

Conditional probabilities via line arrangements and point configurations

We study the connection between probability distributions satisfying certain conditional independence (CI) constraints, and point and line arrangements in incidence geometry. To a family of CI statements, we associate a polynomial ideal whose algebraic invariants are encoded in a hypergraph. The primary decompositions of these ideals give a characterisation of the distributions satisfying the original CI statements. Classically, these ideals are generated by 2-minors of a matrix of variables, however, in the presence of hidden variables, they contain higher degree minors. This leads to the study of the structure of determinantal hypergraph ideals whose decompositions can be understood in terms of point and line configurations in the projective space.

math.AC↗

Standard monomial theory and toric degenerations of Richardson varieties in the Grassmannian

Richardson varieties are obtained as intersections of Schubert and opposite Schubert varieties. We provide a new family of toric degenerations of Richardson varieties inside Grassmannians by studying Gröbner degenerations of their corresponding ideals. These degenerations are parametrised by block diagonal matching fields in the sense of Sturmfels-Zelevinsky. We associate a weight vector to each block diagonal matching field and study its corresponding initial ideal. In particular, we characterise when such ideals are toric, hence providing a family of toric degenerations for Richardson varieties. Given a Richardson variety $X_{w}^v$ and a weight vector ${\bf w}_\ell$ arising from a matching field, we consider two ideals: an ideal $G_{k,n,\ell}|_w^v$ obtained by restricting the initial of the Plücker ideal to a smaller polynomial ring, and a toric ideal defined as the kernel of a monomial map $ϕ_\ell|_w^v$. We first characterise the monomial-free ideals of form $G_{k,n,\ell}|_w^v$. Then we construct a family of tableaux in bijection with semi-standard Young tableaux which leads to a monomial basis for the corresponding quotient ring. Finally, we prove that when $G_{k,n,\ell}|_w^v$ is monomial-free and the initial ideal in$_{{\bf w}_\ell}(I(X_w^v))$ is quadratically generated, then all three ideals in$_{{\bf w}_\ell}(I(X_w^v))$, $G_{k,n,\ell}|_w^v$ and ker$(ϕ_\ell|_w^v)$ coincide, and provide a toric degeneration of $X_w^v$.

math.AC↗

Combinatorial Mutations and Block Diagonal Polytopes

Matching fields were introduced by Sturmfels and Zelevinsky to study certain Newton polytopes and more recently have been shown to give rise to toric degenerations of various families of varieties. Whenever a matching field gives rise to a toric degeneration, the associated polytope of the toric variety coincides with the matching field polytope. We study combinatorial mutations, which are analogues of cluster mutations for polytopes, of matching field polytopes and show that the property of giving rise to a toric degeneration of the Grassmannians, is preserved by mutation. Moreover the polytopes arising through mutations are Newton-Okounkov bodies for the Grassmannians with respect to certain full-rank valuations. We produce a large family of such polytopes, extending the family of so-called block diagonal matching fields.

math.CO↗

Toric degenerations of Grassmannians and Schubert varieties from matching field tableaux

We study the combinatorics of Gröbner degenerations of Grassmannians and the Schubert varieties inside them. We provide a family of binomial ideals whose combinatorics is governed by tableaux induced by matching fields in the sense of Sturmfels and Zelevinsky. We prove that these ideals are all quadratically generated and they yield a SAGBI basis of the Plücker algebra. This leads to a new family of toric degenerations of Grassmannians. Moreover, we apply our results to construct a family of Gröbner degenerations of Schubert varieties inside Grassmannians. We provide a complete characterization of toric ideals among these degenerations in terms of the combinatorics of matching fields, permutations, and semi-standard tableaux.

math.AC↗

Toric degenerations of flag varieties from matching field tableaux

We present families of tableaux which interpolate between the classical semi-standard Young tableaux and matching field tableaux. Algebraically, this corresponds to SAGBI bases of Plücker algebras. We show that each such family of tableaux leads to a toric ideal, that can be realized as initial of the Plücker ideal, hence a toric degeneration for the flag variety.

math.AC↗

Standard monomial theory and toric degenerations of Richardson varieties inside Grassmannians and flag varieties

We study toric degenerations of opposite Schubert and Richardson varieties inside degenerations of Grassmannians and flag varieties. These degenerations are parametrized by matching fields in the sense of Sturmfels and Zelevinsky. We construct so-called restricted matching field ideals whose generating sets are understood combinatorially through tableaux. We determine when these ideals are toric and coincide with Gröbner degenerations of Richardson varieties using the well established standard monomial theory for Grassmannians and flag varieties.

math.AG↗

Standard monomial theory and toric degenerations of Schubert varieties from matching field tableaux

We study Gröbner degenerations of Schubert varieties inside flag varieties. We consider toric degenerations of flag varieties induced by matching fields and semi-standard Young tableaux. We describe an analogue of matching field ideals for Schubert varieties inside the flag variety and give a complete characterization of toric ideals among them. We use a combinatorial approach to standard monomial theory to show that block diagonal matching fields give rise to toric degenerations. Our methods and results use the combinatorics of permutations associated to Schubert varieties, matching fields and their corresponding tableaux.

math.AC↗

An Efficient Algorithm for Computing Network Reliability in Small Treewidth

We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge appears in the network with its associated probability and the problem is to determine the probability of having at least one source-to-target path. This problem is known to be NP-hard. We present a linear-time fixed-parameter algorithm based on a parameter called treewidth, which is a measure of tree-likeness of graphs. Network Reliability was already known to be solvable in polynomial time for bounded treewidth, but there were no concrete algorithms and the known methods used complicated structures and were not easy to implement. We provide a significantly simpler and more intuitive algorithm that is much easier to implement. We also report on an implementation of our algorithm and establish the applicability of our approach by providing experimental results on the graphs of subway and transit systems of several major cities, such as London and Tokyo. To the best of our knowledge, this is the first exact algorithm for Network Reliability that can scale to handle real-world instances of the problem.

math.CO↗

Measuring the non-Gorenstein locus of Hibi rings and normal affine semigroup rings

The trace of the canonical module of a Cohen-Macaulay ring describes its non-Gorenstein locus. We study the trace of the canonical module of a Segre product of algebras, and we apply our results to compute the non-Gorenstein locus of toric rings. We provide several sufficient and necessary conditions for Hibi rings and normal semigroup rings to be Gorenstein on the punctured spectrum.

math.AC↗

Polarization and depolarization of monomial ideals with application to multistate system reliability

We study the family of depolarizations of a squarefree monomial ideal $I$, i.e. all monomial ideals whose polarization is $I$. We describe a method to find all depolarizations of $I$ and study some of the properties they share and some they do not share. We then apply polarization and depolarization tools to study the reliability of multi-state coherent systems via binary systems and vice versa.

math.AC↗

Toric degenerations of Grassmannians from matching fields

We study the algebraic combinatorics of monomial degenerations of Plücker forms which is governed by matching fields in the sense of Sturmfels and Zelevinsky. We provide a necessary condition for a matching field to yield a Khovanskii basis of the Plücker algebra for $3$-planes in $n$-space. When the ideal associated to the matching field is quadratically generated this condition is both necessary and sufficient. Finally, we describe a family of matching fields, called $2$-block diagonal, whose ideals are quadratically generated. These matching fields produce a new family of toric degenerations of $\Gr(3, n)$.

math.AG↗

Computing toric degenerations of flag varieties

We compute toric degenerations arising from the tropicalization of the full flag varieties $\mathcal{F}\ell_4$ and $\mathcal{F}\ell_5$ embedded in a product of Grassmannians. For $\mathcal{F}\ell_4$ and $\mathcal{F}\ell_5$ we compare toric degenerations arising from string polytopes and the FFLV polytope with those obtained from the tropicalization of the flag varieties. We also present a general procedure to find toric degenerations in the cases where the initial ideal arising from a cone of the tropicalization of a variety is not prime.

math.AG↗

Efficient multicut enumeration of k-out-of-n:F and consecutive k-out-of-n:F systems

We study multiple simultaneous cut events for k-out-of-n:F and linear consecutive k-out-of-n:F systems in which each component has a constant failure probability. We list the multicuts of these systems and describe the structural differences between them. Our approach, based on combinatorial commutative algebra, allows complete enumeration of the sets of multicuts for both kinds of systems. We also analyze the computational issues of multicut enumeration and reliability computations.

math.PR↗

Generalized Permutohedra from Probabilistic Graphical Models

A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be constructed as a Minkowski sum of standard simplices. There is an analogous polytope for conditional independence relations coming from a regular Gaussian model, and it can be defined using multiinformation or relative entropy. For directed acyclic graphical models and also for mixed graphical models containing undirected, directed and bidirected edges, we give a construction of this polytope, up to equivalence of normal fans, as a Minkowski sum of matroid polytopes. Finally, we apply this geometric insight to construct a new ordering-based search algorithm for causal inference via directed acyclic graphical models.

math.ST↗