Related papers: Self similar sets, entropy and additive combinator…
A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…
The class of the hypercomplex pseudo-Hermitian manifolds is considered. The flatness of the considered manifolds with the 3 parallel complex structures is proved. Conformal transformations of the metrics are introduced. The conformal…
We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…
A cyclic proof system generalises the standard notion of a proof as a finite tree of locally sound inferences by allowing proof objects to be potentially infinite. Regular infinite proofs can be finitely represented as graphs. To preclude…
We state and prove a combination theorem for relatively hyperbolic groups seen as geometrically finite convergence groups. For that, we explain how to contruct a boundary for a group that is an acylindrical amalgamation of relatively…
We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…
Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…
Entanglement entropies have revealed, in the last years, to be a powerful tool to extract information about the physics of condensed-matter systems. In the first part of this thesis, we show how to extract essential details about the…
Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this…
To every minimal model of a complete local isolated cDV singularity Donovan--Wemyss associate a finite dimensional symmetric algebra known as the contraction algebra. We construct the first known standard derived equivalences between these…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…
We present a classification of the so-called "additive symmetric 2-cocycles" of arbitrary degree and dimension over Z/p, along with a partial result and some conjectures for m-cocycles over Z/p, m > 2. This expands greatly on a result…
Asymptotic methods for hypothesis testing in high-dimensional data usually require the dimension of the observations to increase to infinity, often with an additional condition on its rate of increase compared to the sample size. On the…
High-order phenomena play crucial roles in many systems of interest, but their analysis is often highly nontrivial. There is a rich literature providing a number of alternative information-theoretic quantities capturing high-order…
We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…
We investigate the box dimensions of inhomogeneous self-similar sets. Firstly, we extend some results of Olsen and Snigireva by computing the upper box dimensions assuming some mild separation conditions. Secondly, we investigate the more…
In these Lectures, we present a pedagogical introduction to weak scale supersymmetry phenomenology. A basic understanding of the Standard Model and of the ideas behind Grand Unification, but no prior knowledge of supersymmetry, is assumed.…
We prove the automorphism conjecture for ordered sets of width less than or equal to 11. The proof supports the meta conjecture that a large number of automorphisms is achievable only as some type of product of independent automorphisms on…
In this paper, we provide an algorithm to estimate from below the dimension of self-similar measures with overlaps. As an application, we show that for any $ \beta\in(1,2) $, the dimension of the Bernoulli convolution $ \mu_\beta $…