|
|
Construction and production of the floorball stick blade using Fused Deposition Modeling
Jelínek, Vít ; Dvořáček, Jan (referee) ; Sedlák, Josef (advisor)
This work combines 3D printing technology (Rapid Prototyping) with the sports industry. Using mentioned modern technology was made functional model blade floorball stick, which originated in the engineering design 3D parametric software Autodesk Inventor. Work will explain the history of floorball and individual methods increasingly popular and more affordable 3D printing, through which could be modeled blade floorball stick. Conclusion contains techno-economic evaluation, where will be disclosed the pros and cons of the use of Rapid Prototyping technology in this sports industry.
|
|
|
Standard Glass Scales Calibration
Jelínek, Vít ; Fiala, Alois (referee) ; Jankových, Róbert (advisor)
This thesis deals with a more work-efficient and time-efficient method of calibration of standard glass scales, with practical use in the Czech Metrology Institute Regional Inspectorate in Brno. The desired streamlining of calibration were achieved in the use of a 3D coordinate measuring machine Micro-Vu Excel 4520. In the service software InSpec, six measuring programs were designed in the use of a standard glass scale brand SIP. The measurement uncertainties of this calibration were presented and calculated. This thesis draws up a draft proposal of the calibration procedure and drafts a formalized document of the calibration.
|
|
|
Möbius function of matrix posets
Medek, Michal ; Jelínek, Vít (advisor) ; Kantor, Ida (referee)
In this work, we focus on the M¨obius function µ(X, Y ) of four variants of containment posets of sparse matrices, for which the M¨obius function has not been studied before. A sparse matrix is a binary matrix containing at most one 1-cell in each row and column. We focus mainly on the dominated scattered containment, where X ≤ Y if X can be created from Y by removing some rows and columns and by changing some 1-cells to 0-cells. We consider this poset to be a generalization of the permutation poset, as for permutations σ and π, if σ ≤ π, then the permutation matrices Mσ and Mπ satisfy Mσ ≤ Mπ. For the dominated scattered containment, we study the values of the M¨obius function on intervals of the form [1, Y ], where 1 is the 1 × 1 matrix consisting of a single 1-cell. We show that the situation when Y contains a zero row or column can be reduced to a situation when Y has no such zero line, that is, Y is a permutation matrix. For a permutation matrix Y , we derived a theorem expressing µ(1, Y ) in terms of the blocks of the sum decomposition of Y .
|
|
|
Structural and Algorithmic Properties of Permutation Classes
Opler, Michal ; Jelínek, Vít (advisor) ; Kozma, László (referee) ; Bouvel, Mathilde (referee)
In this thesis, we study the relationship between the structure of permutation classes and the computational complexity of different decision problems. First, we explore the structure of permutation classes through the lens of various parameters, with a particular interest in tree-width. We define novel structural properties of a general permutation class C, the most notable being the long path property. Using these properties, we infer lower bounds on the maximum tree-width attained by a permutation of length n in C. For example, we prove that any class with the long path property has unbounded tree-width. The main decision problem we consider is known as Permutation Pattern Match- ing (PPM). The input of PPM consists of a pair of permutations τ (the 'text') and π (the 'pattern'), and the goal is to decide whether τ contains π as a subpermutation. Af- ter briefly considering general PPM, we focus on its pattern-restricted variant known as C-Pattern PPM where we additionally require that the pattern π comes from a fixed class C. We derive both classical and parameterized hardness results assuming different structural properties of C. For example, we show that C-Pattern PPM is NP-complete whenever C has the long path property. Furthermore, we focus on an even more restricted variant of PPM where the text is...
|
|
|
The combinatorics of pattern-avoiding matrices
Mikšaník, David ; Jelínek, Vít (advisor) ; Klazar, Martin (referee)
A permutation matrix P partially avoids a quasi-permutation matrix A (i.e., a 01- matrix such that each column and row of A contains at most one nonzero entry) if there is no submatrix P′ of P of the same size as A satisfying Ai,j ≤ P′ i,j for all possible indices i and j. Two quasi-permutation matrices A and B are partially Wilf-equivalent if, for every n ∈ N, the number of permutation matrices of order n partially avoiding A is the same as the number of permutation matrices of order n partially avoiding B. This generalizes the well-known concept of avoidance and Wilf equivalence of permutations. One of the central topics in this area is the classification of permutations of order k into Wilf equivalence classes. The complete classification is known for k = 1, 2, . . . , 7. In our thesis, we study the same problem for quasi-permutation matrices. Namely, we classify all 371 quasi-permutation matrices of size at most 4 × 4 into partial Wilf equivalence classes (two quasi-permutation matrices belong to the same class if and only if they are partially Wilf-equivalent). Along the way, we prove several general results showing how to construct from one or two quasi-permutation matrices more quasi-permutation matrices that are pairwise partially Wilf-equivalent. 1
|
|
|
New Intersection Graph Hierachies
Chmel, Petr ; Jelínek, Vít (advisor) ; Kratochvíl, Jan (referee)
String graphs are the intersection graphs of curves in the plane. Asinowski et al. [JGAA 2012] introduced a hierarchy of VPG graphs based on the number of bends and showed that the hierarchy contains precisely all string graphs. A similar hierarchy can be observed with k-string graphs: string graphs with the additional condition that each pair of curves has at most k intersection points. We continue in this direction by introducing precisely-k-string graphs which restrict the representation even more so that each pair of curves has either 0 or precisely k intersection points with all of them being crossings. We prove that for each k ≥ 1, any precisely-k-string graph is a precisely-(k + 2)-string graph and that the classes of precisely-k-string graphs and precisely-(k + 1)-string graphs are incomparable with respect to inclusion. We also investigate the problem of finding an efficiently representable class of intersec- tion graphs of objects in the plane that contains all graphs with fixed maximum degree. In the process, we introduce a new hierarchy of intersection graphs of unions of d hori- zontal or vertical line segments, called impure-d-line graphs, and other variations of the class with representation restrictions. We prove that all graphs with maximum degree ≤ 2d are impure-d-line graphs and for d = 1...
|
|
|
The Möbius function of combinatorial posets
Kopfová, Lenka ; Jelínek, Vít (advisor) ; Kantor, Ida (referee)
In this thesis we study the poset of signed permutations under the pattern containment order. A signed permutation is a permutation in which each entry has a plus or a minus sign assigned to it. Therefore signed permutations are a generalization of unsigned permutations as those correspond to picking the plus sign for each entry. We present several results regarding the M¨obius function of signed permutations, some of which are generalizations of those for unsigned ones. Moreover, we study the poset isomorphism between intervals of the poset of signed permutations, which ensures that two intervals have the same value of the M¨obius function.
|
|
|
Algebraické vlastnosti barevnosti grafů
Bulánek, Jan ; Kráľ, Daniel (advisor) ; Jelínek, Vít (referee)
We study algebraic tools for proving the existence of graph colorings and focus a classical method of Alon-Tarsi from this area. In particular, we prove Alon-Tarsi Theorem, provide examples of some known applications and give a new application to colorings of squares of cycles.
|
|
|
Obecná enumerace číselných rozkladů
Hančl, Jaroslav ; Klazar, Martin (advisor) ; Jelínek, Vít (referee)
Název práce: Obecná enumerace číselných rozklad· Autor: Jaroslav Hančl Katedra: Katedra aplikované matematiky Vedoucí diplomové práce: doc. RNDr. Martin Klazar, Dr., KAM MFF UK Abstrakt: Předložená diplomová práce se zabývá asymptotikami počítacích funkcí ideál· číselných rozklad·. Jejím hlavním cílem je zjistit největší možný asympto- tický r·st počítací funkce rozkladového ideálu, která je nekonečněkrát rovna nule. Autor se na základě znalosti asymptotik vybraných rozkladových ideál· snaží po- mocí kombinatorických a základních analytických metod odvodit odhady hledané asymptotiky. Výsledkem je za prvé slabší horní odhad, za druhé poměrně silný dolní odhad a za třetí, pro speciální třídu rozkladových ideál· je nalezen největší asymptotický r·st. Klíčová slova: íselné rozklady, asymptotika rozklad·, rozkladové ideály, počítací funkce, kombinatorická enumerace. 1
|
|
|
Generating random pattern-avoiding matrices
Kučera, Stanislav ; Jelínek, Vít (advisor) ; Šámal, Robert (referee)
Binary matrices not containing a smaller matrix as a submatrix have become an interesting topic recently. In my thesis, I introduce two new algorithms to test whether a big square binary matrix contains a smaller binary matrix together with a process using randomness, which approximates a uniformly random matrix not containing a given matrix. The reason to create such algorithms is to allow researchers test their conjectures on random matrices. Thus, my thesis also contains an effective cross- platform implementation of all mentioned algorithms. Powered by TCPDF (www.tcpdf.org)
|
guest ::
