Some Applications of Generalized Euler Characteristic of Quantum Graphs and Microwave Networks

2021 ◽  
Vol 140 (6) ◽  
pp. 525-531
Author(s):  
S. Bauch ◽  
M. Lawniczak ◽  
J. Wrochna ◽  
P. Kurasov ◽  
L. Sirko
2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Michał Ławniczak ◽  
Pavel Kurasov ◽  
Szymon Bauch ◽  
Małgorzata Białous ◽  
Afshin Akhshani ◽  
...  

AbstractThe Euler characteristic i.e., the difference between the number of vertices |V| and edges |E| is the most important topological characteristic of a graph. However, to describe spectral properties of differential equations with mixed Dirichlet and Neumann vertex conditions it is necessary to introduce a new spectral invariant, the generalized Euler characteristic $$\chi _G:= |V|-|V_D|-|E|$$ χ G : = | V | - | V D | - | E | , with $$|V_D|$$ | V D | denoting the number of Dirichlet vertices. We demonstrate theoretically and experimentally that the generalized Euler characteristic $$\chi _G$$ χ G of quantum graphs and microwave networks can be determined from small sets of lowest eigenfrequencies. If the topology of the graph is known, the generalized Euler characteristic $$\chi _G$$ χ G can be used to determine the number of Dirichlet vertices. That makes the generalized Euler characteristic $$\chi _G$$ χ G a new powerful tool for studying of physical systems modeled by differential equations on metric graphs including isoscattering and neural networks where both Neumann and Dirichlet boundary conditions occur.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Michał Ławniczak ◽  
Adam Sawicki ◽  
Małgorzata Białous ◽  
Leszek Sirko

AbstractWe identify and investigate isoscattering strings of concatenating quantum graphs possessing n units and 2n infinite external leads. We give an insight into the principles of designing large graphs and networks for which the isoscattering properties are preserved for $$n \rightarrow \infty $$ n → ∞ . The theoretical predictions are confirmed experimentally using $$n=2$$ n = 2 units, four-leads microwave networks. In an experimental and mathematical approach our work goes beyond prior results by demonstrating that using a trace function one can address the unsettled until now problem of whether scattering properties of open complex graphs and networks with many external leads are uniquely connected to their shapes. The application of the trace function reduces the number of required entries to the $$2n \times 2n $$ 2 n × 2 n scattering matrices $${\hat{S}}$$ S ^ of the systems to 2n diagonal elements, while the old measures of isoscattering require all $$(2n)^2$$ ( 2 n ) 2 entries. The studied problem generalizes a famous question of Mark Kac “Can one hear the shape of a drum?”, originally posed in the case of isospectral dissipationless systems, to the case of infinite strings of open graphs and networks.


2014 ◽  
Vol T160 ◽  
pp. 014025
Author(s):  
Michał Ławniczak ◽  
Agata Nicolau-Kuklińska ◽  
Szymon Bauch ◽  
Leszek Sirko

2017 ◽  
pp. 559-584
Author(s):  
Ławniczak Michał ◽  
Bauch Szymon ◽  
Sirko Leszek

2013 ◽  
Vol T153 ◽  
pp. 014041
Author(s):  
Michał Ławniczak ◽  
Agata Nicolau-Kuklińska ◽  
Oleh Hul ◽  
Paweł Masiak ◽  
Szymon Bauch ◽  
...  

2017 ◽  
Vol 132 (6) ◽  
pp. 1655-1660 ◽  
Author(s):  
Z. Fu ◽  
T. Koch ◽  
T.M. Antonsen ◽  
E. Ott ◽  
S.M. Anlage

Sign in / Sign up

Export Citation Format

Share Document