On the Similarity of Sturm–Liouville Operators with Non-Hermitian Boundary Conditions to Self-Adjoint and Normal Operators

We consider one-dimensional Schrödinger-type operators in a bounded interval with non-self-adjoint Robin-type boundary conditions. It is well known that such operators are generically conjugate to normal operators via a similarity transformation. Motivated by recent interests in quasi-Hermitian Hamiltonians in quantum mechanics, we study properties of the transformations and similar operators in detail. In the case of parity and time reversal boundary conditions, we establish closed integral-type formulae for the similarity transformations, derive a non-local self-adjoint operator similar to the Schrödinger operator and also find the associated “charge conjugation” operator, which plays the role of fundamental symmetry in a Krein-space reformulation of the problem.     

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs.     

Asymptotically optimal neighbour sum distinguishing colourings of graphs

Consider a simple graph G = (V,E) and its proper edge colouring c with the elements of the set {1,2,…,k}. The colouring c is said to be neighbour sum distinguishing if for every pair of vertices u, v adjacent in G, the sum of colours of the edges incident with u is distinct from the corresponding sum for v. The smallest integer k for which such colouring exists is known as the neighbour sum distinguishing index of a graph and denoted by . The definition of this parameter, which makes sense for graphs containing no isolated edges, immediately implies that , where Δ is the maximum degree of G. On the other hand, it was conjectured by Flandrin et al. that for all those graphs, except for C₅. We prove this bound to be asymptotically correct by showing that . The main idea of our argument relays on a random assignment of the colours, where the choice for every edge is biased by so called attractors, randomly assigned to the vertices. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 776–791, 2015     

Assessing Similarity of Random sets via Skeletons

Methodology and Computing in Applied Probability - The paper concerns a method for assessing similarity of realisations of random sets based on a construction of their morphological skeletons and a...     

Solvability of the power flow problem in DC overhead wire circuit modeling

Applications of Mathematics - Proper traffic simulation of electric vehicles, which draw energy from overhead wires, requires adequate modeling of traction infrastructure. Such vehicles include...     

Estimation error for occupation time functionals of stationary Markov processes

The approximation of integral functionals with respect to a stationary Markov process by a Riemann sum estimator is studied. Stationarity and the functional calculus of the infinitesimal generator of the process are used to explicitly calculate the estimation error and to prove a general finite sample error bound. The presented approach admits general integrands and gives a unifying explanation for different rates obtained in the literature. Several examples demonstrate how the general bound can be related to well-known function spaces.     

The lattice of congruence lattices of algebras on a finite set

The congruence lattices of all algebras defined on a fixed finite set A ordered by inclusion form a finite atomistic lattice \(\mathcal {E}\). We describe the atoms and coatoms. Each meet-irreducible element of \(\mathcal {E}\) being determined by a single unary mapping on A, we characterize completely those which are determined by a permutation or by an acyclic mapping on the set A. Using these characterisations we deduce several properties of the lattice \(\mathcal {E}\); in particular, we prove that \(\mathcal {E}\) is tolerance-simple whenever \(|A|\ge 4\).     

The lattice of convexities of partial monounary algebras

A class of partial monounary algebras is called a convexity if it is closed under homomorphic images, direct products and convex relative subalgebras. We prove that the collection of all convexities of partial monounary algebras forms a countable set. Further, each convexity can be generated by at most two algebras.     

On Orthogonally σ-Complete Lattice Ordered Groups

In this paper we prove a theorem of Cantor-Bernstein type for orthogonally -complete lattice ordered groups.     

The Lattice of Compatible Quasiorders of Acyclic Monounary Algebras

Acyclic monounary algebras are characterized by the property that any compatible partial order r can be extended to a compatible linear order. In the case of rooted monounary algebras A=(A,f){\cal A}=(A,f) we characterize the intersection of compatible linear extensions of r by several equivalent conditions and generalize these results to compatible quasiorders of A{\cal A}. We show that the lattice QuordA{\rm{Quord}}{\cal A} of compatible quasiorders is a disjoint union of semi-intervals whose maximal elements equal the intersection of their compatible quasilinear extensions. We also investigate algebraic properties of the lattices QuordA{\rm{Quord}}{\cal A} and ConA{\rm{Con}}{\cal A}.