Related papers: An algorithm for Berenstein-Kazhdan decoration fun…
GW approximation is one of the most popular parameter-free many-body methods that goes beyond the limitations of the standard density functional theory (DFT) to determine the excitation spectra for moderately correlated materials and in…
We describe an algebraic algorithm which allows to express every one-loop lattice integral with gluon or Wilson-fermion propagators in terms of a small number of basic constants which can be computed with arbitrary high precision. Although…
We show that the local observables of the curved beta gamma system encode the sheaf of chiral differential operators using the machinery of the book "Factorization algebras in quantum field theory", by Kevin Costello and the second author,…
Let $\mathbf{B}$ be a basis for an $r$-dimensional algebra $A$ over a field or commutative ring with unity. The semifusions of $\mathbf{B}$ are the partitions of $\mathbf{B}$ whose characteristic functions form the basis of a subalgebra of…
The linear combination of atomic orbitals (LCAO) method uses a small basis set in exchange for expensive matrix element calculations. The most efficient approximation for the matrix element calculations is the two-center approximation (2CA)…
It is a classical result in representation theory that the braid group $\mathscr{B}_\mathfrak{g}$ of a simple Lie algebra $\mathfrak{g}$ acts on any integrable representation of $\mathfrak{g}$ via triple products of exponentials in its…
Motivated by the calculation of observables in the decays $\Lambda_b \to \Lambda_c\left({1 \over 2}^\pm \right) \ell \overline{\nu}$, as tests of Lepton Flavor Universality, we present a calculation of form factors in the quark model. Our…
We continue the study of separable elements in finite Weyl groups. These elements generalize the well-studied class of separable permutations. We show that the multiplication map $W/U \times U \to W$ is a length-additive bijection, or…
Let $B$ be a ring, not necessarily commutative, having an involution $*$ and let ${\mathrm U}_{2m}(B)$ be the unitary group of rank $2m$ associated to a hermitian or skew hermitian form relative to $*$. When $B$ is finite, we construct a…
This is a review of recent results on the integrable structure of the ordinary and modified melting crystal models. When deformed by special external potentials, the partition function of the ordinary melting crystal model is known to…
The Belgian chocolate problem involves maximizing a parameter {\delta} over a non-convex region of polynomials. In this paper we detail a global optimization method for this problem that outperforms previous such methods by exploiting…
Let $\beta>1$ be fixed. We consider the $(\frak{b, d})$ numeration system, where the base ${\frak b}=(b_k)_{k\geq 0}$ is a sequence of positive real numbers satisfying $\lim_{k\rightarrow \infty}b_{k+1}/b_k=\beta$, and the set of digits…
Applying the dispersion approach we compute perturbative QCD corrections to the power suppressed soft contribution of $B \to \gamma \ell \nu$ at leading twist. QCD factorization for the $B \to \gamma^{\ast}$ form factors is demonstrated…
We describe a simple deterministic $O( \varepsilon^{-1} \log \Delta)$ round distributed algorithm for $(2\alpha+1)(1 + \varepsilon)$ approximation of minimum weighted dominating set on graphs with arboricity at most $\alpha$. Here $\Delta$…
We present a regularized version of the color gradient lattice Boltzmann (LB) scheme for the simulation of droplet formation in microfluidic devices of experimental relevance. The regularized version is shown to provide computationally…
The restricted Boltzmann machine is a graphical model for binary random variables. Based on a complete bipartite graph separating hidden and observed variables, it is the binary analog to the factor analysis model. We study this graphical…
Let $G$ be a graph(directed or undirected) having $k$ number of blocks. A $\mathcal{B}$-partition of $G$ is a partition into $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdots,\hat{B_k})$ such that $\hat{B}_i$ is induced subgraph of…
Let $G$ be a simple undirected graph on $n$ vertices with maximum degree~$\Delta$. Brooks' Theorem states that $G$ has a $\Delta$-colouring unless~$G$ is a complete graph, or a cycle with an odd number of vertices. To recolour $G$ is to…
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
We propose a graph-based process calculus for modeling and reasoning about wireless networks with local broadcasts. Graphs are used at syntactical level to describe the topological structures of networks. This calculus is equipped with a…