English
Related papers

Related papers: A constructive proof of the phase-type characteriz…

200 papers

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…

Logic in Computer Science · Computer Science 2018-05-02 Thierry Coquand , Simon Huber , Anders Mörtberg

The filter quotient construction is a particular instance of a filtered colimit of categories. It has primarily been considered in the context of categorical logic, where it has been used effectively to construct non-trivial models, for…

Category Theory · Mathematics 2026-03-10 Nima Rasekh

Infinite-state systems such as distributed protocols are challenging to verify using interactive theorem provers or automatic verification tools. Of these techniques, deductive verification is highly expressive but requires the user to…

Programming Languages · Computer Science 2019-05-21 Yotam M. Y. Feldman , James R. Wilcox , Sharon Shoham , Mooly Sagiv

Some recent papers formulated sufficient conditions for the decomposition of matrix variances. A statement was that if we have one or two observables, then the decomposition is possible. In this paper we consider an arbitrary finite set of…

Functional Analysis · Mathematics 2015-04-24 Dénes Petz , Dániel Virosztek

We prove a result on the existence of linear forms of a given Diophantine type.

Number Theory · Mathematics 2009-09-26 Oleg N. German , Nikolay G. Moshchevitin

We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlying a theorem prover. We also show a close relation with the…

Logic in Computer Science · Computer Science 2015-07-01 Benjamin Werner

Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…

Programming Languages · Computer Science 2015-02-05 Mauro Jaskelioff , Russell O'Connor

In this note, we find a new way to prove several properties of 2-alternating capacities.

Probability · Mathematics 2013-07-04 Guangyan Jia , Na Zhang

We show that topological properties of minimal Dirac sheets as well as of currents lines characterize the phases unambiguously. We obtain the minimal sheets reliably by a suitable simulated-annealing procedure.

High Energy Physics - Lattice · Physics 2009-10-28 W. Kerler , C. Rebbi , A. Weber

We show, that the standard model of phase transition can be unified with the gradient model of phase transitions using the description in terms of the gradient of order parameter. The generalization of the gradient theory of phase…

Statistical Mechanics · Physics 2012-06-21 B. I. Lev , A. G. Zagorodny

We point out that harmonic oscillator coherent states, in coordinate representation, require particular phase factor, in order to represent classical time evolution properly. The presence of such a phase is clearly stated only in a minority…

Quantum Physics · Physics 2014-11-18 W. Berej , P. Rozmej

In the theory of programming languages, type inference is the process of inferring the type of an expression automatically, often making use of information from the context in which the expression appears. Such mechanisms turn out to be…

Logic in Computer Science · Computer Science 2012-05-10 Jeremy Avigad

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

Functional Analysis · Mathematics 2008-12-09 Geraldo Botelho , Daniel Pellegrino , Pilar Rueda

The aim of this paper is to prove characterization theorems for higher order derivations. Among others we prove that the system defining higher order derivations is stable. Further characterization theorems in the spirit of N.~G.~de Bruijn…

Classical Analysis and ODEs · Mathematics 2016-12-06 Eszter Gselmann

In this work we develop the theory of solution-regions with a constructive approach. We also extend the theory to the case of general linear conditions and provide various sets of sufficient hypotheses for existence and multiplicity…

Classical Analysis and ODEs · Mathematics 2019-09-10 F. Adrián F. Tojo

We present gradual type theory, a logic and type theory for call-by-name gradual typing. We define the central constructions of gradual typing (the dynamic type, type casts and type error) in a novel way, by universal properties relative to…

Programming Languages · Computer Science 2023-06-22 Max S. New , Daniel R. Licata

We analyze the phase structure of 2d lattice CP(1) model with $\theta$ term by using the bond-weighted tensor renormalization group method. We propose a new tensor network representation for the model using the quadrature scheme and confirm…

High Energy Physics - Lattice · Physics 2025-02-11 Hayato Aizawa , Shinji Takeda , Yusuke Yoshimura

Lurie's representability theorem gives necessary and sufficient conditions for a functor to be an almost finitely presented derived geometric stack. We establish several variants of Lurie's theorem, making the hypotheses easier to verify…

Algebraic Geometry · Mathematics 2014-09-08 J. P. Pridham

We introduce a new criterion which if satisfied implies the Riemann hypothesis.

General Mathematics · Mathematics 2011-07-27 Roupam Ghosh

The purpose of this note is to prove a stationary phase estimate well adapted to parameter dependent phases. In particular, no discussion is made on the positions (and behaviour) of critical points, no lower or upper bound on the gradient…

Analysis of PDEs · Mathematics 2015-11-05 T Alazard , N Burq , C Zuily