Related papers: Definability via the tilting correspondence
We consider the space of convex functions defined in the Euclidean $n$-dimensional space, which are lower semi-continuous and tend to infinity at infinity. We study real-valued valuations defined on this space of functions, which are…
We apply a framework for the description of random tilings without height representation, which was proposed recently, to the special case of quasicrystalline random tilings. Several important examples are discussed, thereby demonstrating…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
We investigate the equational theory for Kleene algebra terms with variable complements and constant complements -- (language) complement where it applies only to variables or constants -- w.r.t. languages. While the equational theory…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
Potential heuristics for state-space search are defined as weighted sums over simple state features. Atomic features consider the value of a single state variable in a factored state representation, while binary features consider joint…
Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…
A chopped ideal is obtained from a homogeneous ideal by considering only the generators of a fixed degree. We investigate cases in which the chopped ideal defines the same finite set of points as the original one-dimensional ideal. The…
Let $K$ be an NIP field and let $v$ be a henselian valuation on $K$. We ask whether $(K,v)$ is NIP as a valued field. By a result of Shelah, we know that if $v$ is externally definable, then $(K,v)$ is NIP. Using the definability of the…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
We prove that the class of separably algebraically closed valued fields equipped with a distinguished Frobenius endomorphism $x \mapsto x^q$ is decidable, uniformly in $q$. The result is a simultaneous generalization of the work of…
This paper builds upon our recent work, published in Lett. Math. Phys., 112: 94, 2022, where we established that the integrable Volterra lattice on a free associative algebra and the whole hierarchy of its symmetries admits a quantisation…
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal…
Multiple importance sampling estimators are widely used for computing intractable constants due to its reliability and robustness. The celebrated balance heuristic estimator belongs to this class of methods and has proved very successful in…
The aim of the present paper is to generalise Sahlqvist correspondence theory to the many-valued modal semantics defined by Fitting, assuming a perfect Heyting algebra as truth value space. We present the standard translations between…
In this paper, we study extensions of valuations over algebraic field extensions without the use of the Axiom of Choice. We show a bijection between the extensions of a valuation and the maximal ideals of the relative integral closure of…
This paper is concerned with the shape invariants satisfied by the communication topology of {\pi}-terms, and the automatic inference of these invariants. A {\pi}-term P is hierarchical if there is a finite forest T such that the…
A classical theorem of P. McMullen describes all valuations on polytopes that are invariant under translations and weakly continuous, i.e., continuous with respect to parallel displacements of the facets of a polytope. While it is typically…
We introduce the notion of the definable rank of an ordered field, ordered abelian group and ordered set, respectively. We study the relation between the definable rank of an ordered field and the definable rank of the value group of its…