Properties of In2S3 thin films deposited onto ITO/glass substrates by chemical bath deposition

In₂S₃ films have been chemically deposited on ITO coated glass substrates by chemical bath deposition, using different deposition times and precursor concentrations. The bilayers are intended for photovoltaic applications. Different characterization methods have been employed: optical properties of the films were investigated from transmittance measurements, structural properties by XRD and micro-Raman, and surface morphology by SEM microscopy analysis. Also, the direct and indirect band-gaps and the surface gap states were studied with surface photovoltage spectroscopy (SPS). We proposed that electronic properties of the In₂S₃ samples are controlled by two features: shallow tail states and a broad band centred at 1.5 eV approximately. Their relation with the structure is discussed, suggesting that their origin is related to defects created on the S sub-lattice, and then both defects are intrinsic to the material.     

Embedding some Riemann surfaces into $${\mathbb {C}^2}$$ with interpolation

We prove that several types of open Riemann surfaces, including the finitely connected planar domains, embed properly into such that the values on any given discrete sequence can be arbitrarily prescribed. Kutzschebauch supported by Schweizerische Nationalfonds grant 200021-107477/1.     

Constrained optimization of the randomized iterative method

Selection of conditionally optimal parameters of the randomized iterative method for solving large-scale linear systems of equations is considered. The error of this method is analyzed by analogy with the functional Monte Carlo algorithms. For the simple iteration method, the “column” randomization of the matrix is thoroughly analyzed.     

Approximating the maximum 2- and 3-edge-colorable subgraph problems

For a fixed value of a parameter k≥2, the Maximum k-Edge-Colorable Subgraph Problem consists in finding k edge-disjoint matchings in a simple graph, with the goal of maximising the total number of edges used. The problem is known to be -hard for all k, but there exist polynomial time approximation algorithms with approximation ratios tending to 1 as k tends to infinity. Herein we propose improved approximation algorithms for the cases of k=2 and k=3, having approximation ratios of 5/6 and 4/5, respectively.     

On the complexity of some subgraph problems

We study the complexity of the problem of deciding the existence of a spanning subgraph of a given graph, and of that of finding a maximum (weight) such subgraph. We establish some general relations between these problems, and we use these relations to obtain new NP-completeness results for maximum (weight) spanning subgraph problems from analogous results for existence problems and from results in extremal graph theory. On the positive side, we provide a decomposition method for the maximum (weight) spanning chordal subgraph problem that can be used, e.g., to obtain a linear (or O(nlogn)) time algorithm for such problems in graphs with vertex degree bounded by 3.     

On the global existence and finite time blow-up of shadow systems

Shadow systems are often used to approximate reaction-diffusion systems when one of the diffusion rates is large. In this paper, we study the global existence and blow-up phenomena for shadow systems. Our results show that even for these fundamental aspects, there are serious discrepancies between the dynamics of the reaction-diffusion systems and that of their corresponding shadow systems.     

Uniqueness results for nonlocal Hamilton-Jacobi equations

We are interested in nonlocal eikonal equations describing the evolution of interfaces moving with a nonlocal, non-monotone velocity. For these equations, only the existence of global-in-time weak solutions is available in some particular cases. In this paper, we propose a new approach for proving uniqueness of the solution when the front is expanding. This approach simplifies and extends existing results for dislocation dynamics. It also provides the first uniqueness result for a Fitzhugh-Nagumo system. The key ingredients are some new perimeter estimates for the evolving fronts as well as some uniform interior cone property for these fronts.     

A note on non-reduced Picard schemes

The Picard scheme of a smooth curve and a smooth complex variety is reduced. In this note we discuss which classes of surfaces in terms of the Enriques-Kodaira classification can have non-reduced Picard schemes and whether there are restrictions on the characteristic of the ground field. It turns out that non-reduced Picard schemes are uncommon in Kodaira dimension κ≤0, that this phenomenon can be bounded for κ=2 (general type) and that it is as bad as can be for κ=1.     

Multiplicity-free representations of symmetric groups

Building on work of Saxl, we classify the multiplicity-free permutation characters of all symmetric groups of degree 66 or more. A corollary is a complete list of the irreducible characters of symmetric groups (again of degree 66 or more) which may appear in a multiplicity-free permutation representation. The multiplicity-free characters in a related family of monomial characters are also classified. We end by investigating a consequence of these results for Specht filtrations of permutation modules defined over fields of prime characteristic.     

On the multiplicity and the Cohen-Macaulayness of fiber cones of graded algebras

Let A be a Noetherian local ring with the maximal ideal m and an m-primary ideal J. Let S=?_n≥0S_n be a finitely generated standard graded algebra over A. Set S⁺=?_n>0S_n. Denote by F_J(S)=?_n≥0→(S_n/JS_n) the fiber cone of S with respect to J. The paper characterizes the multiplicity and the Cohen-Macaulayness of F_J(S) in terms of minimal reductions of S⁺.