10 research outputs found
Balanced Symmetric Functions over
Under mild conditions on , we give a lower bound on the number of
-variable balanced symmetric polynomials over finite fields , where
is a prime number. The existence of nonlinear balanced symmetric
polynomials is an immediate corollary of this bound. Furthermore, we conjecture
that are the only nonlinear balanced elementary symmetric
polynomials over GF(2), where , and we prove various results in support of this conjecture.Comment: 21 page
A variation on bisecting the binomial coefficients
In this paper, we present an algorithm which allows us to search for all the
bisections for the binomial coefficients and
include a table with the results for all . Connections with previous
work on this topic is included. We conjecture that the probability of having
only trivial solutions is . \end{abstract}Comment: 14 pages, four tables, two figure
Bisecting binomial coefficients
In this paper, we deal with the problem of bisecting binomial coefficients. We find
many (previously unknown) infinite classes of integers which admit nontrivial bisections,
and a class with only trivial bisections. As a byproduct of this last construction, we
show conjectures Q2 and Q4 of Cusick and Li [7]. We next find several bounds for the
number of nontrivial bisections and further compute (using a supercomputer) the exact
number of such bisections for n ≤ 51
Object Recognition
Vision-based object recognition tasks are very familiar in our everyday activities, such as driving our car in the correct lane. We do these tasks effortlessly in real-time. In the last decades, with the advancement of computer technology, researchers and application developers are trying to mimic the human's capability of visually recognising. Such capability will allow machine to free human from boring or dangerous jobs
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Volume 244, ESA 2022, Complete Volum