相关论文: Mathematical basis for polySAT implication operato…

We give a short direct proof of Agler's factorization theorem that uses the abstract characterization of operator algebras. the key ingredient of this proof is an operator algebra factorization theorem. Our proof provides some additional…

An analytical method is advanced for constructing interpolation formulae for complicated problems of statistical mechanics, in which just a few terms of asymptotic expansions are available. The method is based on the self-similar…

We collect and organise known results and add some new ones of the following nature: if A is a bounded operator in a Hilbert or Banach space, does there exist a nonconstant polynomial p(z) such that p(A) is "simpler", "nicer" than A. The…

An automated explanation facility for Bayesian conditioning aimed at improving user acceptance of probability-based decision support systems has been developed. The domain-independent facility is based on an information processing…

Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…

In the last decades many authors have become interested in the study of multilinear and polynomial generalizations of families of operator ideals (such as, for instance, the ideal of absolutely summing operators). However, these…

We investigate some modal operators of necessity and possibility in the context of meet-complemented (not necessarily distributive) lattices. We proceed in stages. We compare our operators with others.

Courses in mathematical methods for physics students are not known for including too much in the way of mathematical rigour and, in some ways, understandably so. However, the conditions under which some quite commonly used mathematical…

I give an introduction to algorithmic uses of the principle of inclusion-exclusion. The presentation is intended to be be concrete and accessible, at the expense of generality and comprehensiveness.

We shed doubt on a commonly used manipulation in computing the partition function for a matrix valued operator together with its attendant invocation of the multiplicative anomaly.

Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than using external measure. We survey how automata theory…

Symbolic computation is an important approach in automated program analysis. Most state-of-the-art tools perform symbolic computation as interpreters and directly maintain symbolic data. In this paper, we show that it is feasible, and in…

I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…

Simulation methods are among the most ubiquitous methodological tools in statistical science. In particular, statisticians often is simulation to explore properties of statistical functionals in models for which developed statistical theory…

The convergence of a new general variable metric algorithm based on compositions of averaged operators is established. Applications to monotone operator splitting are presented.

We use the theory of motivic integration in order to give a geometric explanation of the behavior of some p-adic integrals.

A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…

An analyst observes an agent take a sequence of actions. The analyst does not have access to the agent's information and ponders whether the observed actions could be justified through a rational Bayesian model with a known utility…

This essay considers the special character of mathematical reasoning, and draws on observations from interactive theorem proving and the history of mathematics to clarify the nature of formal and informal mathematical language. It proposes…

Logical inference algorithms for conditional independence (CI) statements have important applications from testing consistency during knowledge elicitation to constraintbased structure learning of graphical models. We prove that the…