1 citations · 1 across the 7 of their papers we have counts for
8 papers
Generalization of Menger's Edge Theorem to Four Vertices
Avraham Goldstein
Menger's Edge Theorem asserts that there exist pairwise edge-disjoint paths between two vertices in an undirected graph if and only if a deletion of any or less edges doe…
Plaque Inverse Limit of a Dynamical System - Dynamics, Signatures and Local Topology
Avraham Goldstein
The Plaque Inverse Limit of a branched covering self-map of a Riemann surface was introduced and studied in \cite{CCG}. A point of P.I.L. was called regular if P.I.L. has the n…
Enumeration of balanced finite group valued functions on directed graphs
Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit +1
A group valued function on a graph is called balanced if the product of its values along any cycle is equal to the identity element of the group. We compute the number of balanced…
Hultman Numbers and Generalized Commuting Probability in Finite Groups
Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit +1
Let be a finite group and be a permutation from . We investigate the distribution of the probabilities of the equality \[ a_{1}a_{2}\cdots a_{n-1}a_{n}=a_{π_{1}}a_{π…
Balanced Abelian group valued functions on directed graphs
Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit
We discuss functions from the edges and vertices of a directed graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced…
Structure of the Group of Balanced Labelings on Graphs, its Subgroups and Quotient Groups
Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit
We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced l…