Search results for "Discrete Mathematics"

Monotonicity-based inversion of the fractional Schr\"odinger equation II. General potentials and stability

2019

In this work, we use monotonicity-based methods for the fractional Schr\"odinger equation with general potentials $q\in L^\infty(\Omega)$ in a Lipschitz bounded open set $\Omega\subset \mathbb R^n$ in any dimension $n\in \mathbb N$. We demonstrate that if-and-only-if monotonicity relations between potentials and the Dirichlet-to-Neumann map hold up to a finite dimensional subspace. Based on these if-and-only-if monotonicity relations, we derive a constructive global uniqueness results for the fractional Calder\'on problem and its linearized version. We also derive a reconstruction method for unknown obstacles in a given domain that only requires the background solution of the fractional Sch…

Coincidence problems for generalized contractions

2014

In this paper, we establish some new existence, uniqueness and Ulam-Hyers stability theorems for coincidence problems for two single-valued mappings. The main results of this paper extend the results presented in O. Mle?ni?e: Existence and Ulam-Hyers stability results for coincidence problems, J. Non-linear Sci. Appl., 6(2013), 108-116. In the last section two examples of application of these results are also given.

A Sokoban-type game and arc deletion within irregular digraphs of all sizes

2007

Continuous images of arcs: Extensions of Cornette's Theorem

2015

In [J.L. Cornette “Image of a Hausdorff arc” is cyclically extensible and reducible Trans. Am. Math. Soc., 199 (1974), pp. 253–267], Cornette proved that a locally connected Hausdorff continuum X is the continuous image of an arc if and only if each of its cyclic elements is the continuous image of an arc. Cyclic elements form a closed null cover of X by retracts of X. We generalize Cornette's result to closed null covers of X with a dendritic structure. We give examples to show that some of our conditions are necessary and we pose some open questions.

A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY

2013

Motivated by the extension of the critical factorization theorem to infinite words, we study the (local) periodicity function, i.e. the function that, for any position in a word, gives the size of the shortest square centered in that position. We prove that this function characterizes any binary word up to exchange of letters. We then introduce a new complexity function for words (the periodicity complexity) that, for any position in the word, gives the average value of the periodicity function up to that position. The new complexity function is independent from the other commonly used complexity measures as, for instance, the factor complexity. Indeed, whereas any infinite word with bound…

Representable and Continuous Functionals on Banach Quasi *-Algebras

2017

In the study of locally convex quasi *-algebras an important role is played by representable linear functionals; i.e., functionals which allow a GNS-construction. This paper is mainly devoted to the study of the continuity of representable functionals in Banach and Hilbert quasi *-algebras. Some other concepts related to representable functionals (full-representability, *-semisimplicity, etc) are revisited in these special cases. In particular, in the case of Hilbert quasi *-algebras, which are shown to be fully representable, the existence of a 1-1 correspondence between positive, bounded elements (defined in an appropriate way) and continuous representable functionals is proved.

Chiral/Achiral Copolymers of Biphenylylacetylenes Bearing Various Substituents: Chiral Amplification through Copolymerization, Followed by Enhancemen…

2020

A series of dynamic helical homo- and copolymers of chiral and/or achiral biphenylylacetylenes (PBPAs) bearing achiral methoxymethoxy or acetyloxy groups at the 2,2′-positions along with a chiral o...

On the lattice of prefix codes

2002

AbstractThe natural correspondence between prefix codes and trees is explored, generalizing the results obtained in Giammarresi et al. (Theoret. Comput. Sci. 205 (1998) 1459) for the lattice of finite trees under division and the lattice of finite maximal prefix codes. Joins and meets of prefix codes are studied in this light in connection with such concepts as finiteness, maximality and varieties of rational languages. Decidability results are obtained for several problems involving rational prefix codes, including the solution to the primeness problem.

On the decomposition of prefix codes

2017

Abstract In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.

Uniqueness of diffusion on domains with rough boundaries

2016

Let $\Omega$ be a domain in $\mathbf R^d$ and $h(\varphi)=\sum^d_{k,l=1}(\partial_k\varphi, c_{kl}\partial_l\varphi)$ a quadratic form on $L_2(\Omega)$ with domain $C_c^\infty(\Omega)$ where the $c_{kl}$ are real symmetric $L_\infty(\Omega)$-functions with $C(x)=(c_{kl}(x))>0$ for almost all $x\in \Omega$. Further assume there are $a, \delta>0$ such that $a^{-1}d_\Gamma^{\delta}\,I\le C\le a\,d_\Gamma^{\delta}\,I$ for $d_\Gamma\le 1$ where $d_\Gamma$ is the Euclidean distance to the boundary $\Gamma$ of $\Omega$. We assume that $\Gamma$ is Ahlfors $s$-regular and if $s$, the Hausdorff dimension of $\Gamma$, is larger or equal to $d-1$ we also assume a mild uniformity property for $\Omega$ i…