Related papers: Succinctness of the Complement and Intersection of…
We aim to fill a gap in the proof of an inequality relating two exponents of uniform Diophantine approximation stated in a paper by Bugeaud. We succeed to verify the inequality in several instances, in particular for small dimension.…
This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem…
Concrete domains, especially those that allow to compare features with numeric values, have long been recognized as a very desirable extension of description logics (DLs), and significant efforts have been invested into adding them to usual…
An atom of a regular language L with n (left) quotients is a non-empty intersection of uncomplemented or complemented quotients of L, where each of the n quotients appears in a term of the intersection. The quotient complexity of L, which…
We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…
We derive a lower bound for the subword complexity of the base-$b$ expansion ($b\geq 2$) of all real numbers whose irrationality exponent is equal to 2. This provides a generalization of a theorem due to Ferenczi and Mauduit. As a…
It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…
We consider the stable matching problem when the preference lists are not given explicitly but are represented in a succinct way and ask whether the problem becomes computationally easier and investigate other implications. We give…
We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely long overlap-free words that consist of a concatenation of…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…
A tower is a sequence of words alternating between two languages in such a way that every word is a subsequence of the following word. The height of the tower is the number of words in the sequence. If there is no infinite tower (a tower of…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
We establish an upper bound of the bottom of the essential spectrum for the generator associated with a regular Dirichlet form in terms of the rates of the volume growth/decay and big jump. Using this bound, we discuss how the bottom of the…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…
An overlap-free (or $\beta$-free) word $w$ over a fixed alphabet $\Sigma$ is extremal if every word obtained from $w$ by inserting a single letter from $\Sigma$ at any position contains an overlap (or a factor of exponent at least $\beta$,…
Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…
Given two random finite sequences from $[k]^n$ such that a prefix of the first sequence is a suffix of the second, we examine the length of their longest common subsequence. If $\ell$ is the length of the overlap, we prove that the expected…
We study regular expression membership testing: Given a regular expression of size $m$ and a string of size $n$, decide whether the string is in the language described by the regular expression. Its classic $O(nm)$ algorithm is one of the…
Large Language Models increasingly rely on self-explanations, such as chain of thought reasoning, to improve performance on multi step question answering. While these explanations enhance accuracy, they are often verbose and costly to…