Corrigendum on Wiener index, Zagreb Indices and Harary index of Eulerian graphs

In the original article ``Wiener index of Eulerian graphs'' [Discrete Applied Mathematics Volume 162, 10 January 2014, Pages 247-250], the authors state that the Wiener index (total distance) of an Eulerian graph is maximized by the cycle. We explain that the initial proof contains a flaw and note that it is a corollary of a result by Plesn\'ik, since an Eulerian graph is $2$-edge-connected. The same incorrect proof is used in two referencing papers, ``Zagreb Indices and Multiplicative Zagreb Indices of Eulerian Graphs'' [Bull. Malays. Math. Sci. Soc. (2019) 42:67-78] and ``Harary index of Eulerian graphs'' [J. Math. Chem., 59(5):1378-1394, 2021]. We give proofs of the main results of those papers and the $2$-edge-connected analogues.Comment: 5 Pages, 1 Figure Corrigendum of 3 papers, whose titles are combine

Numerical homotopies to compute generic points on positive dimensional algebraic sets

Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A procedure of A. Sommese and C. Wampler consists in slicing the components with linear subspaces in general position to obtain generic points of the components as the isolated solutions of an auxiliary system. Since this requires the solution of a number of larger overdetermined systems, the procedure is computationally expensive and also wasteful because many solution paths diverge. In this article an embedding of the original polynomial system is presented, which leads to a sequence of homotopies, with solution paths leading to generic points of all components as the isolated solutions of an auxiliary system. The new procedure significantly reduces the number of paths to solutions that need to be followed. This approach has been implemented and applied to various polynomial systems, such as the cyclic n-roots problem

A Bound for the Eigenvalue Counting Function for Higher-Order Krein Laplacians on Open Sets

For an arbitrary nonempty, open set $\Omega \subset \mathbb{R}^n$, $n \in \mathbb{N}$, of finite (Euclidean) volume, we consider the minimally defined higher-order Laplacian $(- \Delta)^m\big|_{C_0^{\infty}(\Omega)}$, $m \in \mathbb{N}$, and its Krein--von Neumann extension $A_{K,\Omega,m}$ in $L^2(\Omega)$. With $N(\lambda,A_{K,\Omega,m})$, $\lambda > 0$, denoting the eigenvalue counting function corresponding to the strictly positive eigenvalues of $A_{K,\Omega,m}$, we derive the bound $$N(\lambda,A_{K,\Omega,m}) \leq (2 \pi)^{-n} v_n |\Omega| \{1 + [2m/(2m+n)]\}^{n/(2m)} \lambda^{n/(2m)}, \quad \lambda > 0,$$ where $v_n := \pi^{n/2}/\Gamma((n+2)/2)$ denotes the (Euclidean) volume of the unit ball in $\mathbb{R}^n$. The proof relies on variational considerations and exploits the fundamental link between the Krein--von Neumann extension and an underlying (abstract) buckling problem.Comment: 22 pages. Considerable improvements mad

Byzantine Approximate Agreement on Graphs

Consider a distributed system with n processors out of which f can be Byzantine faulty. In the approximate agreement task, each processor i receives an input value x_i and has to decide on an output value y_i such that 1) the output values are in the convex hull of the non-faulty processors\u27 input values, 2) the output values are within distance d of each other. Classically, the values are assumed to be from an m-dimensional Euclidean space, where m >= 1. In this work, we study the task in a discrete setting, where input values with some structure expressible as a graph. Namely, the input values are vertices of a finite graph G and the goal is to output vertices that are within distance d of each other in G, but still remain in the graph-induced convex hull of the input values. For d=0, the task reduces to consensus and cannot be solved with a deterministic algorithm in an asynchronous system even with a single crash fault. For any d >= 1, we show that the task is solvable in asynchronous systems when G is chordal and n > (omega+1)f, where omega is the clique number of G. In addition, we give the first Byzantine-tolerant algorithm for a variant of lattice agreement. For synchronous systems, we show tight resilience bounds for the exact variants of these and related tasks over a large class of combinatorial structures