An official website of the United States government
Abstract In this paper, we give Pieri rules for skew dual immaculate functions and their recently discovered row-strict counterparts. We establish our rules using a right-action analogue of the skew Littlewood–Richardson rule for Hopf algebras of Lam–Lauve–Sottile. We also obtain Pieri rules for row-strict (dual) immaculate functions.
more »
« less
An exact method for bosonizing the Fermi surface in arbitrary dimensions
Inspired by the recent work by Delacretaz et. al. [Phys. Rev. Res. 4, 033131 (2022)], we rigorously derive an exact and simple method to bosonize a non-interacting fermionic system with a Fermi surface starting from a microscopic Hamiltonian. In the long-wavelength limit, we show that the derived bosonized action is exactly equivalent to the action obtained by Delacretaz et. al. In addition, we propose diagrammatic rules to evaluate correlation functions using our bosonized theory and demonstrate these rules by calculating the three- and four-point density correlation functions. We also consider a general density-density interaction and show that the simplest approximation in our bosonic theory is identical to RPA results.
more »
« less
- Award ID(s):
- 2116515
- PAR ID:
- 10538921
- Publisher / Repository:
- SciPost
- Date Published:
- Journal Name:
- SciPost Physics
- Volume:
- 16
- Issue:
- 3
- ISSN:
- 2542-4653
- Page Range / eLocation ID:
- 069
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The revised, regularized Tao–Mo (rregTM) exchange-correlation density functional approximation (DFA) [A. Patra, S. Jana, and P. Samal, J. Chem. Phys. 153, 184112 (2020) and Jana et al., J. Chem. Phys. 155, 024103 (2021)] resolves the order-of-limits problem in the original TM formulation while preserving its valuable essential behaviors. Those include performance on standard thermochemistry and solid data sets that is competitive with that of the most widely explored meta-generalized-gradient-approximation DFAs (SCAN and r2SCAN) while also providing superior performance on elemental solid magnetization. Puzzlingly however, rregTM proved to be intractable for de-orbitalization via the approach of Mejía-Rodríguez and Trickey [Phys. Rev. A 96, 052512 (2017)]. We report investigation that leads to diagnosis of how the regularization in rregTM of the z indicator functions (z = the ratio of the von-Weizsäcker and Kohn–Sham kinetic energy densities) leads to non-physical behavior. We propose a simpler regularization that eliminates those oddities and that can be calibrated to reproduce the good error patterns of rregTM. We denote this version as simplified, regularized Tao–Mo, sregTM. We also show that it is unnecessary to use rregTM correlation with sregTM exchange: Perdew–Burke–Ernzerhof correlation is sufficient. The subsequent paper shows how sregTM enables some progress on de-orbitalization.more » « less
-
Endrullis, Jörg; Schmitz, Sylvain (Ed.)Graded modal logics generalise standard modal logics via families of modalities indexed by an algebraic structure whose operations mediate between the different modalities. The graded "of-course" modality !_r captures how many times a proposition is used and has an analogous interpretation to the of-course modality from linear logic; the of-course modality from linear logic can be modelled by a linear exponential comonad and graded of-course can be modelled by a graded linear exponential comonad. Benton showed in his seminal paper on Linear/Non-Linear logic that the of-course modality can be split into two modalities connecting intuitionistic logic with linear logic, forming a symmetric monoidal adjunction. Later, Fujii et al. demonstrated that every graded comonad can be decomposed into an adjunction and a "strict action". We give a similar result to Benton, leveraging Fujii et al.’s decomposition, showing that graded modalities can be split into two modalities connecting a graded logic with a graded linear logic. We propose a sequent calculus, its proof theory and categorical model, and a natural deduction system which we show is isomorphic to the sequent calculus system. Interestingly, our system can also be understood as Linear/Non-Linear logic composed with an action that adds the grading, further illuminating the shared principles between linear logic and a class of graded modal logics.more » « less
-
We study entropy flattening: Given a circuit C_X implicitly describing an n-bit source X (namely, X is the output of C_X on a uniform random input), construct another circuit C_Y describing a source Y such that (1) source Y is nearly flat (uniform on its support), and (2) the Shannon entropy of Y is monotonically related to that of X. The standard solution is to have C_Y evaluate C_X altogether Theta(n^2) times on independent inputs and concatenate the results (correctness follows from the asymptotic equipartition property). In this paper, we show that this is optimal among black-box constructions: Any circuit C_Y for entropy flattening that repeatedly queries C_X as an oracle requires Omega(n^2) queries. Entropy flattening is a component used in the constructions of pseudorandom generators and other cryptographic primitives from one-way functions [Johan Håstad et al., 1999; John Rompel, 1990; Thomas Holenstein, 2006; Iftach Haitner et al., 2006; Iftach Haitner et al., 2009; Iftach Haitner et al., 2013; Iftach Haitner et al., 2010; Salil P. Vadhan and Colin Jia Zheng, 2012]. It is also used in reductions between problems complete for statistical zero-knowledge [Tatsuaki Okamoto, 2000; Amit Sahai and Salil P. Vadhan, 1997; Oded Goldreich et al., 1999; Vadhan, 1999]. The Theta(n^2) query complexity is often the main efficiency bottleneck. Our lower bound can be viewed as a step towards proving that the current best construction of pseudorandom generator from arbitrary one-way functions by Vadhan and Zheng (STOC 2012) has optimal efficiency.more » « less
-
Abstract The concept of a primitive potential for the Schrödinger operator on the line was introduced in Dyachenko et al. (2016, Phys. D, 333, 148–156), Zakharov, Dyachenko et al. (2016, Lett. Math. Phys., 106, 731–740) and Zakharov, Zakharov et al. (2016, Phys. Lett. A, 380, 3881–3885). Such a potential is determined by a pair of positive functions on a finite interval, called the dressing functions, which are not uniquely determined by the potential. The potential is constructed by solving a contour problem on the complex plane. In this article, we consider a reduction where the dressing functions are equal. We show that in this case, the resulting potential is symmetric, and describe how to analytically compute the potential as a power series. In addition, we establish that if the dressing functions are both equal to one, then the resulting primitive potential is the elliptic one-gap potential.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.21468/SciPostPhys.16.3.069
