Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Christiaan van de Woestijne"'
Publikováno v:
International Journal of Number Theory. 10:1459-1483
Let $\E$ be a commutative ring with identity and $P\in\E[x]$ be a polynomial. In the present paper we consider digit representations in the residue class ring $\E[x]/(P)$. In particular, we are interested in the question whether each $A\in\E[x]/(P)$
Publikováno v:
Ars mathematica contemporanea
Scopus-Elsevier
Montanuniversität Leoben
Scopus-Elsevier
Montanuniversität Leoben
We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one un
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::146db7a2812171b16815a6c30796f341
http://www.dlib.si/details/URN:NBN:SI:doc-O142F3WI
http://www.dlib.si/details/URN:NBN:SI:doc-O142F3WI
Autor:
Christiaan van de Woestijne
Publikováno v:
Ars Mathematica Contemporanea. 5:307-323
We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has n connected components, where n is prime, or n = 1, 4, 8, 9, and
Autor:
Christiaan van de Woestijne
Publikováno v:
Actes des rencontres du CIRM. 1:75-79
Autor:
Christiaan van de Woestijne
Publikováno v:
Journal of Number Theory. 128:2914-2938
The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when we choose
Autor:
Christiaan van de Woestijne
Publikováno v:
Jahrbuch für Liturgik und Hymnologie: 2014
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d568b668da516e770442a8cb574ee301
https://doi.org/10.13109/9783666572241.159
https://doi.org/10.13109/9783666572241.159
The Waring function $g(k,q)$ measures the difficulty of Waring's problem for $k$th powers in the field of $q$ elements. Its calculation seems to be difficult, and many partial results have been published, notably upper bounds for certain regions of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1017f63bf4c66d1b63c47db50fd9f4d1
Autor:
Christiaan van de Woestijne
Publikováno v:
ISSAC
For rationally fibred surfaces over Q and also over R, an effective algorithm exists that decides if such a surface has a proper parametrisation. This algorithm uses a diagonalised form of the surface equation. We show, using recent algorithms for qu
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540360759
ANTS
ANTS
We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the curve. For this, we reduce the problem to the task of finding a rational point
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0915e27ff10ea691ec3a9c7558de213
https://doi.org/10.1007/11792086_36
https://doi.org/10.1007/11792086_36
Over a field of characteristic zero, it is clear that a polynomial of the form (X-a)^d has a non-trivial common factor with each of its d-1 first derivatives. The converse has been conjectured by Casas-Alvero. Up to now there have only been some comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16a85f0e70903dec435aab50af185083