相关论文: On a general theorem for additive Levy processes

We introduce layer systems for proving generalizations of the modularity of confluence for first-order rewrite systems. Layer systems specify how terms can be divided into layers. We establish structural conditions on those systems that…

We present an existence result for L\'evy-type processes which requires only weak regularity assumptions on the symbol $q(x,\xi)$ with respect to the space variable $x$. Applications range from existence and uniqueness results for…

We review the theory of renewal reward processes, which describes renewal processes that have some cost or reward associated with each cycle. We present a new simplified proof of the renewal reward theorem that mimics the proof of the…

We develop combinatorial test generation algorithms for progressively more powerful theorem provers, covering formula languages ranging from the implicational fragment of intuitionistic logic to full intuitionistic propositional logic. Our…

We introduce a new method in the attempt to prove the Jacobian conjecture. In the complex dimension 2 case, we apply this method to prove some new results related the Jacobian conjecture.

In this paper we prove an extension of the Blaschke-Lebesgue theorem for a family of convex domains called disk-polygons. Also, this provides yet another new proof of the Blaschke-Lebesgue theorem.

The aim of this paper is to give an alternative proof of Kac's theorem for weighted projective lines (\cite{W}) over the complex field. The geometric realization of complex Lie algebras arising from derived categories (\cite{XXZ}) is…

We prove some new results related to Tanaka's formula.

We prove a discretized Product Theorem for general simple Lie groups, in the spirit of Bourgain's Discretized Sum-Product Theorem.

The Hard Lefschetz theorem is known to hold for the intersection cohomology of the toric variety associated to a rational convex polytope. One can construct the intersection cohomology combinatorially from the polytope, hence it is well…

We demonstrate how a generic automated theorem prover can be applied to establish the non-orderability of groups. Our approach incorporates various tools such as positive cones, torsions, generalised torsions and cofinal elements.

We prove moving lemma for additive higher Chow groups of smooth projective varieties. As applications, we prove the very general contravariance property of additive higher Chow groups. Using the moving lemma, we establish the structure of…

This paper presents a generalized version of a theorem of Grzegorek and Labuda in category bases and also endeavours to establish a variant formulation of the same in Marczewski structures.

We show that in a vector space over Z_3, the union of any four linear bases is an additive basis, thus proving the Additive Basis Conjecture for p=3, and providing an alternative proof of the weak 3-flow conjecture.

We provide necessary and sufficient conditions for convergence of exponential integrals of Markov additive processes. Other than in the classical L\'evy case studied by Erickson and Maller we have to distinguish between almost sure…

Mechanized theorem proving is becoming the basis of reliable systems programming and rigorous mathematics. Despite decades of progress in proof automation, writing mechanized proofs still requires engineers' expertise and remains labor…

We define a generalization of the Turing machine that computes on general sets. Our main theorem states that the class of generalized Turing machine computable functions and the class of Set Recursive functions coincide.

We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…

We give a concise proof of the fundamental theorem of smoothing theory in the special case when a smoothing exists.

We describe recent advances in the study of random analogues of combinatorial theorems.