activity
19962024
most citedC*-Crossed Products by Twisted Inverse Semigroup Actions

13 citations · 45 across the 24 of their papers we have counts for

collaborators
Showing 2010Show all

7 papers · 1 filter

math.DS2010

Automated Bifurcation Analysis for Nonlinear Elliptic Partial Difference Equations on Graphs

John M. Neuberger, Nandor Sieben, James W. Swift

We seek solutions to the semilinear elliptic partial difference equation , where is the matrix corresponding to the Laplacian operator on a graph $…

math.DS2010★ 11 cited

Symmetry and Automated Branch Following for a Semilinear Elliptic PDE on a Fractal Region

John M. Neuberger, Nandor Sieben, James W. Swift

We apply the Gradient-Newton-Galerkin-Algorithm (GNGA) of Neuberger & Swift to find solutions to a semilinear elliptic Dirichlet problem on the region whose boundary is the Koch sn…

math.DS2010

Computing Eigenfunctions on the Koch Snowflake: A New Grid and Symmetry

John M. Neuberger, Nandor Sieben, James W. Swift

In this paper we numerically solve the eigenvalue problem on the fractal region defined by the Koch Snowflake, with zero-Dirichlet or zero-Neumann boundary conditions…

math.CO2010

Rectangular Polyomino Set Weak (1,2)-achievement Games

Edgar Fisher, Nandor Sieben

In a polyomino set (1,2)-achievement game the maker and the breaker alternately mark one and two previously unmarked cells respectively. The maker's goal is to mark a set of cells…

math.OA2010

Morita Equivalence of C^*-Crossed Products by Inverse Semigroup Actions and Partial Actions

Nandor Sieben

Morita equivalence of twisted inverse semigroup actions and discrete twisted partial actions are introduced. Morita equivalent actions have Morita equivalent crossed products.

math.CO2010

Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs

Gyula Y. Katona, Nandor Sieben

A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this…