2,304 results for finite · 0.128s

Sponsored Partners
arxiv.org/abs/1411.3971v3

Finite-horizon optimal multiple switching with signed switching costs

This paper is concerned with optimal switching over multiple modes in continuous time and on a finite horizon. The performance index includes a running reward, terminal reward and switching costs that can belong to a large class of stochastic process...

arxiv.org/abs/1411.4438v2

Solving finite time horizon Dynkin games by optimal switching

This paper uses recent results on continuous-time finite-horizon optimal switching problems with negative switching costs to prove the existence of a saddle point in an optimal stopping (Dynkin) game. Sufficient conditions for the game's value to be...

arxiv.org/abs/1402.1826v2

Finite groups acting on higher dimensional noncommutative tori

For the canonical action $α$ of $\operatorname{SL}_2(\mathbb{Z})$ on 2-dimensional simple rotation algebras $\mathcal{A}_θ$, it is known that if $F$ is a finite subgroup of $\operatorname{SL}_2(\mathbb{Z})$, the crossed products $\mathcal{A}_θ\rti...

arxiv.org/abs/1710.00475v3

Relative phantom maps

The de Bruijn-Erdős theorem states that the chromatic number of an infinite graph equals the maximum of the chromatic numbers of finite subgraphs. Such a determinativeness by finite subobjects appears in the definition of a phantom map which is clas...

arxiv.org/abs/1305.4570v1

Blowing up and blurring finite Monk and rainbow algebras

We use Monk like algebras to give a new proof that the classes of strongly representable relation algebras and finite dimensional cylindric algebras of dimension >2 are not elementary. Our construction is based on relation algebras have cylindric bas...

arxiv.org/abs/0902.1874v1

Représentations linéaires des graphes finis

Let X be a non-empty finite set and alpha a symmetric bilinear form on a real finite dimensional vector space E. We say that a set GG={U_i | i in X} of linear lines in E is an isometric sheaf, if there exist generators u_i of the lines U_i, and rea...

arxiv.org/abs/2212.12918v2

Finite Undecidability in Fields II: PAC, PRC and PpC Fields

A field $K$ in a ring language $\mathcal{L}$ is finitely undecidable if $\mbox{Cons}(Σ)$ is undecidable for every nonempty finite $Σ\subseteq \mbox{Th}(K; \mathcal{L})$. We adapt arguments originating with Cherlin-van den Dries-Macintyre/Ershov (fo...

arxiv.org/abs/2210.12729v4

Finite Undecidability in Fields I: NIP Fields

A field $K$ in a ring language $\mathcal{L}$ is finitely undecidable if $\mbox{Cons}(Σ)$ is undecidable for every nonempty finite $Σ\subseteq \mbox{Th}(K; \mathcal{L})$. We extend a construction of Ziegler and (among other results) use a first-orde...

arxiv.org/abs/1903.05724v4

Maxwell's demons with finite size and response time

Nearly all theoretical analyses of the Maxwell's demon focus on its energetic and entropic costs of operation. Here, we focus on its rate of operation. In our model, a demon's rate limitation stems from its finite response time and gate area. We dete...

arxiv.org/abs/2005.13088v1

Predictive Maxwell's Demons

Here we study the operation efficiency of a finite-size finite-response-time Maxwell's demon, who can make future predictions. We compare the heat and mass transport rate of predictive demons to non-predictive ones and find that predictive demons can...

arxiv.org/abs/1911.10936v2

Finite-Time 4-Expert Prediction Problem

We explicitly solve the nonlinear PDE that is the continuous limit of dynamic programming of \emph{expert prediction problem} in finite horizon setting with $N=4$ experts. The \emph{expert prediction problem} is formulated as a zero sum game between...

arxiv.org/abs/2208.03745v1

On the algorithmic construction of the 1960 sectional complement

In 1960, G. Grätzer and E.\,T. Schmidt proved that every finite distributive lattice can be represented as the congruence lattice of a sectionally complemented finite lattice $L$. For $u \leq v$ in $L$, they constructed a sectional complement, which...