Related papers: Interval-type theorems concerning quasi-arithmetic…
Previously, the author introduced quasirandom permutations, permutations of $\mathbb{Z}_n$ which map intervals to sets with low discrepancy. Here we show that several natural number-theoretic permutations are quasirandom, some very strongly…
There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as a particular case of duration-less intervals. A recent…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that…
We study the arithmetic (real) function, with f 'essentially bounded'. In particular, we obtain non-trivial bounds, through f 'correlations', for the 'Selberg integral' and the 'symmetry integral' of f in almost all short intervals…
A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…
We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…
Parametric Presburger arithmetic concerns families of sets S_t in Z^d, for t in N, that are defined using addition, inequalities, constants in Z, Boolean operations, multiplication by t, and quantifiers on variables ranging over Z. That is,…
There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as a particular case of duration-less intervals. A recent…
We present an approach to support partiality in type-level computation without compromising expressiveness or type safety. Existing frameworks for type-level computation either require totality or implicitly assume it. For example, type…
A structure ${\mathbb Y}$ of a relational language $L$ is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $<$ on the set $Y\setminus F$ such that for each partial automorphism $\varphi$ (i.e., local…
Inferential models have been proposed for valid and efficient prior-free probabilistic inference. As it gradually gained popularity, this theory is subject to further developments for practically challenging problems. This paper considers…
Interval-order partially ordered multisets with interfaces (ipomsets) have shown to be a versatile model for executions of concurrent systems in which both precedence and concurrency need to be taken into account. In this paper, we develop…
The set of points of a one-dimensional cut-and-project quasicrystal or model set, while not additive, is shown to be multiplicative for appropriate choices of acceptance windows. This leads to the definition of an associative additive…
This paper continues our study of quasicrystals initiated in Part I. We propose a general mechanism for constructing quasicrystals, existing globally in time, in spatially-extended systems (partial differential equations with Euclidean…
Motivated by algebraic quantum field theory and our previous work we study properties of inductive systems of \ $C^*$-algebras over arbitrary partially ordered sets. A partially ordered set can be represented as the union of the family of…
This paper aims to introduce a more general definition of quasirandom groups and generalize several well-known results in the literature in this new setting. More precisely, let $G$ be a semi-direct product of groups and $X\subseteq G$, we…
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…
For a real number $x$ and set of natural numbers $A$, define $x \ast A := \{ x a \bmod 1: a\in A\}\subseteq [0,1).$ We consider relationships between $x$, $A$, and the order-type of $x\ast A$. For example, for every irrational $x$ and…
We introduce a new family of non-negative real-valued functions on a $C^*$-algebra $\mathcal{A}$, i.e., for $0\leq \mu \leq 1,$ $$\|a\|_{\sigma_{\mu}}= \text{sup}\left\lbrace \sqrt{|f(a)|^2 \sigma_{\mu} f(a^*a)}: f\in \mathcal{A}', \,…