相关论文: Lattice Variant of the Sensitivity Conjecture

We consider the $Sp(4)$ gauge theory coupled to $N_f=2$ fundamental and $n_f=3$ antisymmetric flavours of Dirac fermions in four dimensions. This theory serves as the microscopic origin for composite Higgs models with $SU(4)/Sp(4)$ coset,…

Causal inference relies on the untestable assumption of no unmeasured confounding. Sensitivity analysis can be used to quantify the impact of unmeasured confounding on causal estimates. Among sensitivity analysis methods proposed in the…

It was proved by Nill that for any lattice simplex of dimension $d$ with degree $s$ which is not a lattice pyramid, the inequality $d+1 \leq 4s-1$ holds. In this paper, we give a complete characterization of lattice simplices satisfying the…

Recent measurements of the branching fraction for D_s -> l nu disagree with the Standard Model by around 2sigma. In this case the key aspect of the Standard Model is the calculation of the decay constant, f_{D_s}, with lattice QCD. This…

The lifetime of a system of connected units under some natural assumptions can be represented as a random variable Y defined as a weighted lattice polynomial of random lifetimes of its components. As such, the concept of a random variable Y…

Decelle et al.\cite{Decelle11} conjectured the existence of a sharp threshold for community detection in sparse random graphs drawn from the stochastic block model. Mossel et al.\cite{Mossel12} established the negative part of the…

We consider the problem of best subset selection (BSS) under high-dimensional sparse linear regression model. Recently, Guo et al. (2020) showed that the model selection performance of BSS depends on a certain identifiability margin, a…

This paper investigates the classical statistical signal processing problem of detecting a signal in the presence of colored noise with an unknown covariance matrix. In particular, we consider a scenario where m-dimensional p possible…

The chromatic polynomial is a well studied object in graph theory. There are many results and conjectures about the log-concavity of the chromatic polynomial and other polynomials related to it. The location of the roots of these…

Recently, a class of solvable interaction round the face lattice models (IRF) were constructed for an arbitrary rational conformal field theory (RCFT) and an arbitrary field in it. The Boltzmann weights of the lattice models are related in…

The Shortest Lattice Vector (SLV) problem is in general hard to solve, except for special cases (such as root lattices and lattices for which an obtuse superbase is known). In this paper, we present a new class of SLV problems that can be…

Optical lattice clocks with uncertainty and instability in the $10^{-17}$-range and below have so far been demonstrated exclusively using fermions. Here, we demonstrate a bosonic optical lattice clock with $3\times 10^{-18}$ instability and…

In neuroscience, researchers seek to uncover the connectivity of neurons from large-scale neural recordings or imaging; often people employ graphical model selection and estimation techniques for this purpose. But, existing technologies can…

Lattice gauge theory's discretization of spacetime suffers from a drawback in that Lorentz covariance is lost because the axes of the lattice create preferred directions in spacetime. Smaller and smaller lattice spacings decrease the effect…

We present a numerical study for the threshold percolation probability, $p_c$, in the bond percolation model with multiple ranges, in the square lattice. A recent Theorem demonstrated by de Lima {\it et al.} [B. N. B. de Lima, R. P.…

We consider a possible discretization for the gauge-fixed Green-Schwarz (two-dimensional) sigma-model action for the Type IIB superstring and use it for measuring the cusp anomalous dimension of planar $\mathcal{N}=4$ SYM as derived from…

One of the driving problems in the CSP area is the Dichotomy Conjecture, formulated in 1993 by Feder and Vardi [STOC'93], stating that for any fixed relational structure G the Constraint Satisfaction Problem CSP(G) is either NP--complete or…

Best subset selection (BSS) is widely known as the holy grail for high-dimensional variable selection. Nevertheless, the notorious NP-hardness of BSS substantially restricts its practical application and also discourages its theoretical…

We show examples of total Boolean functions that depend on $n$ variables and have spectral sensitivity $\Theta(\sqrt{\log n})$, which is asymptotically minimal. Our main new function combines the Hamming code with the Boolean address…

Clustering is a fundamental primitive in unsupervised learning which gives rise to a rich class of computationally-challenging inference tasks. In this work, we focus on the canonical task of clustering d-dimensional Gaussian mixtures with…