Author: ADMIN
Great Plains Operator Theory Symposium 2025 (GPOTS 2025) Date: May 19-23, 2025 (Tentative) Location: San Juan, Puerto Rico Invited speakers An, Qingnan – Northeast Normal University Arendt, Wolfgang – University of Ulm Elliott, George – University of Toronto Higson, Nigel – Penn State University Jiang, Chunlan – Hebei Normal University Lin, Huaxin – University of Oregon Liu, Zhichao – Dalian University Liu, Zhengwei – Tsinghua University Lizama, Carlos – University of Santiago de Chile Musat, Magdalena – University of Copenhagen Niu, Zhuang – University of Wyoming Rørdam, Mikael – University of Copenhagen Tang, Xiang – Washington Univ. in St. Louis…
More or less a bounded curve is rectifiable iff it has length. There is a criterion to determine if a curve is rectifiable involving the Jones β number.What is it? What are some examples of the β numbers of the coastline? Does any of this help us understand or control coastline erosion? While we will not exactly answer these questions we will explain what all these terms mean. Hopefully we will encourage everyone to learn more geometric measure theory! This will be a purely expository talk. But the speaker is always willing to talk (offline) about his related research.
Professor Gong’s research interests include: C*-algebra Noncommutative geometry Classification of C*-algebras K-theory
We consider some simplest and most common finite semigroups that arise frequently in many areas of pure and applied mathematics, in particular, cyclic semigroups and bands. We then consider the question which of them have copies in the Stone-Cech compactification of the natural numbers. The latter itself is a compact right topological semigroup with a very complicated structure and important applications to Ramsey theory and to topological dynamics. The first application to Ramsey theory was the proof of Hindman’s theorem (1974): whenever the set of natural numbers is finitely colored, there is an infinite sequence all of whose sums are…
A permutation array is a square binary matrix that contains a single 1 by row and by column. Costas arrays are permutation arrays where the vectors connecting two entries with 1 are distinct. These arrays are useful in applications such as radar and sonar, digital watermarking, and wireless communications in general. In this talk, we will present a generalization of Costas arrays to multiple dimensions, extend the Welch and Lempel constructions to multiple dimensions, and study some of their properties.
An open problem in the theory of discrete dynamical systems is to link the structure of a system with its dynamics. This paper contains such a link for a family of nonlinear systems over the field with two elements. For a family of systems that can be described by monomials (including Boolean AND systems), one can obtain information about the transient of the system from the structure of the monomials. Recent results, see [1], about the Frobenius Number, allow us to present a formula for the transient of fixed-point systems (that is, how long it takes the systems to stabilize)…
Digital communication requires different mechanisms to increase tolerance to errors in communication. Reed-Solomon codes are a class of error-correcting codes defined with polynomials of one variable. Its simple algebraic structure provides many important qualities for protecting against errors. In this talk we will discuss some fundamental concepts of code theory, the construction of Reed-Solomon codes, decoding algorithms and other codes that generalize Reed-Solomon codes.