Viktoria E. Kaszanitzky
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Viktoria E. Kaszanitzky has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Bernd Schulze
School of Mathematical Sciences, Lancaster University, Lancaster, UK
2 shared publications - Shin-Ichi Tanigawa
Research Institute for Mathematical Sciences dom Kyoto University Sakyo-ku 606-8502 Kyoto Japan
2 shared publications - Tibor Jordán
Eotvos University, and the MTA-ELTE Egervary Research Group on Combinatorial optimization
2 shared publications - Anthony Nixon
School of Mathematical Sciences Lancaster University Lancaster UK
1 shared publication - Bill Jackson
School of Mathematical Sciences Queen Mary University of London Mile End Road E1 4NS London United Kingdom
1 shared publication - Csaba Király
The MTA-ELTE Egerváry Research Group on Combinatorial Optimization, Eötvös Loránd Research Network (ELKH), Budapest, Hungary
1 shared publication
Latest Publications
- Open Access
Global Rigidity of Periodic Graphs under Fixed-lattice Representations
In 1992, Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions for a generic (non-complete) bar-joint framework to be globally rigid in $\mathbb{R}^d$. Jackson and Jordan confirmed in 2005 that these conditions are also sufficient in $\mathbb{R}^2$, giving a combinatorial characterization of graphs whose generic realizations in $\mathbb{R}^2$ are globally rigid. In this paper, we establish analogues of these results for infinite periodic frameworks under fixed lattice representations. Our combinatorial characterization of globally rigid generic periodic frameworks in $\mathbb{R}^2$ in particular implies toroidal and cylindrical counterparts of the theorem by Jackson and Jordan.Open AccessGlobal Rigidity of Periodic Graphs under Fixed-lattice Representations
In 1992, Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions for a generic (non-complete) bar-joint framework to be globally rigid in $\mathbb{R}^d$. Jackson and Jordan confirmed in 2005 that these conditions are also sufficient in $\mathbb{R}^2$, giving a combinatorial characterization of graphs whose generic realizations in $\mathbb{R}^2$ are globally rigid. In this paper, we establish analogues of these results for infinite periodic frameworks under fixed lattice representations. Our combinatorial characterization of globally rigid generic periodic frameworks in $\mathbb{R}^2$ in particular implies toroidal and cylindrical counterparts of the theorem by Jackson and Jordan. - Open Access
- 1 February 2018
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 236, 256-269
Characterizing minimally flat symmetric hypergraphs
- 1 February 2018
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 236, 256-269
Open AccessCharacterizing minimally flat symmetric hypergraphs
- Open Access
Rigid cylindrical frameworks with two coincident points
We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered. We then apply our results to show that vertex splitting, under the additional assumption that the new edge is redundant, preserves the property of being generically globally rigid on families of concentric cylinders.Open AccessRigid cylindrical frameworks with two coincident points
We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered. We then apply our results to show that vertex splitting, under the additional assumption that the new edge is redundant, preserves the property of being generically globally rigid on families of concentric cylinders. - Open Access
- 1 February 2016
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 55 (2) , 314-372
Gain-Sparsity and Symmetry-Forced Rigidity in the Plane
We consider planar bar-and-joint frameworks with discrete point group symmetry in which the joint positions are as generic as possible subject to the symmetry constraint. We provide combinatorial characterizations for symmetry-forced rigidity of such structures with rotation symmetry or dihedral symmetry of order 2k with odd k, unifying and extending previous work on this subject. We also explore the matroidal background of our results and show that the matroids induced by the row independence of the orbit matrices of the symmetric frameworks are isomorphic to gain sparsity matroids defined on the quotient graph of the framework, whose edges are labeled by elements of the corresponding symmetry group. The proofs are based on new Henneberg type inductive constructions of the gain graphs that correspond to the bases of the matroids in question, which can also be seen as symmetry preserving graph operations in the original graph.
- 1 February 2016
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 55 (2) , 314-372
Open AccessGain-Sparsity and Symmetry-Forced Rigidity in the Plane
We consider planar bar-and-joint frameworks with discrete point group symmetry in which the joint positions are as generic as possible subject to the symmetry constraint. We provide combinatorial characterizations for symmetry-forced rigidity of such structures with rotation symmetry or dihedral symmetry of order 2k with odd k, unifying and extending previous work on this subject. We also explore the matroidal background of our results and show that the matroids induced by the row independence of the orbit matrices of the symmetric frameworks are isomorphic to gain sparsity matroids defined on the quotient graph of the framework, whose edges are labeled by elements of the corresponding symmetry group. The proofs are based on new Henneberg type inductive constructions of the gain graphs that correspond to the bases of the matroids in question, which can also be seen as symmetry preserving graph operations in the original graph.
- 11 March 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (1) , 225-240
On Minimally Highly Vertex-Redundantly Rigid Graphs
- 11 March 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (1) , 225-240
On Minimally Highly Vertex-Redundantly Rigid Graphs
- 4 January 2014
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 31 (3) , 585-599
Rigid Two-Dimensional Frameworks with Two Coincident Points
- 4 January 2014
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 31 (3) , 585-599
Rigid Two-Dimensional Frameworks with Two Coincident Points