Zobrazeno 1 - 10
of 197
pro vyhledávání: '"Kosche, P"'
Autor:
Ammari, Habib, Kosche, Thea
In this paper, we consider the resonance problem for the cubic nonlinear Helmholtz equation in the subwavelength regime. We derive a discrete model for approximating the subwavelength resonances of finite systems of high-contrast resonators with Kerr
Externí odkaz:
http://arxiv.org/abs/2410.21173
Autor:
Ammari, Habib, Barandun, Silvio, Davies, Bryn, Hiltunen, Erik Orvehed, Kosche, Thea, Liu, Ping
This paper studies wave localisation in chains of finitely many resonators. There is an extensive theory predicting the existence of localised modes induced by defects in infinitely periodic systems. This work extends these principles to finite-sized
Externí odkaz:
http://arxiv.org/abs/2312.09667
The aim of this article is to advance the field of metamaterials by proposing formulas for the design of high-contrast metamaterials with prescribed subwavelength defect mode eigenfrequencies. This is achieved in two settings: (i) design of non-hermi
Externí odkaz:
http://arxiv.org/abs/2305.11670
We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the distance (i. e., the gap) between two consecutive symbols of the subseq
Externí odkaz:
http://arxiv.org/abs/2304.05270
Autor:
Ammari, Habib, Kosche, Thea
We dedicate this paper to the topological analysis of subwavelength solutions in Floquet metamaterials. This work should be considered as a basis for further investigation on whether topological properties of the bulk materials are linked to the occu
Externí odkaz:
http://arxiv.org/abs/2209.03782
In this paper we provide an overview of a series of recent results regarding algorithms for searching for subsequences in words or for the analysis of the sets of subsequences occurring in a word.
Comment: This is a revised version of the paper
Comment: This is a revised version of the paper
Externí odkaz:
http://arxiv.org/abs/2208.14722
In this paper, we consider a variant of the classical algorithmic problem of checking whether a given word $v$ is a subsequence of another word $w$. More precisely, we consider the problem of deciding, given a number $p$ (defining a range-bound) and
Externí odkaz:
http://arxiv.org/abs/2207.09201
We consider subsequences with gap constraints, i.e., length-k subsequences p that can be embedded into a string w such that the induced gaps (i.e., the factors of w between the positions to which p is mapped to) satisfy given gap constraints $gc = (C
Externí odkaz:
http://arxiv.org/abs/2206.13896
Our aim in this paper is twofold. Firstly, we develop a new asymptotic theory for Floquet exponents. We consider a linear system of differential equations with a time-periodic coefficient matrix. Assuming that the coefficient matrix depends analytica
Externí odkaz:
http://arxiv.org/abs/2110.08156
Publikováno v:
Fundamenta Informaticae, Volume 189, Issues 3-4: Reachability Problems 2020 and 2021 (October 14, 2023) fi:9221
An absent factor of a string $w$ is a string $u$ which does not occur as a contiguous substring (a.k.a. factor) inside $w$. We extend this well-studied notion and define absent subsequences: a string $u$ is an absent subsequence of a string $w$ if $u
Externí odkaz:
http://arxiv.org/abs/2108.13968