Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Ziegler, Konstantin"'
In an ego-network, an individual (ego) organizes its friends (alters) in different groups (social circles). This social network can be efficiently analyzed after learning representations of the ego and its alters in a low-dimensional, real vector spa
Externí odkaz:
http://arxiv.org/abs/2002.06685
The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f(x) = g(h(x)) in F[x] over a field F is well understood in many cases,
Externí odkaz:
http://arxiv.org/abs/1912.00212
Publikováno v:
Procedia Computer Science 126 (2018): 234-243
Artificial Neural Networks have shown impressive success in very different application cases. Choosing a proper network architecture is a critical decision for a network's success, usually done in a manual manner. As a straightforward strategy, large
Externí odkaz:
http://arxiv.org/abs/1904.08166
Publikováno v:
In Journal of Symbolic Computation July-August 2021 105:214-233
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more variables,
Externí odkaz:
http://arxiv.org/abs/1407.2970
Autor:
Ziegler, Konstantin
A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The tame case, wh
Externí odkaz:
http://arxiv.org/abs/1402.5945
Publikováno v:
Journal of Symbolic Computation 59 (2013) 113-145
A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. In order to count the decomposables, one wants to know, under a suitable normalization, the number of equal-degree collisions of the form f
Externí odkaz:
http://arxiv.org/abs/1202.5810
The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields is well un
Externí odkaz:
http://arxiv.org/abs/1005.1087
Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields
Publikováno v:
SIAM Journal on Discrete Mathematics 27 (2013) 855-891
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible ones (irred
Externí odkaz:
http://arxiv.org/abs/0912.3312
Autor:
Jurgovsky, Johannes, Granitzer, Michael, Ziegler, Konstantin, Calabretto, Sylvie, Portier, Pierre-Edouard, He-Guelton, Liyun, Caelen, Olivier
Publikováno v:
In Expert Systems With Applications 15 June 2018 100:234-245