Results 61 to 70 of about 330 (211)
Inverse problems for semilinear elliptic PDE with a general nonlinearity a(x,u)$a(x,u)$
Abstract This article studies the inverse problem of recovering a nonlinearity in an elliptic equation Δu+a(x,u)=0$\Delta u + a(x,u) = 0$ from boundary measurements of solutions. Previous results based on first‐order linearization achieve this under a sign condition on ∂ua(x,u)$\partial _u a(x,u)$, and results based on higher order linearization ...
David Johansson +2 more
wiley +1 more source
Finding vertex-surjective graph homomorphisms [PDF]
The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can be formulated in terms of spanning subgraphs and subgraphs, and as such their computational complexity has been ...
Petr A. Golovach +3 more
openaire +6 more sources
Context‐free graphs and their transition groups
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
Abelian number fields with frobenian conditions
Abstract We study the distribution of abelian number fields with frobenian conditions imposed on the conductor. In particular, we find an asymptotic for the number of abelian field extensions of a number field k$k$ whose conductor is the sum of two squares. We also discuss an application of the Brauer group of stacks to quadratic number fields.
Julie Tavernier
wiley +1 more source
Let ZN ,γ = 1. In [41], the authors classified countably Dirichlet subsets. We show that |Ψ| < √ 2. It is not yet known whether ˜κ is smooth and extrinsic, although [41] does address the issue of ellipticity. In [10, 42], the main result was the classification of hulls.
openaire +2 more sources
Colourings of Uniform Group Divisible Designs and Maximum Packings
ABSTRACT A weak c‐colouring of a design is an assignment of colours to its points from a set of c available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
In this paper the Smith normal form of certain matrices is used to provide another char acterization for the surjectivity of one-dimensional linear cellular automata with multiple local rules over the ring ZN of integers modulo N = 2..
Ignacia Arcaya, Neptalí Romero
doaj
Epimorphisms of C*-algebras are surjective
2 ...
Hofmann, Karl Heinrich, Neeb, K.-H.
openaire +3 more sources
Grammatical structures in mathematics: a personal view
Abstract The ability to read, write, and speak mathematics is critical to students becoming comfortable with statistical models and skills. Faster development of those skills may act as encouragement to further engage with the discipline. Vocabulary has been the focus of scholarship in existing literature on the linguistics of mathematics and ...
Tess O'Brien
wiley +1 more source
On the Scottish Book Problem 155 by Mazur and Sternbach
Problem 155 of the Scottish Book asks whether every bijection $U\colon X\rightarrow Y$ between two Banach spaces $X, Y$ with the property that, each point of $X$ has a neighborhood on which $U$ is isometric, is globally isometric on $X$.
Mori, Michiya
doaj +1 more source

