882 resultados para Gleason-Pierce Theorem
Resumo:
We derive a simple closed analytical expression for the total entropy production along a single stochastic trajectory of a Brownian particle diffusing on a periodic potential under an external constant force. By numerical simulations we compute the probability distribution functions of the entropy and satisfactorily test many of the predictions based on Seiferts integral fluctuation theorem. The results presented for this simple model clearly illustrate the practical features and implications derived from such a result of nonequilibrium statistical mechanics.
Resumo:
We generalize the analogous of Lee Hwa Chungs theorem to the case of presymplectic manifolds. As an application, we study the canonical transformations of a canonical system (M, S, O). The role of Dirac brackets as a test of canonicity is clarified.
Resumo:
A generalization of the predictive relativistic mechanics is studied where the initial conditions are taken on a general hypersurface of M4. The induced realizations of the Poincar group are obtained. The same procedure is used for the Galileo group. Noninteraction theorems are derived for both groups.
Resumo:
We prove a characterization of the support of the law of the solution for a stochastic wave equation with two-dimensional space variable, driven by a noise white in time and correlated in space. The result is a consequence of an approximation theorem, in the convergence of probability, for equations obtained by smoothing the random noise. For some particular classes of coefficients, approximation in the Lp-norm for p¿1 is also proved.
Resumo:
We study the possibility of splitting any bounded analytic function $f$ with singularities in a closed set $E\cup F$ as a sum of two bounded analytic functions with singularities in $E$ and $F$ respectively. We obtain some results under geometric restrictions on the sets $E$ and $F$ and we provide some examples showing the sharpness of the positive results.
Resumo:
We study the impact of sampling theorems on the fidelity of sparse image reconstruction on the sphere. We discuss how a reduction in the number of samples required to represent all information content of a band-limited signal acts to improve the fidelity of sparse image reconstruction, through both the dimensionality and sparsity of signals. To demonstrate this result, we consider a simple inpainting problem on the sphere and consider images sparse in the magnitude of their gradient. We develop a framework for total variation inpainting on the sphere, including fast methods to render the inpainting problem computationally feasible at high resolution. Recently a new sampling theorem on the sphere was developed, reducing the required number of samples by a factor of two for equiangular sampling schemes. Through numerical simulations, we verify the enhanced fidelity of sparse image reconstruction due to the more efficient sampling of the sphere provided by the new sampling theorem.
Resumo:
Let $\pi : \widetilde C \to C$ be an unramified double covering of irreducible smooth curves and let $P$ be the attached Prym variety. We prove the scheme-theoretic theta-dual equalities in the Prym variety $T(\widetilde C)=V^2$ and $T(V^2)=\widetilde C$, where $V^2$ is the Brill-Noether locus of $P$ associated to $\pi$ considered by Welters. As an application we prove a Torelli theorem analogous to the fact that the symmetric product $D^{(g)}$ of a curve $D$ of genus $g$ determines the curve.
Resumo:
By theorems of Ferguson and Lacey ($d=2$) and Lacey and Terwilleger ($d>2$), Nehari's theorem is known to hold on the polydisc $\D^d$ for $d>1$, i.e., if $H_\psi$ is a bounded Hankel form on $H^2(\D^d)$ with analytic symbol $\psi$, then there is a function $\varphi$ in $L^\infty(\T^d)$ such that $\psi$ is the Riesz projection of $\varphi$. A method proposed in Helson's last paper is used to show that the constant $C_d$ in the estimate $\|\varphi\|_\infty\le C_d \|H_\psi\|$ grows at least exponentially with $d$; it follows that there is no analogue of Nehari's theorem on the infinite-dimensional polydisc.
Resumo:
The objective of this research was to develop a primer for a polymerase chain reaction specific for Xylella fastidiosa strains that cause Pierce's Disease (PD) in grapes (Vitis vinifera). The DNA amplification of 23 different strains of X. fastidiosa, using a set of primers REP1-R (5'-IIIICGICGIATCCIGGC-3') and REP 2 (5'-ICGICTTATCIGGCCTAC-3') using the following program: 94 ºC/2 min; 35 X (94 ºC/1 min, 45 ºC/1 min and 72 ºC/1 min and 30 s) 72 ºC/5 min, produced a fragment of 630 bp that differentiated the strains that cause disease in grapes from the other strains. However, REP banding patterns could not be considered reliable for detection because the REP1-R and REP 2 primers correspond to repetitive sequences, which are found throughout the bacterial genome. The amplified product of 630 bp was eluted from the agarose gel, purified and sequenced. The nucleotide sequence information was used to identify and synthesize an specific oligonucleotide for X. fastidiosa strains that cause Pierce's Disease denominated Xf-1 (5'-CGGGGGTGTAGGAGGGGTTGT-3') which was used jointly with the REP-2 primer at the following conditions: 94 ºC/2 min; 35 X (94 ºC/1 min, 62 ºC/1 min; 72 ºC/1 min and 30 s) 72 ºC/10 min. The DNAs isolated from strains of X. fastidiosa from other hosts [almond (Prumus amygdalus), citrus (Citrus spp.), coffee (Coffea arabica), elm (Ulmus americana), mulberry (Morus rubra), oak (Quercus rubra), periwinkle wilt (Catharantus roseus), plums (Prunus salicina) and ragweed (Ambrosia artemisiifolia)] and also from other Gram negative and positive bacteria were submitted to amplification with a pair of primers Xf-1/REP 2 to verify its specificity. A fragment, about 350 bp, was amplified only when the DNA from strains of X. fastidiosa isolated from grapes was employed.
Resumo:
This work consists of a theoretical part and an experimental one. The first part provides a simple treatment of the celebrated von Neumann minimax theorem as formulated by Nikaid6 and Sion. It also discusses its relationships with fundamental theorems of convex analysis. The second part is about externality in sponsored search auctions. It shows that in these auctions, advertisers have externality effects on each other which influence their bidding behavior. It proposes Hal R.Varian model and shows how adding externality to this model will affect its properties. In order to have a better understanding of the interaction among advertisers in on-line auctions, it studies the structure of the Google advertisements networ.k and shows that it is a small-world scale-free network.
Resumo:
Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs. The method of proving correctness of properties of a computer program using the well-known Hoare Logic can be implemented by utilizing the robustness of dynamic logic. For a very broad range of languages and applications in program veri cation, a theorem prover named KIV (Karlsruhe Interactive Veri er) Theorem Prover has already been developed. But a high degree of automation and its complexity make it di cult to use it for educational purposes. My research work is motivated towards the design and implementation of a similar interactive theorem prover with educational use as its main design criteria. As the key purpose of this system is to serve as an educational tool, it is a self-explanatory system that explains every step of creating a derivation, i.e., proving a theorem. This deductive system is implemented in the platform-independent programming language Java. In addition, a very popular combination of a lexical analyzer generator, JFlex, and the parser generator BYacc/J for parsing formulas and programs has been used.
Resumo:
This paper proves a new representation theorem for domains with both discrete and continuous variables. The result generalizes Debreu's well-known representation theorem on connected domains. A strengthening of the standard continuity axiom is used in order to guarantee the existence of a representation. A generalization of the main theorem and an application of the more general result are also presented.