Tuesday, April 24, 2018
in Room 920 East Building, 3:004:00 pm (GRECS Seminar)
Algorithmic problems for quasiconvex subgroups of hyperbolic groups
Presented by Eric Swenson, Professor of Mathematics, Brigham Young University
Abstract:
We discuss algorithms for determining whether a quasiconvex subgroup is almost malnormal and an algorithm for determining the numbers of ends of the pair for a quasiconvex subgroup.
Friday, March 9, 2018
in Room 920 East Building, 12 noon1:00 pm
Methods and Software Development for
IntervalCensored TimetoEvent Data
Presented by Chun Pan, Clinical Biostatistician, Novartis Oncology
Abstract:
Intervalcensored timetoevent data occur naturally in studies of diseases where the symptoms of interest are not directly observable, and periodic laboratory or clinical examinations are required for detection. Due to the lack of well established procedures, intervalcensored data have been conventionally treated as rightcensored data; however, this introduces bias at the first place. This presentation gives an overview of my current research, which focuses on methodological research and software development for analyzing interval censored data. Specifically, it will present the three research projects that have been completed. The first project is a Bayesian semiparametric proportional hazards model with spatial random effect for spatially correlated interval censored data. In the second project, we developed a multiple frailty proportional hazards model with frailty selection for clustered intervalcensored data, which is analogous to a mixed model in regression analysis. In the third project, we created an R package “ICBayes” for regression analysis and survival curve estimation of intervalcensored data based on several published papers by our research team. At the end, this presentation will lay out some directions for future research.
Friday, March 2, 2018
in Room 920 East Building, 12 noon1:00 pm
Robust Nonparametric Functional Data Analysis
Based on Depth
Presented by Sara LopezPintado, Professor of Statistics, Columbia University
Abstract:
Technological development in many emerging research fields has led to the acquisition of large collections of data of extraordinary complexity. In neuroscience for example, brainimaging technology has provided us with complex collections of signals from individuals in different neurophysiological states in healthy and diseased populations.
These signals can be collected and represented as functions. The development of statistical tools to analyze this type of highdimensional data set is very much needed. I will present new robust methodologies for analyzing functional and imaging data based on the concept of depth. Functional depth provides a rigorous way of ranking a sample of functions from centeroutward. This ordering allows us to define robust descriptive statistics such as medians, trimmed means and central regions for functional data. Moreover, data depth is often used as a building block for developing robust statistical methods and outlierdetection techniques. Permutation and global envelope depthbased tests for comparing the locations of two groups of functions or images are proposed and calibrated. The performances of these methods are illustrated in simulated and real data sets. In particular, we tested differences between PET (Positron Emission Tomography) brain images of healthy controls and patients with severe depression. We also used these methods to test differences between the growth pattern of normal and low birth weight children.
Friday, February 23, 2018
in Room 920 East Building, 12 noon1:00 pm
Constrained Factor Models for HighDimensional
MatrixVariate Time Series
Presented by Elynn Chen, Statistics PhD Candidate, Rutgers University
Abstract:
Highdimensional matrixvariate time series data are becoming widely available in many scientific fields, such as economics, biology, and meteorology.
To achieve significant dimension reduction while preserving the intrinsic matrix structure and temporal dynamics in such data, Wang et al. 2017 proposed a matrix factor model that is shown to provide effective analysis. In this paper, we establish a general framework for incorporating domain or prior knowledge in the matrix factor model through linear constraints. The proposed framework is shown to be useful in achieving parsimonious parameterization, facilitating interpretation of the latent matrix factor, and identifying specific factors of interest. Fully utilizing the priorknowledgeinduced constraints results in more efficient and accurate modeling, inference, dimension reduction as well as a clear and better interpretation of the results. In this paper, constrained, multiterm, and partially constrained factor models for matrixvariate time series are developed, with efficient estimation procedures and their asymptotic properties. We show that the convergence rates of the constrained factor loading matrices are much faster than those of the conventional matrix factor analysis under many situations. Simulation studies are carried out to demonstrate the finitesample performance of the proposed method and its associated asymptotic properties. We illustrate the proposed model with three applications, where the constrained matrixfactor models outperform their unconstrained counterparts in the power of variance explanation under the outofsample 10fold crossvalidation setting.
Wednesday, December 13, 2017
in Room 921 East Building, 3:004:00 pm (GRECS Seminar)
Infinite Periodic Groups and Burnside Problems
Presented by Diljit Singh, Mathematics Major at Hunter College
Abstract:
We will talk about different formulations of Burnside's problems and list major milestones towards the 1994 result by Zelmanov. We will sketch a short proof of the Golod and Shafarevich theorem and the construction of a counterexample to the General Burnside Problem.
Wednesday, November29, 2017
in Room 921 East Building, 1:152:15 pm (CUNY Applied Probability and Statistics Seminar)
Analysis of Error Control in Large Scale TwoStage Multiple Hypothesis Testing
Presented by Wenge Guo, Associate Professor of Statistics, New Jersey Institute of Technology
Abstract:
When dealing with the problem of simultaneously testing a large number of null hypotheses, a natural testing strategy is to first reduce the number of tested hypotheses by doing screening or selection, and then to simultaneously test selected hypotheses. The main advantage of this strategy is to greatly reduce the severe effect of high dimensions. However, the first screening or selection stage must be properly accounted for in order to maintain some type of error control. In this talk, we will introduce a selection rule based on the selection statistic which is independent of the test statistic when the tested hypothesis is true. Combining this selection rule and the conventional Bonferroni procedure, we can develop a powerful and valid twostage procedure. The suggested procedure has several nice properties: (i) completely remove the selection effect; (ii) reduce the multiplicity effect; (iii) do not waste any samples while carrying out both selection and testing. Asymptotic power analysis and simulation studies illustrate that this proposed method provides higher power compared to usual multiple testing methods while controlling the type 1 error rate. Optimal selection thresholds are also derived based on our asymptotic analysis. This is a joint work with Joseph Romano from Stanford University.
Friday, November 17, 2017
in Room 5417 CUNY Graduate Center, 4:005:00 pm (NY Group Seminar and GRECS Seminar)
Wicks forms and normal forms for the mapping class group of a once punctured surfaces
Presented by Eric Swenson, Professor of Mathematics, Brigham Young University, and Alina Vdovina, the Ada Peluso Visiting Professor, Hunter College
Abstract:
Mosher obtains a automatic structure on the mapping class group of a once punctured surface of genus $g$ using ideal "triangulations" of the surface. We translate this into the setting of wicks forms of genus $g$ of maximal length, which I think of as a connected cubic graph $\Gamma$ on 4g2 vertices with specified orientable circuit. Let $v$ be the vertex corresponding to $\Gamma$ in the Mosher complex $Y$. Any other vertex $w$ of $Y$ is uniquely represented as a finite sequence of paths (without backtracking) in $\Gamma$. Any edge path in $Y$ from $v$ to $w$ is realized as a sequence of elementary moves on $Y$ (each of which takes a path without backtracking to a path without backtracking). These moves will change each of the given paths into an empty path.
Wednesday, November 1, 2017
in Room 921 East Building, 1:102:14 pm (GRECS Seminar)
Classifying Amalgams
Presented by Corneliu Hoffman, University of Birmingham, UK
Abstract:
We discuss the problem of classifying amalgams that look like the amalgam of small rank Levi subgroups in groups of KacMoody type (and some interesting subgroups). It turns out that, under very mild assumptions, these either collapse or are isomorphic to a standard amalgam of a twisted form of the corresponding group of KacMoody type. This is a result that is needed in the second generation proof of the Classification of Finite Simple Groups.
About the Speaker: Corneliu Hoffman obtained his his PhD in 1998 from the University of Southern California. Prior to moving to Birmingham held academic positions at the University of California Irvine, and The Mathematical Research Institute in Berkeley and Bowling Green State University in the US. His research interests include various kinds of Group Theory as well as some topics in Computer Assisted Proofs.
Wednesday, October 25, 2017
in Room 921 East Building, 1:102:10 pm (GRECS Seminar)
Ring Theoretic Analogues of C*Algebras
Presented by Ben Steinberg, Professor of Mathematics, City College of New York, CUNY
Abstract:
Many C*algebras have purely algebraic analogues over an arbitrary base commutative ring. For example, group C*algebras correspond to group rings. Over the past decade there has been a lot of work on the ring theoretic analogue of CuntzKrieger (or graph) C*algebras, called Leavitt path algebras. There are a number of interesting commonalities between graph C*algebras and Leavitt path algebras, such as they both have the same criteria for simplicity, primitivity and they both have the same K_0groups. The proofs however have been entirely different in the analytic and algebraic contexts.
Most of the C*algebras are examples of groupoid algebras. I recently introduced a ring theoretic analogue of groupoid C*algebras. The close relations between the C*algebras and their algebraic counterparts are usually explained by the groupoid. Many other interesting C*algebras now have purely algebraic versions that are quite natural. Nekrashevych has use groupoid algebras to construct simple algebras of quadratic growth over fields of any characteristic, answering a question of Jason Bell.
In this talk we’ll survey some examples, results and open questions.
Wednesday, October 11, 2017
in Room 920 East Building, 1:15 pm (Department Colloquium)
Expander Graphs From Buildings
Presented by Alina Vdovina, the Ada Peluso Visiting Professor, Hunter College; Lecturer Pure Mathematics, Newcastle University, United Kingdom
Abstract:
Expander graphs are one of the deepest tools of several branches of mathematics and theoretical computer science, appearing in all sorts of contexts since their introduction in the 1970s. Expander graphs are graphs which are sparse and highly connected in the same time. We will cover our construction of the first examples of Cayley graph expanders of groups defined explicitly by generators and relations.
Alina Vdovina (Newcastle University, UK) is the Ada Peluso Visiting Professor of Mathematics at Hunter College for Fall 2017 and Spring 2018. She has published 35 research articles in a broad range of fields: geometry and analysis on groups acting on buildings, graph theory, construction of new algebraic varieties, geometry of Riemann surfaces, knot theory, constructing C* algebras and computing their Ktheory, noncommutative geometry and operator theory, geometric and combinatorial group theory, cryptography. Professor Vdovina was an invited speaker at over 20 International conferences and gave over 60 invited research seminar and colloquia talks, including lectures for thematic programs at the MaxPlanckInstitute (Bonn), Cambridge, Berkeley, ETH (Zurich), IHES and Institute Henri Poincare (Paris). She received the Lise Meitner award (Germany) in 2002. Some of her ongoing international collaborations include the "Harvard Picture Language Project". She is a trustee of the London Mathematical Society, a member of the LMS Research Grants Committee, and a Fellow of Higher Education Academy (UK).
Wednesday, April 19, 2017
in Room 920 East Building, 1:102:10 pm (GRECS Seminar)
Growth of finitely presented Rees quotients of free inverse semigroups
Presented by Professor David Easdown, School of Mathematics and Statistics at the University of Sydney, Australia
Abstract:
Inverse semigroups are an abstraction of collections of partial oneone mappings of a set closed under composition and inversion. Free inverse semigroups exist, and resemble free groups, except that in the usual reduction of words, one "remembers" detail about the cancellations that have taken place, captured precisely using concatenation and reduction of Munn trees. Free inverse semigroups possess ideals, factoring out by which yields Rees quotients, which are also inverse semigroups, now with zero. When everything is finitely generated, we have usual notions of growth. Idempotents proliferate when working with inverse semigroup presentations with zero, introducing subtleties and requiring new techniques compared with group or semigroup presentations. Growth of finitely presented Rees quotients of free inverse semigroups turns out to be polynomial or exponential, and algorithmically recognizable, using modifications of graphical constructions due to De Bruijn, Ufnarovsky, Gilman, and can also be understood with respect to criteria involving height, in the sense of Shirshov. Polynomial growth is coincidental with satisfiability of semigroup identities, in particular related to Adjan's identity for the bicyclic semigroup. The boundary between polynomial and exponential growth is also interesting with regard to the notion of deficiency of the presentation, yielding concise sharp lower bounds for polynomial growth, and classifications of classes of semigroups where the lower bounds are achieved.
This is joint work with Lev Shneerson, Hunter College of CUNY.
Wednesday, March 29, 2017
in Room 922 East Building, 1:152:25 pm (CUNY Applied Probability & Statistics Seminar)
Interpreting variation across trials in neurophysiology
Presented by Asohan Amarasingham, Associate Professor, Department of Mathematics, City College of New York
Abstract:
How do neurons code information, and communicate with one another via synapses? Experimental approaches to these questions are challenging because the spike outputs of a neuronal population are influenced by a vast array of factors. Such factors span all levels of description, but only a small fraction of these can be measured, or are even understood. As a consequence, it is not clear to what degree variations in unknown and uncontrolled variables alternately reveal or confound the underlying signals that observed spikes are presumed to encode. A related consequence is that these uncertainties also disturb our comfort with common models of statistical repeatability in neurophysiological signal analysis. I will describe these issues to contextualize tools developed to interpret largescale electrophysiology recordings in behaving animals, focusing on conceptual issues. Applications will be suggested to the problems of synaptic and network identification in behavioral conditions as well as neural coding studies.?
Wednesday, March 22, 2017
in Room 922 East Building, 12:151:05 pm (CUNY Applied Probability & Statistics Seminar)
Semiparametric dynamic factor models for nonstationary time series
Presented by Giovanni Motta, Pontificia Universidad Catolica de Chile
Abstract:
A novel dynamic factor model is introduced for multivariate nonstationary time series. In a previous work, we have developed asymptotic theory for a fully nonparametric approach based on the principal components of the estimated timevarying covariance and spectral matrices. This approach allows both common and idiosyncratic components to be nonstationary in time. However, a fully nonparametric specification of covariances and spectra requires the estimation of highdimensional timechanging matrices. In particular when the factors are loaded dynamically, the nonparametric approach delivers timevarying filters that are twosided and highdimensional. Moreover, the estimation of the timevarying spectral matrix strongly depends on the chosen bandwidths for smoothing over frequency and time. As an alternative, we propose a new approach in which the nonstationarity in the model is due to the lowdimensional latent factors. We distinguish between the (double asymptotic) framework where the dimension of the panel is large, and the case where the crosssection dimension is finite. For both scenarios we provide identification conditions, estimation theory, simulation results and applications to real data.
Wednesday, March 15, 2017
in Room 921 East Building, 12:151:05 pm (GRECS Seminar)
Groups as geometric objects
Presented by Ilya Kapovich, the Ada Peluso Visiting Professor, Hunter College; Professor of Mathematics, University of Illinois at UrbanaChampaign
Abstract:
We will give a broad survey of geometric group theory, an active area of mathematics which emerged as a distinct subject in early 1990s and which is located at the juncture of group theory, differential geometry, and geometric topology. We will discuss the various questions, tools and ideas from geometric group theory, as well as some open problems. The talk does not assume any prior knowledge of the subject and should be accessible to general audience.
Wednesday, March 1, 2017
in Room 920 East Building, 1:102:10 pm (GRECS Seminar)
Groups and Semigroups with Applications to Computer Science
Algebraic Rigidity and Randomness in Geometric Group Theory
Presented by Ilya Kapovich, the Ada Peluso Visiting Professor, Hunter College; Professor of Mathematics, University of Illinois at UrbanaChampaign
Abstract:
Counting particular mathematical structures up to an isomorphism is an important basic mathematical problem. In many instances, e.g. for counting graphs and finite groups (with various restrictions), good precise or asymptotic counting results are known. However, until recently very little has been known about counting isomorphism types of finitely presented groups, with various restrictions on the size and the type of a group presentation. The reason is that, by a classic result of Novikov and Boone, the isomorphism problem for finitely presented groups is algorithmically undecidable. Even for those classes of groups where the isomorphism problem is decidable, the known algorithms are usually too complicated to help with counting problems.
In this talk we will survey recent progress in this direction, based on joint work with Paul Schupp. The key results, allowing for asymptotic counting of isomorphism types, involve establishing several kinds of algebraic rigidity properties for groups given by "generic" presentations. A representative result here is an isomorphism rigidity theorem for generic onerelator groups. As an application, we compute the precise aymptotics of the number of isomorphism classes of onerelator groups as the length of the defining relator tends to infinity.
Wednesday, February 22, 2017
in Room 920 East Building, 1:102:10 pm (GRECS Seminar)
The primitivity index function for a free group, and untangling closed geodesics on hyperbolic surfaces
Presented by Ilya Kapovich, the Ada Peluso Visiting Professor, Hunter College; Professor of Mathematics, University of Illinois at UrbanaChampaign
Abstract:
An important result of Scott from 1980s shows that every closed geodesic on a compact hyperbolic surface can be lifted (or ``untangled") to a simple closed geodesic in some finite cover of that surface. Recent work of Patel and others initiated quantitative study of Scott's result, which involves understanding the smallest degree of a cover where a closed geodesic ``untangles", compared with the length of the curve.
Motivated by these results of Scott and Patel, we introduce several ``untangling'' indexes for nontrivial elements of a finite rank free group F, such as the ``primitivity index'', the ``simplicity index'' and the ``nonfilling index". We obtain several results about the worstcase behavior of the corresponding index functions and about the probabilistic behavior of the indexes on ``random'' elements of F.
We also discuss applications of these results to the original setting of Scott and Patel of untangling closed geodesics on hyperbolic surfaces.
The talk is based on a joint paper with Neha Gupta, with an appendix by Khalid BouRabee.
Wednesday, November 16, 2016
in Room 920 East Building, 1:102:10 pm (GRECS Seminar)
FirstOrder Definable Languages and CounterFree Automata
Presented by Pascal Weil, the Ada Peluso Visiting Professor, Hunter College; Research Professor, National Centre for Scientific Research, Université Bordeaux, France
Abstract:
We will discuss the deep connections between automata theory, formal language theory and logic. Regular languages (those that are accepted by finite state automata) are known to be exactly those specified by monadic second order logic (MSO). Firstorder logic is a very natural fragment of MSO: it is natural to ask whether that fragment is sufficient to specify regular languages (it isn’t!), and to characterize firstorder definable languages. The theorems of Schützenberger and McNaughtonPapert give a nice solution to this problem, with characterizations in terms of automata theory and in terms of regular expressions. It is however a third characterization, of an algebraic nature (it uses the notion of the syntactic monoid of a language: a finite, effectively computable monoid attached to a regular language), which provides the tools to effectively decide firstorder definability.
Quantifier alternation defines a natural hierarchy within first order logic, which yields an infinite hierarchy of within the class of firstorder definable languages. Investigating the decidability of this hierarchy is a challenging and active research area. Only a few of the lower levels of this hierarchy are known to be decidable.
Pascal Weil is a Research Professor of the highest rank in the National Centre for Scientific Research. Professor Weil received a Doctorate degree in Informatics from the University of Paris7 in 1985, a PhD in Mathematics from the University of Nebraska Lincoln in 1988, and a Habilitation Degree in Informatics from the University of Paris6 in 1989. He was director of LaBRI (Bordeaux Research Lab in Computer Science) from 2011 to 2015, as well as the Chair of the Scientific Council for Information Sciences (a national council within CNRS) from 2010 to 2014. Professor Weil has over 80 publications (including over 50 journal articles) focused on algebraic methods in computer science, notably in the field of automata and formal language theory and algorithmic and combinatorial problems in group theory.
Wednesday, October 19, 2016
in Room 922 East Building, 1:152:05 pm
The 2016 Nobel for the Economics of Contracts:
A Primer on Contract Design Modeling as a Problem of Statistical Inference with Applications in Financial Contracting
Presented by Jonathan Conning, Associate Professor, Department of Economics, Hunter College and the CUNY Graduate Center
Abstract:
The 2016 Nobel Prize in Economics has just been awarded to Oliver Hart and Bengt Holmstrom "for their contributions to contract theory." This talk will provide a short primer on some of the main modeling ideas in the field of field contract design under asymmetric information, with an emphasis on financial contracting under moral hazard. Holmstrom's (1979) paper on Moral Hazard and Observability and Grossman and Hart's (1983) paper An Analysis of the PrincipalAgent Problem established the modern "state space" approach to the problem which allowed the field to flourish and explode. In the canonical singletask moral hazard contracting problem a Principal (e.g. landowner, firm owner, investor) wishes to enter into a contract with an Agent (e.g. workercumtenant, employee, entreprenneur/borrower) to carry out a task or project whose stochastic outcome can be described by a statistical distribution which that can be shifted by the agent's choice of action (e.g. the agent's diligence or effort). When both the project's outcomes and the agent's action choices are both observable and contractible this is just a standard neoclassical problem (e.g. financial contracts with ArrowDebreu statecontingent commodities and standard asset pricing formulas). When the agent's actions are not observable the contract design problem becomes a statistical inference and constrained optimization problem: how to design a contract that ties the agent's renumeration to observable outcomes that strikes a balance between providing incentives for the agent to choose a right level of unobserved diligence/effort without imposing too much costly risk. After establishing a few key results of the canonical case the presentation moves on to study more challenging and interesting contracting situations from Holmstrom's work (and this author's own work) to study multitask and multiagent principal agent problems. I discuss questions such as the possible uses of relativeperformance evaluation (tournaments), whether to organize contracting directly through bilateral contracts or via specialized intermediaries of jointliability structures and other topics and show how the framework is helpful for analyzing key questions in modern corporate finance such as how firms borrow (via bonds, bank debt or equity), the design of microfinance contracts for the (collateral) poor, questions of regulation, the optimal size of banks and ownership structure of banks and much else.
Wednesday, September 28, 2016
in Room 920 East Building, 1:15 pm (GRECS Seminar)
Algebra in Automata Theory
Presented by Pascal Weil, the Ada Peluso Visiting Professor, Hunter College; Research Professor, National Centre for Scientific Research, Université Bordeaux, France
Abstract:
Automata and formal language theory are cornerstones of theoretical computer science with a strong mathematical flavor. The basic concepts include finite state automata and regular languages. Automata are a natural tool to represent and work on regular languages. Another important tool for specifying regular languages is provided by logic (first order and monadic second order). Logic is a great specification tool, but it does not have good algorithmic properties, and this is where algebra comes into play. With every finite state automaton, we can associate a finite algebraic structure, namely a monoid whose algebraic properties reflect the combinatorial or logical properties of the language accepted by the automaton. The fact that this socalled syntactic monoid is finite and effectively constructible gives us an elegant tool to effectively decide certain properties of regular languages.
Pascal Weil is a Research Professor of the highest rank in the National Centre for Scientific Research. Professor Weil received a Doctorate degree in Informatics from the University of Paris7 in 1985, a PhD in Mathematics from the University of Nebraska Lincoln in 1988, and a Habilitation Degree in Informatics from the University of Paris6 in 1989. He was director of LaBRI (Bordeaux Research Lab in Computer Science) from 2011 to 2015, as well as the Chair of the Scientific Council for Information Sciences (a national council within CNRS) from 2010 to 2014. Professor Weil has over 80 publications (including over 50 journal articles) focused on algebraic methods in computer science, notably in the field of automata and formal language theory and algorithmic and combinatorial problems in group theory.
Wednesday, April 20, 2016
in Room 920 East Building, 1:302:30 pm (GRECS Seminar)
Matrix Identities Involving Multiplication And Transposition
Presented by Mikhail Volkov, Ada Peluso Visiting Professor, Hunter College; Professor of Mathematics, Ural Federal University, Russia
Abstract:
Matrices and matrix operations constitute basic tools for algebra, analysis and many other parts of mathematics. Important properties of matrix operations are often expressed in form of laws or identities such as the associative law for multiplication of matrices. Studying matrix identities that involve multiplication and addition is a classic research direction motivated by several important problems in geometry and algebra. Matrix identities involving along with multiplication and addition also certain involution operations (such as taking the usual or symplectic transpose of a matrix) have attracted much attention as well.
If one aims to classify matrix identities of a certain type, then a natural approach is to look for a collection of "basic" identities such that all other identities would follow from these basic identities. Such a collection is usually referred to as a basis. For instance, all identities of matrices over an infinite field involving multiplication only are known to follow from the associative law. Thus, the associative law forms a basis of such "multiplicative" identities. For identities of matrices over a finite field or a field of characteristic 0 involving both multiplication and addition, the powerful results by Kruse–L'vov and Kemer ensure the existence of a finite basis. In contrast, multiplicative identities of matrices over a finite field admit no finite basis.
Here we consider matrix identities involving multiplication and one or two natural oneplace operations such as taking various transposes or Moore–Penrose inversion. Our results may be summarized as follows.
None of the following sets of matrix identities admits a finite basis:
• the identities of n×nmatrices over a finite field involving multiplication and usual transposition;
• the identities of 2n×2nmatrices over a finite field involving multiplication and symplectic transposition;
• the identities of 2×2matrices over the field of complex numbers involving either multiplication and Moore–Penrose inversion or multiplication, Moore–Penrose inversion and Hermitian conjugation;
Wednesday, February 24, 2016
in Room 920 East Building, 1:002:00 pm (GRECS Seminar)
Road Coloring Theorem
Presented by Mikhail Volkov, Ada Peluso Visiting Professor, Hunter College; Professor of Mathematics, Ural Federal University, Russia
Abstract:
I shall present a recent advance in the theory of finite automata: Avraam Trahtman's proof of the socalled Road Coloring Conjecture by Adler, Goodwyn, and Weiss; the conjecture that admits a formulation in terms of recreational mathematics arose in symbolic dynamics and has important implications in coding theory. The proof is elementary in its essence but clever and enjoyable.
Wednesday, February 17, 2016
in Room 920 East Building, 1:002:00 pm (Departmental
Lecture Series)
Synchronizing finite automata: a problem everyone can understand but nobody can solve (so far)
Presented by Mikhail Volkov, Ada Peluso Visiting Professor, Hunter College; Professor of Mathematics, Ural Federal University, Russia
Abstract:
Most current mathematical research, since the 60s, is devoted to fancy situations: it brings solutions which nobody understands to questions nobody asked” (quoted from Bernard Beauzamy, "Real Life Mathematics", Irish Math. Soc. Bull. 48 (2002), 4346). This provocative claim is certainly exaggerated but it does reflect a really serious problem: a communication barrier between mathematics (and exact science in general) and human common sense. The barrier results in a paradox: while the achievements of modern mathematics are widely used in many crucial aspects of everyday life, people tend to believe that today mathematicians do "abstract nonsense" of no use at all. In most cases it is indeed very difficult to explain to a nonmathematician what mathematicians work with and how their results can be applied in practice. Fortunately, there are some lucky exceptions, and one of them has been chosen as the present talk's topic. It is devoted to a mathematical problem that was frequently asked by both theoreticians and practitioners in many areas of science and engineering. The problem, usually referred to as the synchronization problem, can be roughly described as the task of determining the simplest way to restore control over a device whose current state is not known:– think of a satellite which loops around the Moon and cannot be controlled from the Earth while "behind" the Moon. While easy to understand and practically important, the synchronization problem turns out to be surprisingly hard to solve even for finite automata that constitute the simplest mathematical model of realworld devices. This combination of transparency, usefulness and unexpected hardness should, hopefully, make the talk interesting for a wide audience.
Professor Volkov will also give a semester course on synchronizing automata (Synchronizing Finite Automata: Math 795.64. Th, 7:359:25 pm, Room 921 East). The course is basically selfcontained as it requires almost no prerequisites; in particular, no prior knowledge of automata theory is assumed. The course contains a detailed overview of the current stateoftheart in the theory of synchronizing automata and quickly leads to some recent advances of the theory and a number of tantalizing open problems.
Special Year in Hyperbolic Geometry
Hunter College, City University of New York, Room 920 East Building, Fall 2014Spring 2015
The research theme for the academic year 20142015 will be the subject of hyperbolic geometry and its many related areas. The year will feature a series of lectures, an ongoing seminar, and several visitors. During this period the Ada Peluso Visiting Professors will be
• Athanase Papadopoulos of the Universite de Strasbourg (Fall 2014).
• Hugo Parlier of the University of Fribourg, Switzerland (Spring 2015).
The first two seminars will be given by Ara Basmajian and the next four by Athanase Papadopoulos. For the latest information about the seminar and abstracts for the talks go to the website: http://wfs.gc.cuny.edu/CArettines/hypgeo/index.html
The Schedule
October 1, 2014 A Crash Course on Hyperbolic Surfaces I
October 8 A Crash Course on Hyperbolic Surfaces II
October 15 On Funk Geometry
October 22 Hilbert Problem No. IV
October 29 Spherical and Hyperbolic Geometry
November 5 Spherical and Hyperbolic Trigonometry
November 12 Filling Curves on Hyperbolic Surfaces
November 19 Angles of Intersection on the Punctured Torus
November 26 The Work of Maryam Mirzahani
February 4, 2015 Pants and Infinite Type Surfaces
February 11 Combinatorial Moduli Spaces
February 18 no meeting
February 25 Systolic Inequalities and Kissing Numbers for Surfaces
March 4 presenter, Federica Fanoni (University of Fribourg)
March 11 Chromatic Numbers for Hyperbolic Surfaces
March 18 presenter, Julien Paupert (Arizona State University)
March 25 presenter, Bram Petri (University of Fribourg)
April 1 Curve Graphs, Pants Graphs and Flip Graphs of Surfaces
April 8 no meeting, Spring Break
April 15 no meeting, MSRI Workshop
April 22 no meeting, Identities Workshop
April 29 Puzzles, Triangulations and Moduli Spaces  by Hugo Parlier,
Ada Peluso Visiting Professor, Hunter College; Professor, University of Fribourg
CONTACT: Contact Ara Basmajian (abasmajian@gc.cuny.edu) for further information or questions regarding this special year.
VISITORS: Enter by way of the Hunter West building, located on the southwest corner of Lexington Avenue and 68th Street. After going through security, go up to the 3rd floor and walk across the bridge to the East Building. Take the elevator to the 9th floor, Room 921.
Tuesday, March 12, 2013 in Room 714 West Building, 5:30 pm. (Fourth Distinguished Undergraduate RTG Lecture in Number Theory, a Joint Project of Columbia University, CUNY, and New York University)
Taxicabs and the Sum of Two Cubes
Presented by Joseph H. Silverman
Abstract:
Some numbers, such as 9=1^{3}+2^{3} and 370=3^{3}+7^{3}, can be written as the sum of two cubes. Are there numbers that can be written as the sum of cubes in two (or more) essentially different ways? This elementary question will lead us into beautiful areas of mathematics where number theory, geometry, algebra, calculus, and even internet security interact in surprising ways.
Wednesday, November 7, 2012 in Room 920 East Building, 1:103:00 pm. Lunch and refreshments served following the talk. (Soup and Science Series)
A Knot's Tale For Halloween
Presented by Tatyana Khodorovskiy, Assistant Professor of Mathematics,
Hunter College of the City University of New York.
Abstract:
Knots have appeared many times in human history, from marine knots to Celtic knots to our own knotted up DNA! As a mathematical subject, knot theory began in 1867, when Lord Kelvin was working on creating the periodic table of elements. He proposed that the different chemical properties of atoms can be described by the different ways their tubes of ether are knotted up. He and physicist Peter Tait went on to compose the first table of knots. Well, this particular connection didn’t really pan out so well... Today, however, knot theory is an indispensable part of a field of math called topology. In this talk, I will define what knots are and discuss their role in life and math.
Wednesday, October 24, 2012
in Room 920 East Building, 1:302:30 pm, preceded by a Tea at 1:00 pm (Departmental
Lecture Series)
Overgroup Lattices in Finite Groups
Presented by Levi Biock, BA/MA student in Mathematics,
Hunter College of the City University of New York.
Abstract:
To answer the PalfyPudlak Question, John Shareshian conjectured that a certain class, Dd, of lattices are not overgroup lattices in any finite group. To prove this conjecture one needs to know the structure of a group G and the embedding of a subgroup H in G, such that there are only two maximal overgroups of H in G and H is maximal in both. Towards a proof of this conjecture, we consider the minimal normal subgroups of G and use these minimal normal subgroups to determine the structure of G and determine the embedding of H in G.
This work was carried out at SURF 2012, California Institute of Technology, mentor: Michael Aschbacher.
Wednesday, March 7, 2012
in 224 East Building, 1:102:30 pm (Soup and Science Series)
Using Geometry To Classify Surfaces
Presented by Ara Basmajian, Professor of Mathematics,
Hunter College and the Graduate Center of the City University of New York.
Abstract:
We will begin with the question: What properties do the surface of a basketball
and the surface of a football share? In what sense are they the same?
In what sense are they different? This discussion will lead naturally
to the notion of a surface (a two dimensional space). Next, we introduce
the three basic geometries (euclidean, spherical, hyperbolic) and their
properties. Hyperbolic geometry, though the least known of the three,
plays a prominent, fundamental role in our understanding of surfaces and
the geometries they admit. In fact, we will see thet most surfaces admit
a hyperbolic geometry. We will finish by mentioning some recent work on
three dimensional spaces.
