English
Related papers

Related papers: Measuring well quasi-ordered finitary powersets

200 papers

We characterize the asymptotic performance of a class of positive operator valued measurements (POVMs) where the only task is to make measurements on independent and identically distributed quantum states on finite-dimensional systems. The…

Quantum Physics · Physics 2016-11-24 Janis Nötzel

We study optimization problems in which a linear functional is maximized over probability measures that are dominated by a given measure according to an integral stochastic order in an arbitrary dimension. We show that the following four…

Theoretical Economics · Economics 2026-03-13 Frank Yang , Kai Hao Yang

Musical chords, harmonies or melodies in Just Intonation have note frequencies which are described by a base frequency multiplied by rational numbers. For any local section, these notes can be converted to some base frequency multiplied by…

Sound · Computer Science 2017-01-25 David Ryan

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…

Data Structures and Algorithms · Computer Science 2007-07-12 Constantinos Daskalakis , Richard M. Karp , Elchanan Mossel , Samantha Riesenfeld , Elad Verbin

We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in…

Logic · Mathematics 2017-09-26 Milos S. Kurilic , Borisa Kuzeljevic

This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras),…

Logic · Mathematics 2007-05-23 Saharon Shelah

We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers,…

Logic in Computer Science · Computer Science 2008-03-20 Tobias Ganzow , Sasha Rubin

Amplitude expansions are used to determine steady states of a semi-infinite solid subject to the Grinfeld instability in systems with a fixed (wave)length. We present two methods to obtain high-order weakly nonlinear results. Using the…

Condensed Matter · Physics 2021-09-15 Peter Kohlert , Klaus Kassner , Chaouqi Misbah

For systems of controllable qubits, we provide a method for experimentally obtaining a useful class of multitime correlators using sequential generalized measurements of arbitrary strength. Specifically, if a correlator can be expressed as…

We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…

Logic · Mathematics 2007-05-23 Matthias Aschenbrenner , Wai-Yan Pong

In combinatorial optimization, ordinal costs can be used to model the quality of elements whenever numerical values are not available. When considering, for example, routing problems for cyclists, the safety of a street can be ranked in…

Optimization and Control · Mathematics 2026-01-07 Kathrin Klamroth , Michael Stiglmayr , Julia Sudhoff Santos

An orthomorphism over a finite field $\mathbb{F}_q$ is a permutation $\theta:\mathbb{F}_q\mapsto\mathbb{F}_q$ such that the map $x\mapsto\theta(x)-x$ is also a permutation of $\mathbb{F}_q$. The degree of an orthomorphism of $\mathbb{F}_q$,…

Combinatorics · Mathematics 2021-07-09 Jack Allsop , Ian M. Wanless

Higher order coefficients of the inverse mass expansion of one--loop effective actions are obtained from a one--dimensional path integral representation. For the evaluation of the path integral with Wick contractions a suitable Green…

High Energy Physics - Theory · Physics 2007-05-23 Denny Fliegner , Peter Haberl , Michael G. Schmidt , Christian Schubert

We characterize the extremal points of the convex set of quantum measurements that are covariant under a finite-dimensional projective representation of a compact group, with action of the group on the measurement probability space which is…

Quantum Physics · Physics 2007-05-23 G. Chiribella , G. M. D'Ariano

We consider finite element solutions to quadratic optimization problems, where the state depends on the control via a well-posed linear partial differential equation. Exploiting the structure of a suitably reduced optimality system, we…

Numerical Analysis · Mathematics 2019-10-03 Fernando Gaspoz , Christian Kreuzer , Andreas Veeser , Winnifried Wollner

A poset $\bfp$ is well-partially ordered (WPO) if all its linear extensions are well orders~; the supremum of ordered types of these linear extensions is the {\em length}, $\ell(\bfp)$ of $\bfp$. We prove that if the vertex set $X$ of…

Logic · Mathematics 2015-10-05 Christian Delhommé , Maurice Pouzet

Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…

Dynamical Systems · Mathematics 2021-09-20 Shilpak Banerjee , Philipp Kunde , Daren Wei

For control systems in discrete time, this paper discusses measure-theoretic invariance entropy for a subset Q of the state space with respect to a quasi-stationary measure obtained by endowing the control range with a probability measure.…

Dynamical Systems · Mathematics 2018-04-05 Fritz Colonius

On the basis of a model system of pillars built of unit cubes, a two-component entropic measure for the multiscale analysis of spatio-compositional inhomogeneity is proposed. It quantifies the statistical dissimilarity per cell of the…

Statistical Mechanics · Physics 2015-05-13 Ryszard Piasecki

This paper explores the problem of quantum measurement complexity. In computability theory, the complexity of a problem is determined by how long it takes an effective algorithm to solve it. This complexity may be compared to the difficulty…

Quantum Physics · Physics 2014-10-27 Subhash Kak