Alexander Tylyshchak
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alexander Tylyshchak has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Adrian Korban
Univ Chester, Dept Math & Phys Sci, Chester, Cheshire, England
5 shared publications - Joe Gildea
Univ Chester, Fac Sci & Engn, Dept Math, Chester, Cheshire, England
5 shared publications - Adam Michael Roberts
Department of Physical, Mathematical and Engineering Sciences, University of Chester, Chester, UK
4 shared publications - Rhian Taylor
Univ Chester, Fac Sci & Engn, Dept Math, Chester, Cheshire, England
3 shared publications - Abidin Kaya
Department of Mathematics Education, Sampoerna University, 12780, Jakarta, Indonesia
2 shared publications - Abidin Kaya
Harmony Sch Technol, Houston, TX 77038 USA
2 shared publications
Latest Publications
- Open Access
- 30 October 2026
- Published by Uzhhorod National University in Scientific Bulletin of Uzhhorod University. Series: «Pedagogy. Social Work»
- No. 2(59),p. 263-269
THE ANGLE TRISECTION PROBLEM IN GEOMETRY EDUCATION
This paper explores the didactic potential of the classical angle trisection problem as an inquiry-based case for developing students’ mathematical reasoning, research skills, and critical evaluation of experimental evidence. The problem is particularly suitable for this purpose because its elementary formulation contrasts with the fundamental limitations of compass-and-straightedge constructions established by Wantzel. This contrast creates a productive learning environment in which students can formulate conjectures, construct geometric models, test their validity, and distinguish between empirical evidence and mathematical proof. A geometric construction that exactly trisects several particular angles is examined as a possible algorithm for trisecting an arbitrary acute angle. The resulting conjecture is investigated using GeoGebra as a dynamic geometry environment. A series of digital experiments is conducted for different initial angles, and the accuracy of the construction is evaluated quantitatively by comparing the constructed angles with the theoretical value of one third of the original angle. The experimental results indicate that the construction provides a close approximation to angle trisection but does not constitute an exact general construction. An important feature of the proposed approach is the transition from digital experimentation to mathematical reasoning. Rather than relying solely on Wantzel’s impossibility theorem, students are encouraged to examine the construction, identify its limitations, and establish a counterexample through accessible geometric arguments. In this way, the digital environment serves not as a substitute for proof but as a tool for generating conjectures, detecting deviations, and motivating further mathematical analysis. The proposed learning sequence – problem, conjecture, construction, digital experiment, error evaluation, mathematical interpretation, and reasoned conclusion – provides a coherent framework for inquiry-based geometry learning and illustrates how classical problems can be integrated with digital technologies to foster deeper mathematical understanding and critical thinking.
- 30 October 2026
- Published by Uzhhorod National University in Scientific Bulletin of Uzhhorod University. Series: «Pedagogy. Social Work»
- No. 2(59),p. 263-269
Open AccessTHE ANGLE TRISECTION PROBLEM IN GEOMETRY EDUCATION
This paper explores the didactic potential of the classical angle trisection problem as an inquiry-based case for developing students’ mathematical reasoning, research skills, and critical evaluation of experimental evidence. The problem is particularly suitable for this purpose because its elementary formulation contrasts with the fundamental limitations of compass-and-straightedge constructions established by Wantzel. This contrast creates a productive learning environment in which students can formulate conjectures, construct geometric models, test their validity, and distinguish between empirical evidence and mathematical proof. A geometric construction that exactly trisects several particular angles is examined as a possible algorithm for trisecting an arbitrary acute angle. The resulting conjecture is investigated using GeoGebra as a dynamic geometry environment. A series of digital experiments is conducted for different initial angles, and the accuracy of the construction is evaluated quantitatively by comparing the constructed angles with the theoretical value of one third of the original angle. The experimental results indicate that the construction provides a close approximation to angle trisection but does not constitute an exact general construction. An important feature of the proposed approach is the transition from digital experimentation to mathematical reasoning. Rather than relying solely on Wantzel’s impossibility theorem, students are encouraged to examine the construction, identify its limitations, and establish a counterexample through accessible geometric arguments. In this way, the digital environment serves not as a substitute for proof but as a tool for generating conjectures, detecting deviations, and motivating further mathematical analysis. The proposed learning sequence – problem, conjecture, construction, digital experiment, error evaluation, mathematical interpretation, and reasoned conclusion – provides a coherent framework for inquiry-based geometry learning and illustrates how classical problems can be integrated with digital technologies to foster deeper mathematical understanding and critical thinking.
- 1 January 2024
- Published by Luhansk Taras Shevchenko National University in Algebra and Discrete Mathematics
- Vol. 38 (1) , 23-33
Extended binary Golay codes by a group algebra
Extended binary Golay codes by a group algebra
- 1 January 2024
- Published by Luhansk Taras Shevchenko National University in Algebra and Discrete Mathematics
- Vol. 38 (1) , 23-33
Extended binary Golay codes by a group algebra
Extended binary Golay codes by a group algebra
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 18 (3) , 738-752
Binary self-dual codes of various lengths with new weight enumerators from a modified bordered construction and neighbours
In this work, we define a modification of a bordered construction for self-dual codes which utilises $ \lambda $-circulant matrices. We provide the necessary conditions for the construction to produce self-dual codes over finite commutative Frobenius rings of characteristic 2. Using the modified construction together with the neighbour construction, we construct many binary self-dual codes of lengths 54, 68, 82 and 94 with weight enumerators that have previously not been known to exist.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 18 (3) , 738-752
Binary self-dual codes of various lengths with new weight enumerators from a modified bordered construction and neighbours
In this work, we define a modification of a bordered construction for self-dual codes which utilises $ \lambda $-circulant matrices. We provide the necessary conditions for the construction to produce self-dual codes over finite commutative Frobenius rings of characteristic 2. Using the modified construction together with the neighbour construction, we construct many binary self-dual codes of lengths 54, 68, 82 and 94 with weight enumerators that have previously not been known to exist.
- 31 August 2023
- Published by Az-buki National Publishing House in Mathematics and Informatics
- Vol. 66 (4) , 373-389
INTEGRATED LESSONS IN CALCULUS USING SOFTWARE
Today, both secondary and higher education cannot be effective without the use of innovative technologies. Therefore, all pedagogical workers try to use modern means of organizing educational activities, which cover the entire learning process from defining the goal to reaching the results. This article proposes to consider one of the methods of conducting integrated classes with a combination of analytical computing and specific software application. The above considerations can help students more effectively master the complex theoretical material of the calculus course. The article aims to consider some methods of studying and interpreting the theory of calculus using the free computer mathematics system Maxima and the Python language.
- 31 August 2023
- Published by Az-buki National Publishing House in Mathematics and Informatics
- Vol. 66 (4) , 373-389
INTEGRATED LESSONS IN CALCULUS USING SOFTWARE
Today, both secondary and higher education cannot be effective without the use of innovative technologies. Therefore, all pedagogical workers try to use modern means of organizing educational activities, which cover the entire learning process from defining the goal to reaching the results. This article proposes to consider one of the methods of conducting integrated classes with a combination of analytical computing and specific software application. The above considerations can help students more effectively master the complex theoretical material of the calculus course. The article aims to consider some methods of studying and interpreting the theory of calculus using the free computer mathematics system Maxima and the Python language.
- 23 March 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (8)
Extremal binary self-dual codes from a bordered four circulant construction
- 23 March 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (8)
Extremal binary self-dual codes from a bordered four circulant construction
- Open Access
New binary self-dual codes of lengths 56, 62, 78, 92 and 94 from a bordered construction
In this paper, we present a new bordered construction for self-dual codes which employs $\lambda$-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring of characteristic 2. Moreover, using our bordered construction together with the well-known building-up and neighbour methods, we construct many binary self-dual codes of lengths 56, 62, 78, 92 and 94 with parameters in their weight enumerators that were not known in the literature before.
Open AccessNew binary self-dual codes of lengths 56, 62, 78, 92 and 94 from a bordered construction
In this paper, we present a new bordered construction for self-dual codes which employs $\lambda$-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring of characteristic 2. Moreover, using our bordered construction together with the well-known building-up and neighbour methods, we construct many binary self-dual codes of lengths 56, 62, 78, 92 and 94 with parameters in their weight enumerators that were not known in the literature before.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 16 (2) , 269-284
New self-dual codes of length 68 from a $ 2 \times 2 $ block matrix construction and group ringsMany generator matrices for constructing extremal binary self-dual codes of different lengths have the form \begin{document}$ G = (I_n \ | \ A), $\end{document} where \begin{document}$ I_n $\end{document} is the \begin{document}$ n \times n $\end{document} identity matrix and \begin{document}$ A $\end{document} is the \begin{document}$ n \times n $\end{document} matrix fully determined by the first row. In this work, we define a generator matrix in which \begin{document}$ A $\end{document} is a block matrix, where the blocks come from group rings and also, \begin{document}$ A $\end{document} is not fully determined by the elements appearing in the first row. By applying our construction over \begin{document}$ \mathbb{F}_2+u\mathbb{F}_2 $\end{document} and by employing the extension method for codes, we were able to construct new extremal binary self-dual codes of length 68. Additionally, by employing a generalised neighbour method to the codes obtained, we were able to construct many new binary self-dual \begin{document}$ [68, 34, 12] $\end{document}-codes with the rare parameters \begin{document}$ \gamma = 7, 8 $\end{document} and \begin{document}$ 9 $\end{document} in \begin{document}$ W_{68, 2}. $\end{document} In particular, we find 92 new binary self-dual \begin{document}$ [68, 34, 12] $\end{document}-codes.- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 16 (2) , 269-284
New self-dual codes of length 68 from a $ 2 \times 2 $ block matrix construction and group ringsMany generator matrices for constructing extremal binary self-dual codes of different lengths have the form \begin{document}$ G = (I_n \ | \ A), $\end{document} where \begin{document}$ I_n $\end{document} is the \begin{document}$ n \times n $\end{document} identity matrix and \begin{document}$ A $\end{document} is the \begin{document}$ n \times n $\end{document} matrix fully determined by the first row. In this work, we define a generator matrix in which \begin{document}$ A $\end{document} is a block matrix, where the blocks come from group rings and also, \begin{document}$ A $\end{document} is not fully determined by the elements appearing in the first row. By applying our construction over \begin{document}$ \mathbb{F}_2+u\mathbb{F}_2 $\end{document} and by employing the extension method for codes, we were able to construct new extremal binary self-dual codes of length 68. Additionally, by employing a generalised neighbour method to the codes obtained, we were able to construct many new binary self-dual \begin{document}$ [68, 34, 12] $\end{document}-codes with the rare parameters \begin{document}$ \gamma = 7, 8 $\end{document} and \begin{document}$ 9 $\end{document} in \begin{document}$ W_{68, 2}. $\end{document} In particular, we find 92 new binary self-dual \begin{document}$ [68, 34, 12] $\end{document}-codes.- 1 November 2021
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (11) , 112590
New extremal binary self-dual codes from block circulant matrices and block quadratic residue circulant matrices
- 1 November 2021
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (11) , 112590
New extremal binary self-dual codes from block circulant matrices and block quadratic residue circulant matrices
- 7 October 2021
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 258 (4) , 455-465
On the Number of Indecomposable Modular Representations of a Cyclic p- Group over a Local Ring of Finite Length
- 7 October 2021
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 258 (4) , 455-465
On the Number of Indecomposable Modular Representations of a Cyclic p- Group over a Local Ring of Finite Length
- Open Access
- 19 June 2021
- Published by Vasyl Stefanyk Carpathian National University in Carpathian Mathematical Publications
- Vol. 13 (1) , 127-133
Про спадкову незвідність деяких мономіальних матриць над локальними кільцями
Розглядаються мономіальні матриці над локальним кільцем $R$ головних ідеалів вигляду $M(t,k,n)=\Phi\left(\begin{smallmatrix}I_k&0\\0\,\,&tI_{n-k}\end{smallmatrix}\right)$, $0<k<n$, де $t$ $-$ твірний елемент радикалу Джекобсона $J(R)$ кільця $R$, $\Phi$ $-$ супровідна матриця многочлена $\lambda^n-1$ і $I_k$ $-$ одинична $k\times k$ матриця. В роботі встановлено критерій спадкової незвідності $M(t,k,n)$ у випадку, коли $t^{\left[\frac{k\cdot(n-k)}{n}\right]+1}\not=0$.- 19 June 2021
- Published by Vasyl Stefanyk Carpathian National University in Carpathian Mathematical Publications
- Vol. 13 (1) , 127-133
Open AccessПро спадкову незвідність деяких мономіальних матриць над локальними кільцями
Розглядаються мономіальні матриці над локальним кільцем $R$ головних ідеалів вигляду $M(t,k,n)=\Phi\left(\begin{smallmatrix}I_k&0\\0\,\,&tI_{n-k}\end{smallmatrix}\right)$, $0<k<n$, де $t$ $-$ твірний елемент радикалу Джекобсона $J(R)$ кільця $R$, $\Phi$ $-$ супровідна матриця многочлена $\lambda^n-1$ і $I_k$ $-$ одинична $k\times k$ матриця. В роботі встановлено критерій спадкової незвідності $M(t,k,n)$ у випадку, коли $t^{\left[\frac{k\cdot(n-k)}{n}\right]+1}\not=0$.