Current Semester Seminars -
Located in Derrick Hall 238 from 1:00 - 1:55 pm

Fall 2009 -

• September 4, 2009:  Jian Shen (Texas State University): On the Chudnovsky-Seymour-Sullivan Conjecture on Cycles in Triangle-free Digraph.
• September 11, 2009:  Liangpan Li (Shanghai Jiaotong University): Some inequalities in functional analysis and probability theory.
• September 18, 2009:  Kirsti Wash (Texas State University):  Exploring the Bounds on the Domination Number of Permutation Graphs
• September 25, 2009:  Susan Morey (Texas State University): Depth Bounds for Edge Ideals of Trees
• October 2, 2009:  Liangpan Li (Shanghai Jiaotong University): Sum-Product Estimate in Finite Fields
• October 9, 2009:  Timothy Bonner (Texas State University): Products of Commutators and the Order of a Finite Group
• October 16, 2009:  Xinmin Hou (West Virginia University): On Shortest Cycle Cover of Cubic Graphs
• October 23, 2009:  Nate Dean (Texas State University): Joint with Math Education seminar
• October 30, 2009:  Apan Qasem (Texas State University, CS Department): Automatic Tuning of Scientific Code for Multicore Architectures
• November 6, 2009:  Department Self Review-No Seminar
• November 13, 2009:  Ryan Martin (Iowa State University):  Tiling in Multipartite Graphs
• November 20, 2009:  Yong Yang (Texas State University): Regular Orbits of Finite Primitive Solvable Groups
• November 24, 2009 (Tuesday):  Shuhui Yang (Purdue University Calumet): Connected Dominating Set in Wireless Ad Hoc Networks
  Rescheduled to MCS 473 from 10:00 - 11:00 am
  Abstract:
  Wireless ad hoc networks are infrastructureless multi-hop networks consisting of mobile or stationary wireless devices. They are inherently distributed systems. The popular applications include mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs). The research challenge in this area is the construction of an underlying communication framework. A connected dominating set (CDS) from graph theory is frequently used in ad hoc networks as a virtual backbone to support efficient routing, service discovery, and area monitoring. With the emergence of new applications and technologies, we need to extend the traditional CDS concept to meet new requirements. This talk introduces the basic concepts in the area of wireless ad hoc networks and also discusses the distributed/localized algorithm design for the communication framework construction in such networks.

Seminar organizer:

Jian Shen Office: Math/CS 451 Phone: 512-245-3740 Email: js48@txstate.edu

Previous Semester Seminars -

Spring 2009-

• January 23, 2009  Jian Shen (Math Department): Symmetric Secret Key Assignment in Communication Networks.
• January 30, 2009  Jian Shen (Math Department): Lights Out!
• February 6, 2009  Jian Shen (Math Department): Union Bounds and Partial Latin Squares
• February 13, 2009  Mahmud Akelbek (Math Department): On the Scrambling Index of Primitive Digraphs
• February 20, 2009  Thomas Keller (Math Department): An application of the Arithmetic-Harmonic-Means Inequality in group theory
• February 27, 2009  Xingde Jia (Math Department): Exact Order of Asymptotic Bases
• March 6, 2009  Max Warshauer (Math Department): Mass Point Geometry
• March 13, 2009  Ben Martin (Biochemistry Department): Trends in chemical bonding – using mathematical analysis to correct an error in every chemistry textbook
• March 27, 2009  Douglas Ray (Math Department): On the Connectedness of a Relatively Prime Graph
• April 3, 2009  Paul Gestwicki (Ball State Univ.): Discrete mathematics in support of interactive curriculum visualization
• April 10, 2009  Hao Jiang (Boston College): Labeling Problems in Computer Vision and Their Convex Solutions
• April 10, 2009  Frank Hsu (Fordham University): Combinatorial Fusion Analysis: Method and Practices.
• April 17, 2009  Kirsti Wash (Math Department): On The Bounds of The Domination Number of Permutation Graphs.
• April 24, 2009  Adrian Heinz (Ball State University): Software Systems for Implementing Graph Algorithms for Learning and Research.
• May 1, 2009  Nate Dean (Math Department): Ulam Number and Incomprehensibility.