Seminars and Colloquia by Series

On the extension of sharp Hardy-Littlewood-Sobolev inequality

Series
PDE Seminar
Time
Tuesday, September 25, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Meijun Zhu – University of Oklahoma
We shall describe our recent work on the extension of sharp Hardy-Littlewood-Sobolev inequality, including the reversed HLS inequality with negative exponents. The background and motivation will be given. The related integral curvature equations may be discussed if time permits.

Discrete Mathematical Biology Working Seminar

Series
Other Talks
Time
Tuesday, September 25, 2012 - 10:00 for 1 hour (actually 50 minutes)
Location
Skiles 114
Speaker
Will Perkins – Georgia Tech
Further discussion of co-transcriptional RNA folding, and the potential for trap models to capture these dynamics.

Algorithms for symmetric Gröbner bases

Series
Algebra Seminar
Time
Monday, September 24, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Robert Krone – Georgia Tech
A symmetric ideal in the polynomial ring of a countable number of variables is an ideal that is invariant under any permutations of the variables. While such ideals are usually not finitely generated, Aschenbrenner and Hillar proved that such ideals are finitely generated if you are allowed to apply permutations to the generators, and in fact there is a notion of a Gröbner bases of these ideals. Brouwer and Draisma showed an algorithm for computing these Gröbner bases. Anton Leykin, Chris Hillar and I have implemented this algorithm in Macaulay2. Using these tools we are exploring the possible invariants of symmetric ideals that can be computed, and looking into possible applications of these algorithms, such as in graph theory.

Towards flexibility for higher-dimensional contact manifolds

Series
Geometry Topology Seminar
Time
Monday, September 24, 2012 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Olga Plamenevskaya – SUNY - Stony Brook
By a classical result of Eliashberg, contact manifolds in dimension 3 come in two flavors: tight (rigid) and overtwisted (flexible). Characterized by the presence of an "overtwisted disk", the overtwisted contact structures form a class where isotopy and homotopy classifications are equivalent.In higher dimensions, a class of flexible contact structures is yet to be found. However, some attempts to generalize the notion of an overtwisted disk have been made. One such object is a "plastikstufe" introduced by Niederkruger following some ideas of Gromov. We show that under certain conditions, non-isotopic contact structures become isotopic after connect-summing with a contact sphere containing a plastikstufe. This is a small step towards finding flexibility in higher dimensions. (Joint with E. Murphy, K. Niederkruger, and A. Stipsicz.)

Modeling transcriptional elongation

Series
CDSNS Colloquium
Time
Monday, September 24, 2012 - 11:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Tomas Gedeon – Montana State University –

Please Note: Joint with Applied and Computational Mathematics Seminar

Bio-polymerization processes like transcription and translation are central to a proper function of a cell. The speed at which the bio-polymer grows is affected both by number of pauses of elongation machinery, as well their numbers due to crowding effects. In order to quantify these effects in fast transcribing ribosome genes, we rigorously show that a classical traffic flow model is a limit of mean occupancy ODE model. We compare the simulation of this model to a stochastic model and evaluate the combined effect of the polymerase density and the existence of pauses on transcription rate of ribosomal genes.

Minimum linear ordering problems under submodular costs

Series
Combinatorics Seminar
Time
Friday, September 21, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Prasad Tetali – Georgia Tech –
We introduce a general Minimum Linear Ordering Problem (MLOP): Given a nonnegative set function f on a finite set V, find a linear ordering on V such that the sum of the function values for all the suffixes is minimized. This problem generalizes well-known problems such as the Minimum Linear Arrangement, Min Sum Set Cover, and Multiple Intents Ranking. Extending a result of Feige, Lovasz, and Tetali (2004) on Min Sum Set Cover, we show that the greedy algorithm provides a factor 4 approximate optimal solution when the cost function f is supermodular. We also present a factor 2 rounding algorithm for MLOP with a monotone submodular cost function, while the non monotone case remains wide open. This is joint work with Satoru Iwata and Pushkar Tripathi.

Unfoldings of affine convex polytopes

Series
Geometry Topology Working Seminar
Time
Friday, September 21, 2012 - 13:05 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Mohammad Ghomi – Georgia Tech –
A well-known problem in discerte convex geometry, attributed to the Dutch painter Durrer and first formulated by G. C. Shephard, is concerned with whether every convex polyope P in Euclidean 3-space has a simpe net, i.e., whether the surface of P can be isometrically embedded in the Euclidean plane after it has been cut along some spanning tree of its edges. In this talk we show that the answer is yes after an affine transformation. In particular the combinatorial structure of P plays no role in deciding its unfoldability, which settles a question of Croft, Falconer, and Guy. The proof employs a topological lemma which provides a criterion for checking embeddedness of immersed disks.

Groebner Bases and Integer Programming

Series
ACO Student Seminar
Time
Friday, September 21, 2012 - 13:05 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Josephine Yu – Georgia Tech
The theory of Groebner bases is the foundation of many algorithms in computational algebra. A Groebner basis is a special generating set of an ideal of polynomials. In this expository talk, I will introduce Groebner bases and explain how they can be used in integer programming. In particular, for an integer program, we can associate an ideal whose Groebner basis gives a set of directions that takes any feasible solution to an optimal solution.

Estimation and Support Recovery with Exponential Weights

Series
Stochastics Seminar
Time
Thursday, September 20, 2012 - 15:05 for 1 hour (actually 50 minutes)
Location
Skyles 006
Speaker
Karim Lounici – Georgia Institute of Technology –
In the context of a linear model with a sparse coefficient vector, sharp oracle inequalities have been established for the exponential weights concerning the prediction problem. We show that such methods also succeed at variable selection and estimation under near minimum condition on the design matrix, instead of much stronger assumptions required by other methods such as the Lasso or the Dantzig Selector. The same analysis yields consistency results for Bayesian methods and BIC-type variable selection under similar conditions. Joint work with Ery Arias-Castro

Pages