Computation in Coxeter groups. I: Multiplication.
Computation of centralizers in Braid groups and Garside groups.
We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conjugacy problem given by the authors in [9], are two main steps for solving conjugacy systems, thus breaking recently discovered cryptosystems based in braid groups [2]. We also present the result of our computations, where we notice that our algorithm yields surprisingly small generating sets for the centralizers.
Computation of Period Matrices of Real Algebraic Curves*
Computation of rigidity of order for one simple matrix
We shall compute the exact value of rigidity of the triangular matrix with entries 0 and 1.
Computational approaches to the design of low-energy buildings
European and Czech directives and technical standards, approved in several last years, force substantial changes in thermal behaviour of all buildings, including new and reconstructed one- or more-family houses, block of fl ats, etc., especially radical decrease of their energy requirements. This stimulates the development of advanced materials, structures and technologies. Since no reliable experience with their design is available, robust and non-expensive computational simulation approaches,...
Computational aspects of group extensions and their applications in topology.
Computational aspects of lucidity-driven graph clustering.
Computational complexity in algebraic systems.
Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs
Computational exploration of the biological basis of Black-Scholes expected utility function.
Computational Interrpretations of Logics
Computational schemes for two exponential servers where the first has a finite buffer
We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [Stochastic Models20 (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process to...
Computational schemes for two exponential servers where the first has a finite buffer
We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [Stochastic Models20 (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process to...
Computations in finite-dimensional Lie algebras.
Computer aided design of mechatronic systems
Any successful company must react quickly to changing trends in the market. New products should be designed and manufactured quicker and cheaper than counter partners do. A shorter design time provides a distinct competitive advantage. The paper describes two approaches towards designing interdisciplinary mechatronic systems: the first is visual modelling with the UML, the second is physical modelling with Modelica.
Computer identification of plane regions
This paper gives a simple algorithm for the identification of the insidedness and the autsidedness of a plane bounded region. The region can be the union, intersection or difference of an arbitrary number of -tuple connected regions.
Computer Network Design Problems
Computer science a jej vzťah k matematike
Computer-Assisted Proofs and Symbolic Computations
We discuss some main points of computer-assisted proofs based on reliable numerical computations. Such so-called self-validating numerical methods in combination with exact symbolic manipulations result in very powerful mathematical software tools. These tools allow proving mathematical statements (existence of a fixed point, of a solution of an ODE, of a zero of a continuous function, of a global minimum within a given range, etc.) using a digital computer. To validate the assertions of the underlying theorems...
Computerbilder von Aufblasungen.