scholarly journals An alternate proof for counting the number of caterpillars

2020 ◽  
Author(s):  
V. Murugan ◽  
K. Prabakaran
Keyword(s):  
Alternate Proof

scholarly journals An Exponential Separation Between MA and AM Proofs of Proximity

2021 ◽  
Vol 30 (2) ◽  
Author(s):  
Tom Gur ◽  
Yang P. Liu ◽  
Ron D. Rothblum
Keyword(s):  
Quantum Information ◽  
Lower Bound ◽  
Recent Result ◽  
Query Complexity ◽  
Random String ◽  
Natural Property ◽  
Public And Private ◽  
Alternate Proof ◽  
Interactive Proofs ◽  
Exponential Separation

AbstractInteractive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work, we consider two natural minimally interactive variants of such proofs systems, in which the prover only sends a single message, referred to as the proof. The first variant, known as -proofs of Proximity (), is fully non-interactive, meaning that the proof is a function of the input only. The second variant, known as -proofs of Proximity (), allows the proof to additionally depend on the verifier's (entire) random string. The complexity of both s and s is the total number of bits that the verifier observes—namely, the sum of the proof length and query complexity. Our main result is an exponential separation between the power of s and s. Specifically, we exhibit an explicit and natural property $$\Pi$$ Π that admits an with complexity $$O(\log n)$$ O ( log n ) , whereas any for $$\Pi$$ Π has complexity $$\tilde{\Omega}(n^{1/4})$$ Ω ~ ( n 1 / 4 ) , where n denotes the length of the input in bits. Our lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014). Also, Aaronson (Quantum Information & Computation 2012) has shown a $$\Omega(n^{1/6})$$ Ω ( n 1 / 6 ) lower bound for the same property $$\Pi$$ Π .Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier's queries are oblivious to the proof. In this setting, we show that s can only be quadratically stronger than s. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.

An Alternate Proof of Cramer's Rule

1988 ◽  
Vol 19 (2) ◽  
pp. 171-171 ◽  
Author(s):  
Stephen H. Friedberg
Keyword(s):  
Alternate Proof ◽  
Cramer’S Rule

scholarly journals Reduced Canonical Forms of Stoppers

10.37236/1083 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Aaron N. Siegel
Keyword(s):  
Canonical Form ◽  
Canonical Forms ◽  
Alternate Proof

The reduced canonical form of a loopfree game $G$ is the simplest game infinitesimally close to $G$. Reduced canonical forms were introduced by Calistrate, and Grossman and Siegel provided an alternate proof of their existence. In this paper, we show that the Grossman–Siegel construction generalizes to find reduced canonical forms of certain loopy games.

An Alternate Proof of the Algorithmic Lovász Local Lemma

2017 ◽  
pp. 61-65
Author(s):  
Ioannis Giotis ◽  
Lefteris Kirousis ◽  
Kostas I. Psaromiligkos ◽  
Dimitrios M. Thilikos
Keyword(s):  
Lovász Local Lemma ◽  
Alternate Proof ◽  
Local Lemma ◽  
Lovasz Local Lemma

Statement B and the Yang-Baxter Equation

2011 ◽  
Author(s):  
Ben Brubaker ◽  
Daniel Bump ◽  
Solomon Friedberg
Keyword(s):  
Statistical Mechanics ◽  
Dirichlet Series ◽  
Weyl Group ◽  
Transfer Matrix ◽  
Baxter Equation ◽  
Partition Functions ◽  
Alternate Proof ◽  
Crystal Basis ◽  
Exactly Solved Models ◽  
Multiple Dirichlet Series

This chapter reinterprets Statements A and B in a different context, and yet again directly proves that the reinterpreted Statement B implies the reinterpreted Statement A in Theorem 19.10. The p-parts of Weyl group multiple Dirichlet series, with their deformed Weyl denominators, may be expressed as partition functions of exactly solved models in statistical mechanics. The transition to ice-type models represents a subtle shift in emphasis from the crystal basis representation, and suggests the introduction of a new tool, the Yang-Baxter equation. This tool was developed to prove the commutativity of the row transfer matrix for the six-vertex and similar models. This is significant because Statement B can be formulated in terms of the commutativity of two row transfer matrices. This chapter presents an alternate proof of Statement B using the Yang-Baxter equation.

Conjecture of D. R. Hughes Extended to Generalized André Planes

1970 ◽  
Vol 22 (3) ◽  
pp. 701-704
Author(s):  
M. L. Narayana Ra
Keyword(s):  
Original Problem ◽  
Translation Planes ◽  
Alternate Proof ◽  
Collineation Groups

In 1967 Foulser [1] defined a class of translation planes, called generalized André planes or λ-planes and discussed the associated autotopism collineation groups. While discussing these collineation groups he raised the following question:“Are there collineations of a λ plane which move the axes but do not interchange them?”.In this context, Foulser mentioned a conjecture of D. R. Hughes that among the André planes, only the Hall planes have collineations moving the axes without interchanging them. Wilke [4] answered Foulser's question partially by showing that the conjecture of Hughes is indeed correct. Recently, Foulser [2] has shown that possibly with a certain exception the Hall planes are the only generalized André planes which have collineations moving the axes without interchanging them. Our aim in this paper is to give an alternate proof, which is completely general, and is in the style of the original problem.

Sign in / Sign up

Export Citation Format

Share Document