Results 31 to 40 of about 1,842,228 (287)

Majority is Stablest : Discrete and SoS [PDF]

open access: yes, 2012
The Majority is Stablest Theorem has numerous applications in hardness of approximation and social choice theory. We give a new proof of the Majority is Stablest Theorem by induction on the dimension of the discrete cube.
De, Anindya   +2 more
core   +3 more sources

A proof theory for generic judgments: an extended abstract [PDF]

open access: yes18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., 2003
A powerful and declarative means of specifying computations containing abstractions involves meta-level, universally quantified generic judgments. We present a proof theory for such judgments in which signatures are associated to each sequent (used to account for eigenvariables of sequent) and to each formula in the sequent (used to account for generic
D. Miller, A. Tiu
openaire   +1 more source

A Theory for Abstract Reduction Systems in PVS

open access: yesCLEI Electronic Journal, 2008
A theory for Abstract Reduction Systems (ARS) in the proof assistant PVS (Prototype Verification System) called ars is described. Adequate specifications of basic definitions and notions of the theory of ARSs such as reduction, confluence and normal form
Andre Luiz Galdino   +1 more
doaj   +1 more source

Derivation of gravitational time dilation from principle of equivalence and special relativity

open access: yesScience & Philosophy, 2021
General relativity is the exact theory of gravity which has been experimentally found to be correct with extremely high accuracy. One of the most surprising predictions of the general theory is that time runs slow in a gravitational field.
Biswaranjan Dikshit
doaj   +1 more source

Estimating deep Littlewood-Richardson Coefficients [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2014
Littlewood Richardson coefficients are structure constants appearing in the representation theory of the general linear groups $(GL_n)$. The main results of this paper are: 1.
Hariharan Narayanan
doaj   +1 more source

Ward Identities and Renormalization of General Gauge Theories [PDF]

open access: yes, 2001
We introduce the concept of general gauge theory which includes Yang-Mills models. In the framework of the causal approach and show that the anomalies can appear only in the vacuum sector of the identities obtained from the gauge invariance condition by ...
Grigore, Dan Radu
core   +3 more sources

Analytical Theology: Deductive Proof of the Theorem of UnDecidability (In A Logically Formalized Axiomatic Theory Sigma) Of Formula [Dx] Representing (In A Relevant Theistic Interpretation) the Statement of God Existence

open access: yesДискурс Пи, 2020
The investigation aim - precise formulating and solving the problem of provability or improvability of statement of existence of God, and also of provability or improvability of negation of this statement in a formal axiomatic system of philosophical ...
Lobovikov V.O.
doaj   +1 more source

K-stability of Fano varieties via admissible flags

open access: yesForum of Mathematics, Pi, 2022
We develop a general approach to prove K-stability of Fano varieties. The new theory is used to (a) prove the existence of Kähler-Einstein metrics on all smooth Fano hypersurfaces of Fano index two, (b) compute the stability thresholds for hypersurfaces ...
Hamid Abban, Ziquan Zhuang
doaj   +1 more source

On a Convergence Theorem for Semigroups of Positive Integral Operators [PDF]

open access: yes, 2017
We give a new and very short proof of a theorem of Greiner asserting that a positive and contractive $C_0$-semigroup on an $L^p$-space is strongly convergent in case that it has a strictly positive fixed point and contains an integral operator. Our proof
Gerlach, Moritz, Glück, Jochen
core   +3 more sources

Revisiting Variable Output Length XOR Pseudorandom Function

open access: yesIACR Transactions on Symmetric Cryptology, 2018
Let σ be some positive integer and C ⊆ {(i, j) : 1 ≤ i < j ≤ σ}. The theory behind finding a lower bound on the number of distinct blocks P1, . . . , Pσ ∈ {0, 1}n satisfying a set of linear equations {Pi ⊕Pj = ci,j : (i, j) ∈ C} for some ci,j ∈ {0, 1}n ...
Srimanta Bhattacharya, Mridul Nandi
doaj   +1 more source

Home - About - Disclaimer - Privacy