On the operations of sequences in rings and binomial type sequences

Given a commutative ring with identity R, many different and interesting operations can be defined over the set \(H_R\) of sequences of elements in R. These operations can also give \(H_R\) the structure of a ring. We study some of these operations, focusing on the binomial convolution product and the operation induced by the composition of exponential generating functions. We provide new relations between these operations and their invertible elements. We also study automorphisms of the Hurwitz series ring, highlighting that some well-known transforms of sequences (such as the Stirling transform) are special cases of these automorphisms. Moreover, we introduce a novel isomorphism between \(H_R\) equipped with the componentwise sum and the set of the sequences starting with 1 equipped with the binomial convolution product. Finally, thanks to this isomorphism, we find a new method for characterizing and generating all the binomial type sequences.

     

Construction of a singular elliptic-harmonic measure

The authors study an example, suggested by E. De Giorgi, of a second-order uniformly elliptic partial differential operator in divergence form with continuous coefficients on a smooth domain in the plane such that the associated harmonic measure on the boundary is not absolutely continuous with respect to the ordinary surface measure.     

Soft Constraint Logic Programming and Generalized Shortest Path Problems

In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft Constraint Logic Programming (SCLP) framework, where logic programming is coupled with soft constraints. In this way we provide this large class of SP problems with a high-level and declarative linguistic support whose semantics takes care of both finding the cost of the shortest path(s) and also of actually finding the path(s). On the other hand, some efficient algorithms for certain classes of SP problems can be exploited to provide some classes of SCLP programs with an efficient way to compute their semantics.     

An approximation result for the interval coloring problem on claw-free chordal graphs

We study the problem of finding an acyclic orientation of an undirected graph, such that each (oriented) path is covered by a limited number k of maximal cliques. This is equivalent to finding a k-approximate solution for the interval coloring problem on a graph. We focus our attention on claw-free chordal graphs, and show how to find an orientation of such a graph in linear time, which guarantees that each path is covered by at most two maximal cliques. This extends previous published results on other graph classes where stronger assumptions were made.     

Effectivity Functions and Stable Governance Structures

Stability properties of several governance structures are studied by means of their effectivity functions. It is shown that (strong) stability of a governance structure is mainly determined by the collegial nature of the underlying assembly's decision rule.     

Weakly Admissible Meshes and Discrete Extremal Sets

We present a brief survey on (Weakly) Admissible Meshes and corresponding Discrete Extremal Sets, namely Approximate Fekete Points and Discrete Leja Points. These provide new computational tools for polynomial least squares and interpolation on multidimensional compact sets, with different applications such as numerical cubature, digital filtering, spectral and high-order methods for PDEs.     

Derivative-free methods for mixed-integer nonsmooth constrained optimization

Computational Optimization and Applications - In this paper, mixed-integer nonsmooth constrained optimization problems are considered, where objective/constraint functions are available only as the...     

Nonequilibrium invariant measure under heat flow

We provide an explicit representation of the nonequilibrium invariant measure for a chain of harmonic oscillators with conservative noise in the presence of stationary heat flow. By first determining the covariance matrix, we are able to express the measure as the product of Gaussian distributions aligned along some collective modes that are spatially localized with power-law tails. Numerical studies show that such a representation applies also to a purely deterministic model, the quartic Fermi-Pasta-Ulam chain.     

Surface morphology and composition of c-, a- and m-sapphire surfaces in O2 and H2 environments

This paper reports that monitoring the composition of the c(0 0 0 1), a(11–20) and m(10–10) sapphire surfaces is essential for a proper interpretation of the surface morphologies obtained after annealing at 1253 and 1473 K in ArH₂ or ArO₂ atmospheres. Our experimental investigations, which have used Auger electron spectroscopy (AES) and atomic force microscopy (AFM) on the surfaces of 99.99% pure sapphire wafers, have led to the following original conclusions: (i) Calcium segregates at the c-surface of sapphire both under ArO₂ and ArH₂. (ii) Potassium adsorption enhances the kinetics of step-bunching on the c-surface under ArO₂. (iii) The step edges on the a-surface may develop a comb-like morphology made of parallel strips along the [10–10] direction. (iv) At 1253 K, clean m-surfaces may be stable. (v) Under ArH₂, alumina surface diffusion is much slower than under ArO₂ for all surface orientations, the surface concentration of impurities is low, and the Al–O ratio of the AES signals at the surface is significantly larger.