Search results for "App"

Inverse problems for $p$-Laplace type equations under monotonicity assumptions

2016

We consider inverse problems for $p$-Laplace type equations under monotonicity assumptions. In two dimensions, we show that any two conductivities satisfying $\sigma_1 \geq \sigma_2$ and having the same nonlinear Dirichlet-to-Neumann map must be identical. The proof is based on a monotonicity inequality and the unique continuation principle for $p$-Laplace type equations. In higher dimensions, where unique continuation is not known, we obtain a similar result for conductivities close to constant.

Efficient generation of restricted growth words

2013

A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i>1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.

Filament sets and decompositions of homogeneous continua

2007

Abstract This paper applies the concepts introduced in the article: Filament sets and homogeneous continua [J.R. Prajs, K. Whittington, Filament sets and homogeneous continua, Topology Appl. 154 (8) (2007) 1581–1591, doi:10.1016/j.topol.2006.12.005 ] to decompositions of homogeneous continua. Several new or strengthened results on aposyndesis are given. Newly defined decompositions are discussed. A proposed classification scheme for homogeneous continua is shown to be mostly invariant under Jones' aposyndetic decomposition.

Constant sign and nodal solutions for nonlinear robin equations with locally defined source term

2020

We consider a parametric Robin problem driven by a nonlinear, nonhomogeneous differential operator which includes as special cases the p-Laplacian and the (p,q)-Laplacian. The source term is parametric and only locally defined (that is, in a neighborhood of zero). Using suitable cut-off techniques together with variational tools and comparison principles, we show that for all big values of the parameter, the problem has at least three nontrivial smooth solutions, all with sign information (positive, negative and nodal).

Multiple Solutions for Fractional Boundary Value Problems

2018

Variational methods and critical point theorems are used to discuss existence and multiplicity of solutions for fractional boundary value problem where Riemann–Liouville fractional derivatives and Caputo fractional derivatives are used. Some conditions to determinate nonnegative solutions are presented. An example is given to illustrate our results.

Removing the saturation assumption in Bank-Weiser error estimator analysis in dimension three

2020

International audience; We provide a new argument proving the reliability of the Bank-Weiser estimator for Lagrange piecewise linear finite elements in both dimension two and three. The extension to dimension three constitutes the main novelty of our study. In addition, we present a numerical comparison of the Bank-Weiser and residual estimators for a three-dimensional test case.

Permutation invariant functionals of Lévy processes

2017

Adjacency matrices of random digraphs: singularity and anti-concentration

2017

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability at least $1-C\ln^{3} d/\sqrt{d}$ for $C\leq d\leq cn/\ln^2 n$, where $c, C$ are positive absolute constants. To this end, we establish a few properties of $d$-regular directed graphs. One of them, a Littlewood-Offord type anti-concentration property, is of independent interest. Let $J$ be a subset of vertices of $G$ with $|J|\approx n/d$. Let $\delta_i$ be the indicator of the event that the vertex $i$ is connected to $J$ and define $\delta = (\delta_1, …

Restricted compositions and permutations: from old to new Gray codes

2011

Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…

Statistics-preserving bijections between classical and cyclic permutations

2012

Recently, Elizalde (2011) [2] has presented a bijection between the set C"n"+"1 of cyclic permutations on {1,2,...,n+1} and the set of permutations on {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. In this paper, we construct a bijection from C"n"+"1 to S"n that preserves the weak excedance set and that transfers quasi-fixed points into fixed points and left-to-right maxima into themselves. This induces a bijection from the set D"n of derangements to the set C"n"+"1^q of cycles without quasi-fixed points that preserves the weak excedance set. Moreover, we exhibit a kind of discrete continuity between C"n"+"1 and S"n that preserves at each s…