منابع مشابه
A universal tree balancing theorem
We present a general framework for balancing expressions (terms) in form of so called tree straight-line programs. The latter can be seen as circuits over the free term algebra extended by contexts (terms with a hole) and the operations which insert terms/contexts into contexts. It is shown that for every term one can compute in DLOGTIME-uniform TC$^0$ a tree straight-line program of logarithmi...
متن کاملA Tree Theorem for Inflation
It is shown that the generating function for tree graphs in the " in-in " formalism may be calculated by solving the classical equations of motion subject to certain constraints. This theorem is illustrated by application to the evolution of a single inflaton field in a Robertson–Walker background.
متن کاملA Universal Coefficient Theorem for Gauss’s Lemma
We shall prove a version of Gauß’s Lemma that recursively constructs polynomials {ck}k=0,...,m+n in Z[ai, Ai, bj , Bj ]i=0,...,m, j=0,...,n, of degree at most ( m+n n ) , such that whenever ∑ k CkX k = ∑ i AiX i · ∑ j BjX j and 1 = ∑
متن کاملA theorem of Todorcevic on universal Baireness
Given a cardinal κ, a set A ⊂ ω is κ-universally Baire if there exist trees S, T which project to A and its complement respectively, and which continue to project to complements after the forcing Coll(ω, κ). Todorcevic [3] has shown that under Martin’s Maximum every set of reals of cardinality א1 is א1-universally Baire but not א2-universally Baire. Here we present alternate proofs of these two...
متن کاملAround Matrix-tree Theorem
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system Dn (the classical theorem corresponds to the An-case). Several byproducts of the developed technique, such as a new formula for a specialization of the multivariate Tutte polynom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2019
ISSN: 1942-3454,1942-3462
DOI: 10.1145/3278158