Related papers: Plans on measures and AM-modulus
We show that in many parametrized families of self-similar measures, their projections, and their convolutions, the set of parameters for which the measure fails to be absolutely continuous is very small - of co-dimension at least one in…
The aim of this article is to show that p-adic geometry of modular curves is useful in the study of p-adic properties of traces of singular moduli. In order to do so, we partly answer a question by Ono. As our goal is just to illustrate how…
In recent studies, Bibiloni-Femenias, Mi\~{n}ana and Valero characterized the functions that aggregate a family of (quasi-)(pseudo)metric modulars defined over a fixed set $X$ into a single one. In this paper, we adopt a related but…
We consider the class of ring $Q$-homeomorphisms with respect to $p$-modulus in $\mathbb{R}^{n}$ with $p > n$, and obtain lower bounds for limsups of the distance distortions under such mappings. These estimates can be treated as…
We present a quantitative measure of physical complexity, based on the amount of information required to build a given physical structure through self-assembly. Our procedure can be adapted to any given geometry, and thus to any given type…
Let $p\in (1,\infty)$. In this paper, for any given measurable function $u:\ \mathbb{R}\rightarrow \mathbb{R}$ and a generalized plane curve $\gamma$ satisfying some conditions, the $L^p(\mathbb{R}^2)$ boundedness of the Hilbert transform…
Let $(X,d)$ be a compact metric space, and let an iterated function system (IFS) be given on $X$, i.e., a finite set of continuous maps $\sigma_{i}$: $ X\to X$, $i=0,1,..., N-1$. The maps $\sigma_{i}$ transform the measures $\mu $ on $X$…
Mutually Unbiased bases has various application in quantum information procession and coding theory. There can be maximum d + 1 MUBs in C^d and d/2 +1 MUBs in R^d. But , over R^d MUBs are known to be non existent when d is odd and for most…
In our previous paper [GSV2020], we proved that the complementary components of a ring domain in $\mathbb{R}^n$ with large enough modulus may be separated by an annular ring domain and applied this result to boundary correspondence problems…
In the Constraint Satisfaction Problem (CSP for short) the goal is to decide the existence of a homomorphism from a given relational structure $G$ to a given relational structure $H$. If the structure $H$ is fixed and $G$ is the only input,…
The first author introduced a measure of compactness for families of sets, relative to a class of filters, in the context of convergence approach spaces. We characterize a variety of maps (types of quotient maps, closed maps, and variants…
Effective resource utilisation monitoring and highly granular yet adaptive measurements are prerequisites for a more efficient Grid scheduler. We present a suite of measurement applications able to monitor per-process resource utilisation,…
Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a…
In this paper, we explore the concept of modularity in first-order answer set programming (ASP). We introduce a new formalism called parametric modular logic programs, which allows defining subprograms with parameters and intensionality…
We establish a general superposition principle for curves of measures solving a continuity equation on metric spaces without any smooth structure nor underlying measure, representing them as marginals of measures concentrated on the…
In this note, we give a nature action of the modular group on the ends of the infinite (p + 1)-cayley tree, for each prime p. We show that there is a unique invariant probability measure for each p.
The concept of measurability of functions on a charge space is generalised for functions taking values in a uniform space. Several existing forms of measurability generalise naturally in this context, and new forms of measurability are…
System modeling is a classical approach to ensure their reliability since it is suitable both for a formal verification and for software testing techniques. In the context of model-based testing an approach combining random testing and…
The Minimal Model Program offers natural higher-dimensional analogues of stable $n$-pointed curves and maps: stable pairs consisting of a projective variety $X$ of dimension $\ge2$ and a divisor $B$, that should satisfy a few simple…
Cutting planes for mixed-integer linear programs (MILPs) are typically computed in rounds by iteratively solving optimization problems, the so-called separation. Instead, we reframe the problem of finding good cutting planes as a continuous…