| Gene Fiorini, Muhlenberg College | Gene Fiorini, Muhlenberg College | Ewing 336 | Title: Challenges of Researching Integer Sequences Using the OEIS
<br></br>
Abstract: Sequences play an important role in number theory, combinatorics and discrete mathematics, among many other fields. They enumerate objects in sets and define relationships among items or properties shared between them. Integer sequences have inspired mathematicians for centuries. Likewise, they also inspire computer scientists. The quest to compute new, larger terms in important infinite sequences is harnessing the power of computing and promoting the use of new paradigms in distributed and cloud computing as well as Big Data. Current examples include the "Great Internet Mersenne Prime Search" to find Mersenne primes (sequence A000668 in OEIS) and Microsofts challenge to discover non-Mersenne or "lost" primes (sequence A138837). By gathering sequences and a wealth of information about them together in a common database, the OEIS (Online Encyclopedia of Integer Sequences), established by Neil Sloane, provides the mathematically curious an invaluable resource with which to explore. This talk presents new results on integer sequences associated with the Catalan triangle as well as discussing some interesting sequences found in the OEIS and its role in stimulating new research. | 9/13/2017 1:00:00 PM | 9/13/2017 2:00:00 PM | False | |
| Jun Zhang, Capital Normal University, Beijing (visiting University of Oklahoma) | Jun Zhang, Capital Normal University, Beijing (visiting University of Oklahoma) | Ewing 336 | Title: An Efficient Version of the Bombieri-Vaaler Lemma
<br><br>Abstract: In their celebrated paper "On Siegel's Lemma", Bombieri and Vaaler found an upper bound on the height of integer solutions of systems of linear Diophantine equations. Calculating the bound directly, however, requires exponential time. In this talk, we present the bound in a different form that can be computed in polynomial time. We also give an elementary (and arguably simpler) proof for the bound. (Joint work with Qi Cheng.)
| 9/6/2017 1:00:00 PM | 9/6/2017 2:00:00 PM | False | |
| Bernardo Rodrigues, School of Mathematics, Statistics and Computer Science at University of KwaZulu-Natal, South Africa | Bernardo Rodrigues, School of Mathematics, Statistics and Computer Science at University of KwaZulu-Natal, South Africa | Ewing 336 | Title: On linear codes with complementary duals obtained from
permutation modules of finite groups | 6/13/2017 6:00:00 PM | 6/13/2017 7:00:00 PM | False | |
| Ferdinand Ihringer, University of Regina | Ferdinand Ihringer, University of Regina | EWG 336 | Title: Ovoids in Generalizes Quadrangles
Abstract: A
generalized quadrangle
(GQ) of order (
s, t
) consists of a set of points
P
and a set of lines
L
such that (1) each line contains exactly
s
+ 1 points,
(2) each point lies in exactly
t
+ 1 lines, (3) a more technical condition that
prevents triangles, but guarantees the existence of quadrangles. The
point
graph
of a GQ is strongly regular. A coclique of size 1 +
st
of the point
graph is called an
ovoid
. A coclique of smaller size is called a
partial ovoid
.
In the talk we will discuss the existence of ovoids in GQs and, if they do
not exist, bounds on the size of partial ovoids. | 4/26/2017 3:00:00 PM | 4/26/2017 4:00:00 PM | False | |
This Page Last Modified On:
<a target='_blank' href='/Lists/CalendarDiscreteMathematics/calendar.aspx' class='ms-promotedActionButton'> <span style='font-size:16px;margin-right:5px;position:relative;top:2px;' class='fa fa-pencil-square-o'></span><span class='ms-promotedActionButton-text'>EDIT CALENDAR</span> </a>
WebPartEditorsOnly
