Discreteness and integrality in Conformal Field Theory

Various observables in compact CFTs are required to obey positivity, discreteness, and integrality. Positivity forms the crux of the conformal bootstrap, but understanding of the abstract implications of discreteness and integrality for the space of CFTs is lacking. We systematically study these constraints in two-dimensional, non-holomorphic CFTs, making use of two main mathematical results. First, we prove a theorem constraining the behavior near the cusp of integral, vector-valued modular functions. Second, we explicitly construct non-factorizable, non-holomorphic cuspidal functions satisfying discreteness and integrality, and prove the non-existence of such functions once positivity is added. Application of these results yields several bootstrap-type bounds on OPE data of both rational and irrational CFTs, including some powerful bounds for theories with conformal manifolds, as well as insights into questions of spectral determinacy. We prove that in rational CFT, the spectrum of operator twists $$ t\ge \frac{c}{12} $$ t ≥ c 12 is uniquely determined by its complement. Likewise, we argue that in generic CFTs, the spectrum of operator dimensions $$ \Delta >\frac{c-1}{12} $$ Δ > c − 1 12 is uniquely determined by its complement, absent fine-tuning in a sense we articulate. Finally, we discuss implications for black hole physics and the (non-)uniqueness of a possible ensemble interpretation of AdS3 gravity.

INTEGRAL MAJORIZATION POLYTOPES

The majorization polytope M(a) consists of all vectors dominated (or majorized, to be precise) by a given vector a ∈ ℝn; this is a polytope with extreme points being the permutations of a. For integral vector a, let ν(a) be the number of integral vectors contained in M(a). We present several properties of the function ν and provide an algorithm for computing ν(a).

Vector J -integral analysis of crack initiation at the edge of complete sliding contact

In this paper, the crack initiation at contact surface of solids is investigated on the basis of the concept of potential energy release rate. The expressions for path-independent integral vector J i ( i =1, 2) are derived and applied to the consideration of the process of crack initiation. The relationship is then established between the value of the path-independent integral vector J i and the potential energy release rate for crack initiation in an arbitrary orientation. This allows the prediction of crack initiation angle on the basis of the maximum energy release rate criterion. The surface crack initiation angle in fretting fatigue is determined analytically as a function of the friction coefficient of the edge contact. This theoretical result is compared with the existing experimental results reported in the literature and a good agreement is found. The formulation provides a novel basis for numerical modelling of the complex process of fretting fatigue.

Fast Unimodular Counting

This paper describes methods for counting the number of nonnegative integer solutions of the system Ax = b when A is a nonnegative totally unimodular matrix and b an integral vector of fixed dimension. The complexity (under a unit cost arithmetic model) is strong in the sense that it depends only on the dimensions of A and not on the size of the entries of b. For the special case of ‘contingency tables’ the run-time is 2O(√dlogd) (where d is the dimension of the polytope). The method is complementary to Barvinok's in that our algorithm is effective on problems of high dimension with a fixed number of (non-sign) constraints, whereas Barvinok's algorithms are effective on problems of low dimension and an arbitrary number of constraints.

On Dominating Sets and Independent Sets of Graphs

For a graph G on vertex set V = {1, …, n} let k = (k1, …, kn) be an integral vector such that 1 [les ] ki [les ] di for i ∈ V, where di is the degree of the vertex i in G. A k-dominating set is a set Dk ⊆ V such that every vertex i ∈ V[setmn ]Dk has at least ki neighbours in Dk. The k-domination number γk(G) of G is the cardinality of a smallest k-dominating set of G.For k1 = · · · = kn = 1, k-domination corresponds to the usual concept of domination. Our approach yields an improvement of an upper bound for the domination number found by N. Alon and J. H. Spencer.If ki = di for i = 1, …, n, then the notion of k-dominating set corresponds to the complement of an independent set. A function fk(p) is defined, and it will be proved that γk(G) = min fk(p), where the minimum is taken over the n-dimensional cube Cn = {p = (p1, …, pn) [mid ] pi ∈ ℝ, 0 [les ] pi [les ] 1, i = 1, …, n}. An [Oscr ](Δ22Δn-algorithm is presented, where Δ is the maximum degree of G, with INPUT: p ∈ Cn and OUTPUT: a k-dominating set Dk of G with [mid ]Dk[mid ][les ]fk(p).