Registered Data

Contents

[CT004]

Session Date & Time : 3E (Aug.23, 17:40-19:20)
Type : Contributed Talk
Abstract : A set of $\ell$ orthogonal $n$-ary operations or hypercubes of order $m$ is equivalent to an $(\ell,m^n,\ell-n+1)$ maximum distance separable or MDS code. Consequently, the problem of constructing MDS codes can be reduced to constructing orthogonal operations. We research constructing a ternary medial quasigroup possessing parastrophic orthogonality property. A necessary and sufficient condition that the quasigroup is self-orthogonal, strongly self-orthogonal or totally parastrophically orthogonal is that each polynomial of a certain set is invertible-valued.
Classification : 05B15, 20N05
Author(s) :
- Fedir Sokhatsky (Vasyl` Stus Donetsk National University)
- Iryna Fryz (unemployed)

Session Date & Time : 3E (Aug.23, 17:40-19:20)
Type : Contributed Talk
Abstract : Monte Carlo methods are effective to avoid the "Curse of Dimensionality," while not perfect since their convergences are late. To overcome the weakness, quasi-Monte Carlo methods have been developed. Some of the methods use low discrepancy point sets called $(T, M, S)$-nets. In this talk, I present a new construction procedure of $(T, M, S)$-nets from orthogonal arrays as an application of the extension of Sudoku to higher dimensions named Sudoku hypercubes.
Classification : 05B15, 65C05
Author(s) :
- Shigetaka Taga (University of Tsukuba)

Session Date & Time : 3E (Aug.23, 17:40-19:20)
Type : Contributed Talk
Abstract : The objective in this work is to develop a new algorithm that can determine the realization of matrices in SL_2 over the multivariate Laurent polynomial ring R[x^{±}_ 1 ,...,x^{±}_ n ], where the symbol R denote an arbitrary Euclidean ring, which allows a suitable generalization of the Euclidean division algorithm. It’s known that every matrix in SL_n(R[x_1,...,x_n]) for n ≥ 3 is realizable based on Suslin’s stability theorem [2], furthermore, it was proved by P. M. Cohn in [4] that this theorem cannot be applied in the case where n = 2. We are interested in Park’s algorithm [1] with which one can test whether the matrix A allows ; a factorization into elementary matrices and if it does give its explicit factorization.
Classification : 08A40, 13F20, 16S34, 11C99
Author(s) :
- Fatima Boudaoud (University Oran1)
- Rania Mime (University Oran1)

Session Date & Time : 3E (Aug.23, 17:40-19:20)
Type : Industrial Contributed Talk
Abstract : In this textual proposal and the workshops that are found in it, it promotes the construction of very novel knowledge and dynamics, which, for the present case, are found mainly in the areas of mathematics and physics; They are knowledge folded one inside the other, and in this way they evolve towards new levels of conceptual organization: they create non-linear dynamic structures, but framed in a system of multiple interconnections.
Classification : Number theory, General topology, Geophysics, Real functions, 2 Harmonic analysis on Euclidean spaces
Author(s) :
- Edwin Gerardo Acuña Acuña (Universidad Latinoamericana de Ciencia y Tecnología)

Session Date & Time : 3E (Aug.23, 17:40-19:20)
Type : Industrial Contributed Talk
Abstract : Current knowledge of the business, the market and customers is not enough to face new business challenges. There are a number of theoretical foundations in mathematical-statistical models to support commercial, financial and brand positioning decisions in the industry, as well as understanding consumer behavior or proposing marketing and management actions. These processes would be carried out through Data Mining in Business Analytics, the professional will understand how to make statistical information his first ally in the management of business options.
Classification : Number theory, General topology, Geophysics, Real functions, 2 Harmonic analysis on Euclidean spaces
Author(s) :
- Edwin Gerardo Acuña Acuña (Latin American University of Science and Technology)