Katedra matematiky / Department of Mathematics


Recent Submissions

Stehlík, Petr , Švígler, Vladimír , Volek, Jonáš
Bifurcations in Nagumo Equations on Graphs and Fiedler Vectors

Reaction-diffusion equations serve as a basic framework for numerous dynamic phenomena like pattern formation and travelling waves. Spatially discrete analogues of Nagumo reaction-diffusion equation on lattices and graphs provide insights how these phenomena are strongly influenced by the discrete and...

Stehlík, Petr , Švígler, Vladimír , Volek, Jonáš
Source-sink dynamics on networks: Persistence and extinction

Dynamics of populations with logistic growth leads to global persistence on arbitrary networks, whereas bistable dynamics is always associated with local extinction. In this paper we study a reaction-diffusion model on networks with a combination of both logistic and bistable reactions. We&#...

Rajain, Kanika , Bizzarri, Michal , Lávička, Miroslav , Kosinka, Jiří , Bartoň, Michael
Towards G1-Continuous Multi-Strip Path-Planning for 5-Axis Flank CNC Machining of Free-Form Surfaces Using Conical Cutting Tools

Existing flank milling path-planning methods typically lead to tiny gaps or overlaps between neighbor-ing paths, which causes artifacts and imperfections in the workpiece. We propose a new multi-strip path-planning method for 5-axis flank milling of free-form surfaces which targets G1 (tangent-pl...

Holubová, Gabriela , Levá, Hana
Travelling wave solutions of the beam equation with jumping nonlinearity

We study the existence of travelling wave solutions of a nonlinear fourth–order partial differential equation which can be considered as a model of an asymmetrically supported beam. We use a variational approach and show that there exist infinitely many travelling wave solutions under&#...

Gavrilyuk, Alexander , Nedela, Roman , Ponomarenko, Ilia
The Weisfeiler-Leman Dimension of Distance-Hereditary Graphs

A graph is said to be distance-hereditary if the distance function in every connected induced subgraph is the same as in the graph itself. We prove that the ordinary Weisfeiler-Leman algorithm tests the isomorphism of any two graphs if one of them is distance-hereditary; more&...