• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 15,124
Next 10 →

Explicit constructions:

by unknown authors
"... 2. Group theory and graphs with large girth. 3. Expanders and superconcentrators. 4. Character sums and pseudo-random graphs. ..."
Abstract - Add to MetaCart
2. Group theory and graphs with large girth. 3. Expanders and superconcentrators. 4. Character sums and pseudo-random graphs.

AN EXPLICIT CONSTRUCTION FOR THE HAPPEL FUNCTOR

by M. Barot, O. Mendoza
"... Abstract. An easy explicit construction is given for a full and ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Abstract. An easy explicit construction is given for a full and

Explicit constructions of Ramanujan complexes

by Alexander Lubotzky, Beth Samuels, Uzi Vishne - European J. of Combinatorics
"... Abstract. In this paper we present for every d ≥ 2 and every local field F of positive characteristic, explicit constructions of Ramanujan complexes which are quotients of the Bruhat-Tits building Bd(F) associated with PGLd(F). 1. ..."
Abstract - Cited by 25 (8 self) - Add to MetaCart
Abstract. In this paper we present for every d ≥ 2 and every local field F of positive characteristic, explicit constructions of Ramanujan complexes which are quotients of the Bruhat-Tits building Bd(F) associated with PGLd(F). 1.

Explicit Constructions in Discrete Valuations

by Miguel Ángel Olalla Acosta
"... In this paper we give an explicit construction of a system of parametric equations describing a discrete valuation over k((X 1 ; : : : ; Xn )). This amounts to finding a parameter and a eld of coefficients. We devote section 1 to finding an element of value 1, that is, the parameter. The field of c ..."
Abstract - Add to MetaCart
In this paper we give an explicit construction of a system of parametric equations describing a discrete valuation over k((X 1 ; : : : ; Xn )). This amounts to finding a parameter and a eld of coefficients. We devote section 1 to finding an element of value 1, that is, the parameter. The field

Explicit Construction of Solutions of the . . .

by F. Gesztesy, H. Holden, E. Saab, B. Simon , 1991
"... Given a solution of the Kadomtsev-Petviashvili equation we explicitly construct a solution of the modified Kadomtsev-Petviashvili equation related to one another by a generalized Miura transformation. The construction is modeled after a previous treatment of the modified Kortewegde Vries case. As an ..."
Abstract - Add to MetaCart
Given a solution of the Kadomtsev-Petviashvili equation we explicitly construct a solution of the modified Kadomtsev-Petviashvili equation related to one another by a generalized Miura transformation. The construction is modeled after a previous treatment of the modified Kortewegde Vries case

The Complexity of Explicit Constructions

by Rahul Santhanam
"... The existence of extremal combinatorial objects, such as Ramsey graphs and expanders, is often shown using the probabilistic method. It is folklore that pseudo-random generators can be used to obtain explicit constructions of these objects, if the test that the object is extremal can be implemented ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
The existence of extremal combinatorial objects, such as Ramsey graphs and expanders, is often shown using the probabilistic method. It is folklore that pseudo-random generators can be used to obtain explicit constructions of these objects, if the test that the object is extremal can be implemented

Explicit constructions in discrete valuations

by Miguel Ángel, Olalla Acosta, X Y , 2008
"... In this paper we give an explicit construction of a system of parametric equations describing a discrete valuation over k((X1,..., Xn)). This amounts to finding a parameter and a field of coefficients. We devote section 1 to finding an element of value 1, that is, the parameter. The field of coeffic ..."
Abstract - Add to MetaCart
In this paper we give an explicit construction of a system of parametric equations describing a discrete valuation over k((X1,..., Xn)). This amounts to finding a parameter and a field of coefficients. We devote section 1 to finding an element of value 1, that is, the parameter. The field

Explicit Construction of Nilpotent Covariants in

by Howe Schubert Sokatchev, P. S. Howe, C. Schubert, E. Sokatchev
"... Some aspects of correlation functions in N = 4 SYM are discussed. Using N = 4 harmonic superspace we study two and three-point correlation functions which are of contact type and argue that these contact terms will not affect the non-renormalisation theorem for such correlators at non-coincident poi ..."
Abstract - Add to MetaCart
-point function turns out to be significantly simpler than the original direct calculation. This calculation also provides an explicit construction of an N = 2 component of an N = 4 five-point nilpotent covariant that violates U(1) Y symmetry. 1 UMR 5108 associ'ee `a l'Universit'e de Savoie 1

Explicit Construction of Framelets

by Alexander Petukhov , 2001
"... We study tight wavelet frames associated with given refinable functions which are obtained with the unitary extension principles. All possible solutions of the corresponding matrix equations are found. It is proved that the problem of the extension may be always solved with two framelets. In partic ..."
Abstract - Cited by 30 (4 self) - Add to MetaCart
We study tight wavelet frames associated with given refinable functions which are obtained with the unitary extension principles. All possible solutions of the corresponding matrix equations are found. It is proved that the problem of the extension may be always solved with two framelets. In particular, if symbols of the refinable functions are polynomials (rational functions), then the corresponding framelets with polynomial (rational) symbols can be found.

An explicit construction of quantum expanders

by Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma , 2007
"... Quantum expanders are a natural generalization of classical expanders. These objects were introduced and studied by [1, 3, 4]. In this note we show how to construct explicit, constant-degree quantum expanders. The construction is essentially the classical Zig-Zag expander construction of [5], applie ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Quantum expanders are a natural generalization of classical expanders. These objects were introduced and studied by [1, 3, 4]. In this note we show how to construct explicit, constant-degree quantum expanders. The construction is essentially the classical Zig-Zag expander construction of [5
Next 10 →
Results 1 - 10 of 15,124
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University