相关论文: Keisler's order via Boolean ultrapowers

We develop a direct method to recover an orthoalgebra from its poset of Boolean subalgebras. For this a new notion of direction is introduced. Directions are also used to characterize in purely order-theoretic terms those posets that are…

We consider a general class of Fourier coefficients for an automorphic form on a finite cover of a reductive adelic group ${\bf G}(\mathbb{A}_{\mathbb{K}})$, associated to the data of a `Whittaker pair'. We describe a quasi-order on Fourier…

We introduce a general multisummability theory of formal power series in Carleman ultraholomorphic classes. The finitely many levels of summation are determined by pairwise comparable, nonequivalent weight sequences admitting nonzero…

Brown and Goodearl stated a conjecture that provides an explicit description of the topology of the spectra of quantum algebras. The conjecture takes on a more explicit form if there exist separating Ore sets for all incident pairs of torus…

We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…

We investigate a 2-dimensional N=2 supersymmetric model which consists of n chiral superfields with Kahler potential. When we define quantum observables, we are always plagued by operator ordering problem. Among various ways to fix the…

Let $\mathcal{A}$ be a Weyl arrangement. We introduce and study the notion of $\mathcal{A}$-Eulerian polynomial producing an Eulerian-like polynomial for any subarrangement of $\mathcal{A}$. This polynomial together with shift operator…

A modification of the standard Boris algorithm, called filtered Boris algorithm, is proposed for the numerical integration of the equations of motion of charged particles in a strong non-uniform magnetic field in the asymptotic scaling…

The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra B to each formula. We show some basic results regarding the effect of the properties of B on the behavior of…

The size and complexity of software and hardware systems have significantly increased in the past years. As a result, it is harder to guarantee their correct behavior. One of the most successful methods for automated verification of…

A classical result in descriptive complexity theory states that Datalog expresses exactly the class of polynomially computable queries on ordered databases. In this paper we extend this result to the case of higher-order Datalog. In…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

We introduce the decomposability spectrum $K_D=\{\lambda \geq \omega| D \text{is} \lambda\text{-decomposable}\}$ of an ultrafilter $D$, and show that Shelah's $\pcf$ theory influences the possible values $K_D$ can take. For example, we show…

We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related…

Weil's theorem gives the most standard bound on the number of points of a curve over a finite field. This bound was improved by Ihara and Oesterl\'e for larger genus. Recently, Hallouin and Perret gave a new point of view on these bounds,…

Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…

Necessary and sufficient conditions are given for a prime Noetherian algebra K[S] of a submonoid S of a polycyclic-by-finite group G to be a maximal order. These conditions are entirely in terms of the monoid S. This extends earlier results…

The influence of class orderings in the evaluation of incremental learning has received very little attention. In this paper, we investigate the impact of class orderings for incrementally learned classifiers. We propose a method to compute…

Let C denote any of the following cardinal characteristics of Boolean algebras: incomparability, spread, character, pi-character, hereditary Lindelof number, hereditary density. It is shown to be consistent that there exists a sequence…

Let $F$ be a totally real field with ring of integers $O_F$, and $D$ be a totally definite quaternion algebra over $F$. A well-known formula established by Eichler and then extended by K\"orner computes the class number of any $O_F$-order…