Search results for " proof"
showing 10 items of 118 documents
Multiple Canard Cycles in Generalized Liénard Equations
2001
AbstractThe paper treats multiple limit cycle bifurcations in singular perturbation problems of planar vector fields. The results deal with any number of parameters. Proofs are based on the techniques introduced in “Canard Cycles and Center Manifolds” (F. Dumortier and R. Roussarie, 1996, Mem. Amer. Math. Soc., 121). The presentation is limited to generalized Liénard equations εx+α(x, c)x+β(x, c)=0.
The defendant’s guilt beyond a reasonable doubt in the Italian criminal justice system
2021
The criminal law standard of Beyond A Reasonable Doubt (BARD) constitutes an evidentiary and judicial rule, formulated and applied for centuries in common law jurisdictions, which was expressly stated in the Italian Code of Criminal Procedure only about fifteen years ago. Unfortunately, the concept of reasonable doubt is inherently complex and does not easily lend itself to definition or refinement. In this regard, the Author examines especially the various positions and elaborations developed by legal literature and case-law in Italy, proposing a specific interpretation of the BARD rule that enhances and completes the particular procedural connotations of the adversarial system adopted i…
Existence of competitive equilibrium in a non-optimal one-sector economy without conditions on the distorted marginal product of capital
2012
Abstract This paper develops a method for proving the existence of competitive equilibrium in a distorted/non-optimal one-sector economy–a discrete time variant of the Romer model–without conditions on the equilibrium value of the marginal product of capital. Existence is obtained under weaker conditions than in Le Van et al. (2002) . Moreover, we provide an existence result for an economy with a regressive tax studied in Santos (2002) . The proofs rely on ideas of Becker and Boyd (1997) .
Multi-Skill Call Center as a Grading from “Old” Telephony
2009
We explore parallels between the older telephony switches and the multi-skill call centers. The numerical results have shown that a call center with equally distributed skills is preferable compared to traditional grading-type design. The annex contains a short version of mathematical proof on limited availability schemes design for small call flow intensity *** and for large *** . The proof explores one excellent V. Benes' paper (from Bell Labs). On its own merit, the annex could initiate new mathematical research in call center area, more by now the powerful software for numerical analysis is available. Main conclusion is the following: numerical analysis of simple multi-skill call center…
Phenomenological-Semantic Investigations into Incompleteness
2000
When today the phenomenologist surveys the history of the philosophical comprehension of Godel’s theorems, he is confronted with the realization that the decisive publications come almost exclusively from the sphere of analytic philosophy.1 But does phenomenology in the spirit of Husserl not mean to keep in step with the epochal results of the special sciences by working on the phenomenological understanding of them? Phenomenological research of this kind means the same as development of phenomenological theory of science (Wissenschaftstheorie). In connection with the incompleteness theorems, the latter would be confronted with fundamental questions such as, “To what extent can mathematical…
Resource Quantification for the No-Programming Theorem
2018
The no-programming theorem prohibits the existence of a Universal Programmable Quantum Processor. This statement has several implications in relation to quantum computation, but also to other tasks of quantum information processing, making this construction a central notion in this context. Nonetheless, it is well known that even when the strict model is not implementable, it is possible to conceive of it in an approximate sense. Unfortunately, the minimal resources necessary for this aim are still not completely understood. Here, we investigate quantitative statements of the theorem, improving exponentially previous bounds on the resources required by such a hypothetical machine. The proof…
Finitary formal topologies and Stone’s representation theorem
2008
AbstractWe study the concept of finitary formal topology, a point-free version of a topological space with a basis of compact open subsets. The notion of finitary formal topology is defined from the perspective of the Basic Picture (introduced by the second author) and thus it is endowed with a binary positivity relation. As an application, we prove a constructive version of Stone’s representation theorem for distributive lattices. We work within the framework of a minimalist foundation (as proposed by Maria Emilia Maietti and the second author). Both inductive and co-inductive methods are used in most proofs.
Surfaces with Boundary
2012
One of the objectives of this book is to obtain a rigorous proof of a version of Green’s formula for compact subsets of \(\mathbb{R}^2\) whose topological boundary is a regular curve of class C 2. These sets are typical examples of what we will call regular 2-surfaces with boundary in \(\mathbb{R}^2\). The analogous three-dimensional example would consist of a compact set of \(\mathbb{R}^3\) whose topological boundary is a regular surface of class C 2. The following example is perhaps instructive.
Il ruolo del white paper sulle offerte al pubblico di cripto-attività alla luce della proposta MiCA
2022
La proposta MiCA, nel regolare il white paper sulle offerte di crypto-assets, sembra tenere in considerazione i benefici e i limiti dei sistemi di voluntary e di mandatory disclosure, non optando integralmente né per il primo, né per il secondo. In quest’ottica, se può condividersi l’approccio regolamentare diretto a graduare, a seconda della tipologia di token offerto, sia il contenuto che l’assoggettamento del documento a mera notifica o ad approvazione ex ante da parte dell’Autorità competente, dubbi sorgono in ordine all’indistinta allocazione dell’onere della prova in capo all’oblato, nei casi di violazione della disciplina del relativo white paper.
How much geometry it takes to reconstruct a 2-manifold in R 3
2009
Known algorithms for reconstructing a 2-manifold from a point sample in R 3 are naturally based on decisions/predicates that take the geometry of the point sample into account. Facing the always present problem of round-off errors that easily compromise the exactness of those predicate decisions, an exact and robust implementation of these algorithms is far from being trivial and typically requires employment of advanced datatypes for exact arithmetic, as provided by libraries like CORE, LEDA, or GMP. In this article, we present a new reconstruction algorithm, one whose main novelties is to throw away geometry information early on in the reconstruction process and to mainly operate combina…