|
|
|
|
| Jan De Beule is currently a postdoctoral research fellow at the Research Foundation Flanders (Belgium) (FWO), at Gent University (Belgium). His field of research is Galois geometry. He started his research career in 2000, as a PhD student, and obtained his PhD in 2004. Since then, he has continued his research as a postdoctoral researcher. Apart from Galois geometry, his mathematical interests are in the fields of computer algebra, computational group theory, and combinatorics in general. |
|
|
|
Date Reviewed |
|
|
1 - 10 of 33
reviews
|
|
|
|
|
|
|
|
A generalized attack on RSA type cryptosystems Bunder M., Nitaj A., Susilo W., Tonien J. Theoretical Computer Science 704 74-81, 2017. Type: Article
The safety of the well-known RSA cryptosystem is based on the fact that, in general, it is computationally very hard to factorize large integers. Given two large prime numbers p and q, the public k...
|
Mar 23 2018 |
|
|
|
|
|
|
Planar graphs without 4-cycles adjacent to triangles are 4-choosable Cheng P., Chen M., Wang Y. Discrete Mathematics 339(12): 3052-3057, 2016. Type: Article
Let G be a finite simple graph. A list assignment is a function on the vertices that associates a list of colors with each vertex. An L-coloring is a function that colors each vertex with one of th...
|
Nov 30 2016 |
|
|
|
|
|
|
On the rank of incidence matrices for points and lines of finite affine and projective geometries over a field of four elements Kovalenko M., Urbanovich T. Problems of Information Transmission 50(1): 79-89, 2014. Type: Article
An incidence geometry is, briefly described, a set of elements that have a different type and an incidence relation satisfying certain axioms. Typical examples include projective spaces, affine spaces, and polar spaces. The elements of...
|
Feb 2 2015 |
|
|
|
|
|
|
Representing finite convex geometries by relatively convex sets Adaricheva K. European Journal of Combinatorics 3768-78, 2014. Type: Article
A set A with a closure operator c: 2A → 2A is called a convex geometry if the empty set is closed and if it satisfies the anti-...
|
Sep 10 2014 |
|
|
|
|
|
|
Students’ comparison of their trigonometric answers with the answers of a computer algebra system Tonisson E. CICM 2013 (Proceedings of the 2013 International Conference on Intelligent Computer Mathematics, Bath, UK, Jul 8-12, 2013) 216-229, 2013. Type: Proceedings
This paper reports on an experiment in which pupils had to solve trigonometric equations by hand and using a computer algebra system (CAS). Many equivalent solutions may be possible for a given trigonometric equation. In the experiment...
|
Jun 10 2014 |
|
|
|
|
|
|
Investigation of center manifolds of three-dimensional systems using computer algebra Romanovski V., Mencinger M., Ferčec B. Programming and Computing Software 39(2): 67-73, 2013. Type: Article
A computational approach to center manifolds is presented in this paper. The theory of center manifolds offers a way to reduce the dimension of a system of ordinary differential equations. In a series of theorems, the authors describe ...
|
Dec 16 2013 |
|
|
|
|
|
|
Rainbow cliques and the classification of small BLT-sets Betten A. ISSAC 2013 (Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, Boston, MA, Jun 26-29, 2013) 53-60, 2013. Type: Proceedings
A generalized quadrangle is a partial linear space satisfying the following axiom: for any non-incident point-line pair, there exists exactly one line incident with the point and meeting the line in a unique point. A generalized quadra...
|
Dec 3 2013 |
|
|
|
|
|
|
An asymptotic version of the multigraph 1-factorization conjecture Vaughan E. Journal of Graph Theory 72(1): 19-29, 2013. Type: Article
A multigraph is a graph in which two vertices are contained in more than one edge, but loops are not allowed. A set of edges is parallel if all of its edges contain the same two vertices. The size of the largest parallel set of edges i...
|
Mar 29 2013 |
|
|
|
|
|
|
Characterization of some 4-gonal configurations of Ahrens-Szekeres type Ghinelli D. European Journal of Combinatorics 33(7): 1557-1573, 2012. Type: Article
A finite generalized quadrangle is a point-line geometry characterized by the following property: for a point p and a line L, p not incident with L, there exis...
|
Jan 30 2013 |
|
|
|
|
|
|
Steiner systems S(v, k, k - 1): components and rank Zinoviev V., Zinoviev D. Problems of Information Transmission 47(2): 130-148, 2011. Type: Article
A Steiner system is a t-(v,k,&lgr;) design, for which &lgr;=1; in other words, in a pair (P,B), with P a set of p...
|
Nov 13 2012 |
|
|
|
|
|
|
|
|
|
|
|