<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://math.chapman.edu/mathcs/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Jipsen</id>
	<title>MathChapman - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://math.chapman.edu/mathcs/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Jipsen"/>
	<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=Special:Contributions/Jipsen"/>
	<updated>2026-04-08T22:10:58Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=37</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=37"/>
		<updated>2023-02-23T06:46:05Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: /* Speaker: Papiya Battacharjee */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Spring 2023 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held in-person in the &#039;&#039;&#039;Keck Center of Science and Engineering, Room 372&#039;&#039;&#039; (unless a speaker prefers to hold the talk over Zoom). The date and time are included in the announcements below.&lt;br /&gt;
&lt;br /&gt;
=== Monday, March 6, 2023, 12:30 - 1:30 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Papiya Battacharjee, Florida Atlantic University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Martinez Frames and d-Elements&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Given an algebraic frame with FIP (M-frame), we can study the d-operator on such frames. The d-operator is a special type of nucleus on an M-frame which generates the frame of all d-elements, dL. We call an M-frame a Martinez frame if dL=L. During this presentation we will discuss d-elements of an M-frame and give several characterizations of Martinez frames. In the last half of the presentation we will discuss Max(dL), a subspace of Spec(L) consisting of the maximal d-elements of L. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 23, 2023, 4:00 - 5:00 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Ahmed Sebbar, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Graph Theory II, The adjacency matrix and some of its properties&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The adjacency matrix is important in Graph Theory and in Computer Science. We study the properties of its powers and give an interpretation of their coefficients. This prepares us to introduce Ihara&#039;s zeta function of a finite graph and its arithmetic.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2022 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, December 9, 2022, 3:10 - 4:10 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Ahmed Sebbar, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Elementary Graph Theory and Elementary  Number Theory&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We give an introduction to graph theory, adjacency matrices and interpretation of their powers. We define the Ihara Zeta function and compute a few examples. We will briefly discuss Ramanujan graphs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 23, 2021, 12:30 - 1:30 pm in AF 209C ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Lev Vaidman, Tel Aviv University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Counterfactual communication&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Possibility to communicate between spatially separated regions, without even a single photon passing between the two parties, is an amazing quantum phenomenon. The possibility of transmitting one value of a bit in such a way, the interaction-free measurement, was known for a quarter of a century. The protocols of full communication, including transmitting unknown quantum states were proposed only a few years ago, but it was shown that in all these protocols the particle was leaving a weak trace in the transmission channel, the trace larger than the trace left by a single particle passing through the channel.  However, a simple modification of these recent protocols eliminates the trace in the transmission channel and makes all these protocols truly counterfactual.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=36</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=36"/>
		<updated>2023-02-23T06:41:38Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: /* Spring 2023 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Spring 2023 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held in-person in the &#039;&#039;&#039;Keck Center of Science and Engineering, Room 372&#039;&#039;&#039; (unless a speaker prefers to hold the talk over Zoom). The date and time are included in the announcements below.&lt;br /&gt;
&lt;br /&gt;
=== Monday, March 6, 2023, 12:30 - 1:30 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Papiya Battacharjee&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Martinez Frames and d-Elements&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Given an algebraic frame with FIP (M-frame), we can study the d-operator on such frames. The d-operator is a special type of nucleus on an M-frame which generates the frame of all d-elements, dL. We call an M-frame a Martinez frame if dL=L. During this presentation we will discuss d-elements of an M-frame and give several characterizations of Martinez frames. In the last half of the presentation we will discuss Max(dL), a subspace of Spec(L) consisting of the maximal d-elements of L. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 23, 2023, 4:00 - 5:00 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Ahmed Sebbar, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Graph Theory II, The adjacency matrix and some of its properties&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The adjacency matrix is important in Graph Theory and in Computer Science. We study the properties of its powers and give an interpretation of their coefficients. This prepares us to introduce Ihara&#039;s zeta function of a finite graph and its arithmetic.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2022 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, December 9, 2022, 3:10 - 4:10 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Ahmed Sebbar, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Elementary Graph Theory and Elementary  Number Theory&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We give an introduction to graph theory, adjacency matrices and interpretation of their powers. We define the Ihara Zeta function and compute a few examples. We will briefly discuss Ramanujan graphs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 23, 2021, 12:30 - 1:30 pm in AF 209C ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Lev Vaidman, Tel Aviv University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Counterfactual communication&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Possibility to communicate between spatially separated regions, without even a single photon passing between the two parties, is an amazing quantum phenomenon. The possibility of transmitting one value of a bit in such a way, the interaction-free measurement, was known for a quarter of a century. The protocols of full communication, including transmitting unknown quantum states were proposed only a few years ago, but it was shown that in all these protocols the particle was leaving a weak trace in the transmission channel, the trace larger than the trace left by a single particle passing through the channel.  However, a simple modification of these recent protocols eliminates the trace in the transmission channel and makes all these protocols truly counterfactual.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=35</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=35"/>
		<updated>2023-02-23T06:40:08Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: /* Spring 2023 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Spring 2023 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held in-person in the &#039;&#039;&#039;Keck Center of Science and Engineering, Room 372&#039;&#039;&#039; (unless a speaker prefers to hold the talk over Zoom). The date and time are included in the announcements below.&lt;br /&gt;
&lt;br /&gt;
=== Monday, March 6, 2023, 12:30 - 1:30 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Papiya Battacharjee&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Martinez Frames and d-Elements&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Given an algebraic frame with FIP (M-frame), we can study the d-operator on such frames. The d-operator is a special type of nucleus on an M-frame which generates the frame of all d-elements, dL. We call an M-frame a Martinez frame if dL=L. During this presentation we will discuss d-elements of an M-frame and give several characterizations of Martinez frames. In the last half of the presentation we will discuss Max(dL), a subspace of Spec(L) consisting of the maximal d-elements of L. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Ahmed Sebbar, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Graph Theory II, The adjacency matrix and some of its properties&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The adjacency matrix is important in Graph Theory and in Computer Science. We study the properties of its powers and give an interpretation of their coefficients. This prepares us to introduce Ihara&#039;s zeta function of a finite graph and its arithmetic.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2022 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, December 9, 2022, 3:10 - 4:10 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Ahmed Sebbar, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Elementary Graph Theory and Elementary  Number Theory&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We give an introduction to graph theory, adjacency matrices and interpretation of their powers. We define the Ihara Zeta function and compute a few examples. We will briefly discuss Ramanujan graphs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 23, 2021, 12:30 - 1:30 pm in AF 209C ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Lev Vaidman, Tel Aviv University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Counterfactual communication&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Possibility to communicate between spatially separated regions, without even a single photon passing between the two parties, is an amazing quantum phenomenon. The possibility of transmitting one value of a bit in such a way, the interaction-free measurement, was known for a quarter of a century. The protocols of full communication, including transmitting unknown quantum states were proposed only a few years ago, but it was shown that in all these protocols the particle was leaving a weak trace in the transmission channel, the trace larger than the trace left by a single particle passing through the channel.  However, a simple modification of these recent protocols eliminates the trace in the transmission channel and makes all these protocols truly counterfactual.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=34</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=34"/>
		<updated>2023-02-16T23:45:07Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Spring 2023 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held in-person in the &#039;&#039;&#039;Keck Center of Science and Engineering, Room 372&#039;&#039;&#039; (unless a speaker prefers to hold the talk over Zoom). The date and time are included in the announcements below.&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 23, 2023, 4:00 - 5:00 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Ahmed Sebbar, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Graph Theory II, The adjacency matrix and some of its properties&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The adjacency matrix is important in Graph Theory and in Computer Science. We study the properties of its powers and give an interpretation of their coefficients. This prepares us to introduce Ihara&#039;s zeta function of a finite graph and its arithmetic.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2022 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, December 9, 2022, 3:10 - 4:10 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Ahmed Sebbar, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Elementary Graph Theory and Elementary  Number Theory&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We give an introduction to graph theory, adjacency matrices and interpretation of their powers. We define the Ihara Zeta function and compute a few examples. We will briefly discuss Ramanujan graphs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 23, 2021, 12:30 - 1:30 pm in AF 209C ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Lev Vaidman, Tel Aviv University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Counterfactual communication&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Possibility to communicate between spatially separated regions, without even a single photon passing between the two parties, is an amazing quantum phenomenon. The possibility of transmitting one value of a bit in such a way, the interaction-free measurement, was known for a quarter of a century. The protocols of full communication, including transmitting unknown quantum states were proposed only a few years ago, but it was shown that in all these protocols the particle was leaving a weak trace in the transmission channel, the trace larger than the trace left by a single particle passing through the channel.  However, a simple modification of these recent protocols eliminates the trace in the transmission channel and makes all these protocols truly counterfactual.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=33</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=33"/>
		<updated>2022-12-06T01:02:56Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: /* Friday, December 9, 2022, 2:00 - 3:00 pm in Keck 372 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Fall 2022 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held in-person in the &#039;&#039;&#039;Keck Center of Science and Engineering, Room 370&#039;&#039;&#039; (unless a speaker prefers to hold the talk over Zoom). The date and time are included in the announcements below.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, December 9, 2022, 3:10 - 4:10 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Ahmed Sebbar, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Elementary Graph Theory and Elementary  Number Theory&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We give an introduction to graph theory, adjacency matrices and interpretation of their powers. We define the Ihara Zeta function and compute a few examples. We will briefly discuss Ramanujan graphs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 23, 2021, 12:30 - 1:30 pm in AF 209C ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Lev Vaidman, Tel Aviv University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Counterfactual communication&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Possibility to communicate between spatially separated regions, without even a single photon passing between the two parties, is an amazing quantum phenomenon. The possibility of transmitting one value of a bit in such a way, the interaction-free measurement, was known for a quarter of a century. The protocols of full communication, including transmitting unknown quantum states were proposed only a few years ago, but it was shown that in all these protocols the particle was leaving a weak trace in the transmission channel, the trace larger than the trace left by a single particle passing through the channel.  However, a simple modification of these recent protocols eliminates the trace in the transmission channel and makes all these protocols truly counterfactual.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=32</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=32"/>
		<updated>2022-11-18T21:26:44Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Fall 2022 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held in-person in the &#039;&#039;&#039;Keck Center of Science and Engineering, Room 370&#039;&#039;&#039; (unless a speaker prefers to hold the talk over Zoom). The date and time are included in the announcements below.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, December 9, 2022, 2:00 - 3:00 pm in Keck 372 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Ahmed Sebbar, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Elementary Graph Theory and Elementary  Number Theory&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We give an introduction to graph theory, adjacency matrices and interpretation of their powers. We define the Ihara Zeta function and compute a few examples. We will briefly discuss Ramanujan graphs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
== Fall 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 23, 2021, 12:30 - 1:30 pm in AF 209C ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Lev Vaidman, Tel Aviv University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Counterfactual communication&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Possibility to communicate between spatially separated regions, without even a single photon passing between the two parties, is an amazing quantum phenomenon. The possibility of transmitting one value of a bit in such a way, the interaction-free measurement, was known for a quarter of a century. The protocols of full communication, including transmitting unknown quantum states were proposed only a few years ago, but it was shown that in all these protocols the particle was leaving a weak trace in the transmission channel, the trace larger than the trace left by a single particle passing through the channel.  However, a simple modification of these recent protocols eliminates the trace in the transmission channel and makes all these protocols truly counterfactual.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=31</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=31"/>
		<updated>2021-09-17T20:54:14Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: /* Thursday, September 23, 2021, 12:30 - 1:30 pm in AF 209C */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Fall 2021 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held in-person in the &#039;&#039;&#039;Keck Center of Science and Engineering, Room 370&#039;&#039;&#039; (unless a speaker prefers to hold the talk over Zoom). The date and time are included in the announcements below.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, September 23, 2021, 12:30 - 1:30 pm in AF 209C ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Lev Vaidman, Tel Aviv University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Counterfactual communication&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Possibility to communicate between spatially separated regions, without even a single photon passing between the two parties, is an amazing quantum phenomenon. The possibility of transmitting one value of a bit in such a way, the interaction-free measurement, was known for a quarter of a century. The protocols of full communication, including transmitting unknown quantum states were proposed only a few years ago, but it was shown that in all these protocols the particle was leaving a weak trace in the transmission channel, the trace larger than the trace left by a single particle passing through the channel.  However, a simple modification of these recent protocols eliminates the trace in the transmission channel and makes all these protocols truly counterfactual.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=30</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=30"/>
		<updated>2021-09-17T20:41:57Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Fall 2021 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held in-person in the &#039;&#039;&#039;Keck Center of Science and Engineering, Room 370&#039;&#039;&#039; (unless a speaker prefers to hold the talk over Zoom). The date and time are included in the announcements below.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, September 23, 2021, 12:30 - 1:30 pm in AF 209C ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Lev Vaidman&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Counterfactual communication&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Possibility to communicate between spatially separated regions, without even a single photon passing between the two parties, is an amazing quantum phenomenon. The possibility of transmitting one value of a bit in such a way, the interaction-free measurement, was known for a quarter of a century. The protocols of full communication, including transmitting unknown quantum states were proposed only a few years ago, but it was shown that in all these protocols the particle was leaving a weak trace in the transmission channel, the trace larger than the trace left by a single particle passing through the channel.  However, a simple modification of these recent protocols eliminates the trace in the transmission channel and makes all these protocols truly counterfactual.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar_2019&amp;diff=29</id>
		<title>MPC Seminar 2019</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar_2019&amp;diff=29"/>
		<updated>2021-09-17T20:40:34Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
== Fall 2019 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Dec 12th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alí Guzmán Adán, Universiteit Gent, Belgium&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Pizzetti and Cauchy formulae for higher dimensional surfaces: a&lt;br /&gt;
distributional approach&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk, we study Pizzetti-type formulas for Stiefel&lt;br /&gt;
manifolds and Cauchy-type formulas for the tangential Dirac operator&lt;br /&gt;
from a distributional perspective. First, we illustrate a general&lt;br /&gt;
distributional method for integration over manifolds in R^m defined by&lt;br /&gt;
means of k equations. We apply this method to derive an alternative&lt;br /&gt;
proof of the Pizzetti formulae for the real Stiefel manifolds&lt;br /&gt;
SO(m)/SO(m-k). Besides, a distributional interpretation of invariant&lt;br /&gt;
oriented integration is provided. In particular, we obtain a&lt;br /&gt;
distributional Cauchy theorem for the tangential Dirac operator on an&lt;br /&gt;
embedded (m-k)-dimensional smooth surface.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 11th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Arjendu K Pattanayak, Physics and Astronomy, Carleton College, Northfield, Minnesota&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum entanglement and tunneling oscillations in a (few) many-body nonlinear spin system&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Quantum tunnelling permits recoherence or refocusing in real or phase space after the initial quantum state has seemingly delocalized, exhibiting so-called classically forbidden dynamics. For a nonlinearly interacting many-body spin system this interim state can be an entangled state. We report on recent results from investigations into this phenomenon for initially spin coherent pure states in the paradigmatic kicked top (vale Haake) system. This has a mixed regualar and chaotic phase space in the classical limit and exhibits the entanglement tunneling described above,  including coherent dynamics between phase-space stability islands;  here the interim state is maximally entangled. We map the dependence on various parameters including nonlinear spin and number of spins involved (focusing mostly on the remarkable special case N=4) using a metric that attempts to quantify the quality and rate of tunnelling. The calculations of tunneling rates using eigenvalues and eigenstates of the time evolution operator as a function of initial condition compared to classical space structures demonstrates several nontrivial ways in which quantum behavior transitions to classical as the size of the system grows.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 4th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Raphael Drumond, Universidade Federal de Minas Gerais, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The basics of Quantum Darwinism (and its relationship with non-Markovianity)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Some aspects of physical systems described by quantum &lt;br /&gt;
mechanics, most notably the possibility of violating a Bell inequality, &lt;br /&gt;
suggests (to some) or unavoidably implies (to others) that certain &lt;br /&gt;
properties of microscopic systems, like the precise values of position &lt;br /&gt;
and momentum of a fundamental particle, do not have an objective &lt;br /&gt;
reality. This strongly contrasts with the objectivity of properties of &lt;br /&gt;
everyday macroscopic systems like the (rough estimate of) position and &lt;br /&gt;
momentum of a baseball.  Now, how can this objectivity of the &lt;br /&gt;
macroscopic world emerge from a theory where, apparently, not all &lt;br /&gt;
aspects of physical systems are objective? The notion of quantum &lt;br /&gt;
Darwinism, put forward and popularized by Wojciech Zurek, is a path in &lt;br /&gt;
that direction.  In this talk I will discuss the main ideas behind &lt;br /&gt;
quantum Darwinism, explore it in some simple models, and briefly discuss &lt;br /&gt;
its relationship (or the lack of it) with the notion of non-Markovianity &lt;br /&gt;
of quantum dynamical systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Nov 21th, 2019, 12:30 - 1:30 pm in Keck 370, refreshments from 12:15 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Sandu Popescu, University of Bristol, UK&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Exploring the limits of no-backward-in-time signaling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; One of the most routine observations that we make about our world is that we cannot signal backwards in time. So ubiquitous is this understanding that it is often taken as one of the basic laws of Nature. At first glance, this remark seems straightforward. However, as I will show, in probabilistic theories such as quantum mechanics, the consequences of such an assertion are far more involved. In fact, we will see that there is a surprising amount of liberty: some theories even allow the future to affect the past, nevertheless without signaling backwards in time.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, Nov 8th, 2019, 3 - 4 pm in Keck 171, refreshments from 2:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Fredrik Dahlqvist, University College London, UK&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A probabilistic approach to floating point arithmetic&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Finite-precision floating point arithmetic introduces rounding errors which are traditionally bounded using a worst-case analysis. However, worst-case analysis might be overly conservative because worst-case errors can be extremely rare events in practice. Here we develop a probabilistic model of rounding errors with which it becomes possible to quantify the likelihood that the rounding error of an algorithm lies within a given interval. &lt;br /&gt;
&lt;br /&gt;
Given an input distribution, the model requires the distribution of rounding errors. We show how to exactly compute this distribution for low precision arithmetic. For high precision arithmetic we derive a simple but surprisingly useful approximation. The model is then entirely compositional: given a numerical program written in a simple imperative programing language we can recursively compute the distribution of rounding errors at each step and propagate it through each program instruction. This is done by applying a formalism originaly developed by Kozen to understand the semantics of probabilistic programs, for example how probability distributions gets transformed by assignments or &amp;quot;if then else&amp;quot; statements.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Nov 6th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Jacques Pienaar, International Institute of Physics in Natal, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The new question in quantum foundations: what is causality?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Work in quantum foundations has tended to concentrate on Bell&#039;s Theorem, &lt;br /&gt;
but recently a particular aspect of that theorem has taken on a life of &lt;br /&gt;
its own: the question of what &amp;quot;causality&amp;quot; means in quantum mechanics, &lt;br /&gt;
and how to model it. This movement has been driven in large part by &lt;br /&gt;
recent advances in causal modeling in the statistical and Artificial &lt;br /&gt;
Intelligence communities, which have had a heavy influence on quantum &lt;br /&gt;
causal modeling. These &amp;quot;classical&amp;quot; approaches tend to define causality &lt;br /&gt;
as a probabilistic and action-centered concept, which fits well with &lt;br /&gt;
modern information-theoretic treatments of quantum mechanics. However, &lt;br /&gt;
the classical approaches also tend to emphasize notions of underlying &lt;br /&gt;
determinism and objective mechanisms that do not sit so well in the &lt;br /&gt;
quantum context. In this talk I will step back from most of the &lt;br /&gt;
technical jargon and try to get to the heart of some of the conceptual &lt;br /&gt;
issues involved in &amp;quot;quantizing&amp;quot; the concept of causality, critically &lt;br /&gt;
reviewing some key findings, pointing out potential inconsistencies and &lt;br /&gt;
outlining possible directions for further inquiry into this fascinating &lt;br /&gt;
problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 18th, 2019, 12 - 1 pm in Keck 370, refreshments from 11:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Lev Vaidman, Alex Maguy-Glass Chair in Physics of Complex Systems, Tel Aviv University, Israel&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The past of a quantum particle&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Textbooks of quantum mechanics lack the concept of the past of quantum systems. Few years ago I proposed to define the past of a quantum particle according to the trace it leaves. While in many cases this definition provides a reasonable description, for a nested Mach-Zehnder interferometer it leads to a picture seemingly contradicting common sense: the particle leaves a trace in a place through which it could not pass. I will discuss recent theoretical and experimental studies of this controversial issue.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 11th, 2019, 1 - 2 pm in Keck 370, refreshments from 12:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Thomas Curtright, University of Miami&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Massive Dual Gravity Revisited&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will describe a highly speculative model of gravity as a massive,&lt;br /&gt;
pure spin 2 field, which is &amp;quot;dual&amp;quot; to the usual description in terms of&lt;br /&gt;
a spacetime metric tensor.&lt;br /&gt;
&lt;br /&gt;
In the dual description, for weak fields, the metric emerges as the&lt;br /&gt;
field strength of an underlying fundamental field.  More generally, if&lt;br /&gt;
the gravitational field is not weak, the metric emerges as a nonlinear&lt;br /&gt;
mixture involving the energy momentum tensor.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, October 9th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alain Hénaut, Institut de Mathématiques de Bordeaux, Université de Bordeaux, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;On planar web geometry&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Web geometry deals with foliations in general position. In the planar case and the complex setting, a $d$-web is given by the generic family of integral curves of an analytic or an algebraic differential equation $F(x,y,y&#039;)=0$ with $y&#039;$-degree $d$. Invariants of these configurations as abelian relations (related to Abel&#039;s addition theorem), Lie symmetries or Godbillon-Vey sequences are investigated. This viewpoint enlarges the qualitative study of differential equations and their moduli. In the nonsingular case and through the singularities, Cartan-Spencer and meromorphic connections methods will be used. Basic examples will be given from different domains including classic algebraic geometry and WDVV-equations. Standard results and open problems will be mentioned. Illustration of the interplay between differential and algebraic geometry, new results will be presented. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 5th, 2019, 4 - 5 pm in Keck 171, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Nicole Yunger Halpern, Harvard-Smithsonian ITAMP (Institute for Theoretical Atomic, Molecular, and Optical Physics) Harvard University Department of Physics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Entropic uncertainty relations for quantum-information scrambling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; How violently do two quantum operators disagree? Different subfields of physics feature different notions of incompatibility: (i) In quantum information theory, uncertainty relations are cast in terms of entropies. These entropic uncertainty relations constrain measurement outcomes. (ii) Condensed matter and high-energy physics feature interacting quantum many-body systems, such as spin chains. A local perturbation, such as a Pauli operator on one side of a chain, spreads through many-body entanglement. The perturbation comes to overlap, and to disagree, with probes localized on the opposite side of the system. This disagreement signals that quantum information about the perturbation has scrambled, or become hidden in highly nonlocal correlations. I will unite these two notions of quantum operator disagreement, presenting an entropic uncertainty relation for quantum-information scrambling. The entropies are of distributions over weak and strong measurements’ possible outcomes. The uncertainty bound strengthens when a spin chain scrambles in numerical simulations. Hence the subfields—quantum information, condensed matter, and high-energy physics—can agree about when quantum operations disagree. Our relation can be tested experimentally with superconducting qubits, trapped ions, and quantum dots.&lt;br /&gt;
&lt;br /&gt;
NYH, Bartolotta, and Pollack, Comms. Phys. 2, 92 (2019). https://www.nature.com/articles/s42005-019-0179-8&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, August 26, 2019, 7 - 8:30 pm, in Argyros Forum, Room 209 A&amp;amp;B, networking from 6:15 to 7pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Frederick Eberhardt, Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Computing Causal Relations at Scale    or     Causality: From Aristotle through Computing to Zebrafish&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; What causes what? How do we untangle the “why” behind processes that regulate the brain, the climate or the economy? If “Correlation does not imply causation&amp;quot; is the standard mantra in science, how can we ever discover causal relationships behind the data? Will it ever be possible for intelligent AI to make its own deductions and predictions? In recent years researchers have developed mathematical techniques that give us the power to infer the underlying “why” behind scientific data. What’s more, we’ve learned that we can discover these causes without performing experiments. Starting with a little practical example with lightbulbs that can be worked out by hand we will see how the problem scales as the number of variables increases. To compute the neural connections in a zebrafish brain, high performance computing is essential.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Bio:&#039;&#039; Frederick Eberhardt is Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology. Before coming to Caltech he was Assistant Professor in the Philosophy-Neuroscience-Psychology (PNP) program and the Department of Philosophy at Washington University in St. Louis and a postdoc at the Institute of Cognitive and Brain Sciences at the University of California, Berkeley. As an undergraduate he attended the London School of Economics for a Bachelor in Philosophy &amp;amp; Mathematics. He received his PhD in philosophy from Carnegie Mellon University, where he also completed a Masters in Machine Learning.&lt;br /&gt;
&lt;br /&gt;
His research interests lie at the intersection of philosophy of science, machine learning and statistics. He is particularly interested in the development of methods for causal discovery from statistical data.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Spring 2019 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 171&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, May 16, 2019 at 3 pm, in Keck 370, tea and cookies at 2:40pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Purbita Jana, The Institute of Mathematical Sciences, Chennai, India&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Intuitionistic topological systems and their connections with Heyting algebra and Gödel algebra&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; (joint work with Antonio Di Nola and Revaz Grigolia) This talk will suggest a new approach of representation of a Heyting algebra as an I-topological system. I-topological systems will be introduced following the notion of topological system introduced by S. Vickers which is a triple (X, |=, A) consisting of a non-empty set X, a frame A and a relation between X and A satisfying logic of finite observations or geometric logic. It is well known that frame is the Lindenbaum algebra of geometric logic where as the Lindenbaum algebra of intuitionistic logic is a Heyting algebra. Hence to define I-topological systems, intuitionistic logic plays a crucial role. Moreover, we will focus on the categorical relationships between the I-topological system, Esakia space and Heyting algebra (and its particular case of Gödel algebra).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, April 16, 2019 at 5 pm, in Keck 370, tea and cookies at 3:40pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Michele Piazzai, University of Amsterdam, Netherlands&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Ecology of Ideas: Computational Evidence of Self-Organization&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Concepts are cognitive structures that people use to categorize objects and organize their knowledge of the world. Common examples include food and furniture, but also rock&#039;n&#039;roll, quantum physics, and blockchain. For individuals, concepts are the main tools of learning and inference; for groups of individuals (i.e., social systems), they are indispensable instruments of coordination and exchange. But how can the idiosyncratic knowledge of individuals in a social system converge on shared concepts, so as to allow coordination? Conventional wisdom in social science suggests that designated mediators, such as music critics, facilitate this convergence by endorsing the learning and usage of particular concepts. By contrast, I will argue that rational decisions embedded in everyday social interaction provide the necessary and sufficient conditions for concepts&#039; convergence. No mediators are needed for the agents to develop a shared conceptual structure: as commonly occurs in complex adaptive systems, design emerges in the absence of centralized designers. Simulation results are presented that illustrate this point.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 11, 2019 at 4 pm, in Keck 370, tea and cookies at 3:40pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Michele Piazzai, University of Amsterdam, Netherlands&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Ecology of Ideas: Empirical Evidence of Evolutionary Pressure&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Building on the notion that the collective cognition of agents engaged in social interaction constitutes a complex adaptive system, I present a theoretical framework to describe agents&#039; shared conceptual structure as a self-replicating network of objects, ideas, and decisions. Finite cognitive resources at the agents&#039; disposal create a competitive environment where concepts vie to be assigned to objects in categorization decisions, so as to survive in the agents&#039; memory. This struggle for survival gives the socio-cognitive system traits characteristic of an ecology. I identify two sources of ecological interdependence among concepts, including horizontal relations between concepts located at the same level of abstraction and vertical relations between concepts located at different levels. An empirical model is developed to test whether these relations affect the selection of concepts in agents&#039; decisions and the evolution of their shared conceptual structure. To test this model, I analyze one decade&#039;s worth of categorization decisions made by users of a crowd-sourced music encyclopedia whose objective is sorting records into genres and sub-genres.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 28, 2019 at 5 pm, in Keck 171, tea and cookies at 4:40pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Giovanni Sambin, University of Padova, Italy&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Half way to Grothendieck&#039;s aim (embedding of pointwise topology into pointfree topology)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; For a mathematician, the most interesting motivation for a different foundation is when it offers a new perspective or even a solution to an old problem. Developing topology over a very &amp;quot;weak&amp;quot; foundation offers a precise mathematical expression and proof to the expectation, which is well present since the time of Grothendieck, of a notion of space generalising that of topological space.&lt;br /&gt;
The well-known link between pointfree and standard topology (with points) is a categorical adjunction between topological spaces Top and locales Loc. Using a &amp;quot;weak&amp;quot; foundation to develop topology, one is compelled to preserve more information than usual, and thus replace topological spaces with &amp;quot;concrete spaces&amp;quot;, and locales with &amp;quot;positive topologies&amp;quot;. Contrary to a common expectation, it is precisely this &amp;quot;useless&amp;quot; information what offers a solution to Grothendieck&#039;s aim. That is,  the above adjunction becomes a categorical embedding of concrete spaces into positive topologies.&lt;br /&gt;
This embedding does not look possible without exploiting the presence of the new (intrinsically existential) notion of positivity relation.&lt;br /&gt;
Half way because this leaves the problem open of finding a suitable notion of positivity (formal closed subsets) in the framework of arbitrary Grothendieck topologies.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, March 13, 2019 at 4 pm, in Keck 171, tea and cookies at 3:45pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Matt Pusey, University of Oxford&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Anomalous weak values and contextuality: robustness and imaginary&lt;br /&gt;
parts&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will discuss extensions to my previous work linking anomalous weak&lt;br /&gt;
values with contextuality. In particular, I will show that using&lt;br /&gt;
transformation noncontextuality obviates the experimentally&lt;br /&gt;
problematic requirement that the post-selection is projective. I will&lt;br /&gt;
also discuss the status of the imaginary part of weak values. My talk&lt;br /&gt;
will be based on joint work with Ravi Kunjwal and Matteo Lostaglio:&lt;br /&gt;
https://arxiv.org/abs/1812.06940&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, February 27, 2019 at 4 pm, in Keck 171, tea and cookies at 3:45pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Christos Tzounis, California State Polytechnic University, Pomona&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Metric of an Evaporating Black Hole&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We present an approximate time-dependent metric in ingoing Eddington-Finkelstein coordinates for an evaporating nonrotating black hole as a first-order perturbation of the Schwarzschild metric, using the linearized back reaction from a realistic approximation to the stress-energy tensor for the Hawking radiation in the Unruh quantum state.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, February 13, 2019 at 4 pm, in Keck 171, tea and cookies at 3:45pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Peter Rakitzis, Institute of Electronic Structure and Laser, Heraklion, Greece&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Ultrahigh-Density Spin-Polarized H and D Atoms Observed via Magnetization Quantum Beats&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We measure nuclear and electron spin-polarized H and D densities of at least $10^{20}$ cm$^{−3}$ and $10^{19}$ cm$^{−3}$, i.e., at pressures of 5 bar and 0.5 bar, respectively, with ∼10-50 ns lifetimes, from the photodissociation of HBr and DI with circularly polarized UV light pulses. We observe the hyperfine quantum beating of the H and D magnetization with a pickup coil, i.e., the respective 0.7 and 3 ns periodic transfer of polarization from the electrons to the nuclei and back. These pulsed densities are ∼7 orders of magnitude higher than that produced by conventional continuous-production methods, and are sufficient for three novel applications: (a) laser-driven ion acceleration of spin-polarized electrons, protons, or deuterons, (b) the preparation of nuclear-spin-polarized molecules, and (c) the demonstration of spin-polarized D-T or D$^{-3}$He laser fusion at large laser facilities such as NIF, for which a reactivity enhancement of ∼50% is expected.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, February 5 -- Saturday, February 9, 2019  in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;&#039;11th Annual Chapman University CECAT Workshop on Pointfree Mathematics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
TUESDAY, February 5th:&lt;br /&gt;
&lt;br /&gt;
1:00 - 2:00pm &#039;&#039;&#039;M. Andrew Moshier&#039;&#039;&#039;, &#039;&#039;Chapman University&#039;&#039;, Weakening relations&lt;br /&gt;
&lt;br /&gt;
THURSDAY, February 7th:&lt;br /&gt;
&lt;br /&gt;
10:30 - 11:30am: &#039;&#039;&#039;Peter Jipsen&#039;&#039;&#039;, &#039;&#039;Chapman University&#039;&#039;, Involutive residuated lattices and relation algebras&lt;br /&gt;
&lt;br /&gt;
11:30 - 12:30pm: &#039;&#039;&#039;Sara Vannucci&#039;&#039;&#039;, &#039;&#039;University of Salerno&#039;&#039;, Semiring and Semimodule Issues in Residuated Lattices&lt;br /&gt;
&lt;br /&gt;
1:00 - 2:15pm: &#039;&#039;&#039;Rick Ball&#039;&#039;&#039;, &#039;&#039;University of Denver&#039;&#039;, Pointfree Integration&lt;br /&gt;
&lt;br /&gt;
2:15 - 3:15pm:	&#039;&#039;&#039;Anna Laura Suarez&#039;&#039;&#039;, &#039;&#039;University of Birmingham&#039;&#039;, D-frames and frame coproducts&lt;br /&gt;
&lt;br /&gt;
3:30 - 4.30pm: &#039;&#039;&#039;Alex Kurz&#039;&#039;&#039;, &#039;&#039;Chapman University&#039;&#039;, On the duality theory of weakening relations&lt;br /&gt;
&lt;br /&gt;
FRIDAY, February 8th&lt;br /&gt;
&lt;br /&gt;
10:30 - 11:30am: &#039;&#039;&#039;Ales Pultr&#039;&#039;&#039;, &#039;&#039;Charles University&#039;&#039;, Strong Hausdorff properties of frames&lt;br /&gt;
&lt;br /&gt;
11:30 - 12:30pm: &#039;&#039;&#039;Diego Valota&#039;&#039;&#039;, &#039;&#039;University of Milan&#039;&#039;, [http://math.chapman.edu/~jipsen/cecat/11th-Pointfree-Mathematics-Workshop/DiegoValota2019.pdf Computing Spectra via Dualities in the MTL hierarchy]&lt;br /&gt;
&lt;br /&gt;
2:00 - 3:00pm: &#039;&#039;&#039;Olim Tuyt&#039;&#039;&#039;, &#039;&#039;University of Bern&#039;&#039;, Algebraic finite model property of a modal Gödel logic&lt;br /&gt;
&lt;br /&gt;
3:00 - 4:15pm: &#039;&#039;&#039;Rick Ball&#039;&#039;&#039;, &#039;&#039;University of Denver&#039;&#039;, Pointfree Integration, continued&lt;br /&gt;
&lt;br /&gt;
SATURDAY, February 9th&lt;br /&gt;
&lt;br /&gt;
1:00 - 5:00pm: Discussion session&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=28</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=28"/>
		<updated>2021-09-17T20:36:48Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: /* Wednesday, September 22, 2021, 4 - 5 pm in KC 370 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Fall 2021 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held in-person in the &#039;&#039;&#039;Keck Center of Science and Engineering, Room 370&#039;&#039;&#039; (unless a speaker prefers to hold the talk over Zoom). The date and time are included in the announcements below.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, September 23, 2021, 12:30 - 1:30 pm in AF 209C ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Lev Vaidman&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Counterfactual communication&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Possibility to communicate between spatially separated regions, without even a single photon passing between the two parties, is an amazing quantum phenomenon. The possibility of transmitting one value of a bit in such a way, the interaction-free measurement, was known for a quarter of a century. The protocols of full communication, including transmitting unknown quantum states were proposed only a few years ago, but it was shown that in all these protocols the particle was leaving a weak trace in the transmission channel, the trace larger than the trace left by a single particle passing through the channel.  However, a simple modification of these recent protocols eliminates the trace in the transmission channel and makes all these protocols truly counterfactual.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2019 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Dec 12th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alí Guzmán Adán, Universiteit Gent, Belgium&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Pizzetti and Cauchy formulae for higher dimensional surfaces: a&lt;br /&gt;
distributional approach&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk, we study Pizzetti-type formulas for Stiefel&lt;br /&gt;
manifolds and Cauchy-type formulas for the tangential Dirac operator&lt;br /&gt;
from a distributional perspective. First, we illustrate a general&lt;br /&gt;
distributional method for integration over manifolds in R^m defined by&lt;br /&gt;
means of k equations. We apply this method to derive an alternative&lt;br /&gt;
proof of the Pizzetti formulae for the real Stiefel manifolds&lt;br /&gt;
SO(m)/SO(m-k). Besides, a distributional interpretation of invariant&lt;br /&gt;
oriented integration is provided. In particular, we obtain a&lt;br /&gt;
distributional Cauchy theorem for the tangential Dirac operator on an&lt;br /&gt;
embedded (m-k)-dimensional smooth surface.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 11th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Arjendu K Pattanayak, Physics and Astronomy, Carleton College, Northfield, Minnesota&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum entanglement and tunneling oscillations in a (few) many-body nonlinear spin system&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Quantum tunnelling permits recoherence or refocusing in real or phase space after the initial quantum state has seemingly delocalized, exhibiting so-called classically forbidden dynamics. For a nonlinearly interacting many-body spin system this interim state can be an entangled state. We report on recent results from investigations into this phenomenon for initially spin coherent pure states in the paradigmatic kicked top (vale Haake) system. This has a mixed regualar and chaotic phase space in the classical limit and exhibits the entanglement tunneling described above,  including coherent dynamics between phase-space stability islands;  here the interim state is maximally entangled. We map the dependence on various parameters including nonlinear spin and number of spins involved (focusing mostly on the remarkable special case N=4) using a metric that attempts to quantify the quality and rate of tunnelling. The calculations of tunneling rates using eigenvalues and eigenstates of the time evolution operator as a function of initial condition compared to classical space structures demonstrates several nontrivial ways in which quantum behavior transitions to classical as the size of the system grows.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 4th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Raphael Drumond, Universidade Federal de Minas Gerais, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The basics of Quantum Darwinism (and its relationship with non-Markovianity)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Some aspects of physical systems described by quantum &lt;br /&gt;
mechanics, most notably the possibility of violating a Bell inequality, &lt;br /&gt;
suggests (to some) or unavoidably implies (to others) that certain &lt;br /&gt;
properties of microscopic systems, like the precise values of position &lt;br /&gt;
and momentum of a fundamental particle, do not have an objective &lt;br /&gt;
reality. This strongly contrasts with the objectivity of properties of &lt;br /&gt;
everyday macroscopic systems like the (rough estimate of) position and &lt;br /&gt;
momentum of a baseball.  Now, how can this objectivity of the &lt;br /&gt;
macroscopic world emerge from a theory where, apparently, not all &lt;br /&gt;
aspects of physical systems are objective? The notion of quantum &lt;br /&gt;
Darwinism, put forward and popularized by Wojciech Zurek, is a path in &lt;br /&gt;
that direction.  In this talk I will discuss the main ideas behind &lt;br /&gt;
quantum Darwinism, explore it in some simple models, and briefly discuss &lt;br /&gt;
its relationship (or the lack of it) with the notion of non-Markovianity &lt;br /&gt;
of quantum dynamical systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Nov 21th, 2019, 12:30 - 1:30 pm in Keck 370, refreshments from 12:15 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Sandu Popescu, University of Bristol, UK&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Exploring the limits of no-backward-in-time signaling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; One of the most routine observations that we make about our world is that we cannot signal backwards in time. So ubiquitous is this understanding that it is often taken as one of the basic laws of Nature. At first glance, this remark seems straightforward. However, as I will show, in probabilistic theories such as quantum mechanics, the consequences of such an assertion are far more involved. In fact, we will see that there is a surprising amount of liberty: some theories even allow the future to affect the past, nevertheless without signaling backwards in time.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, Nov 8th, 2019, 3 - 4 pm in Keck 171, refreshments from 2:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Fredrik Dahlqvist, University College London, UK&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A probabilistic approach to floating point arithmetic&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Finite-precision floating point arithmetic introduces rounding errors which are traditionally bounded using a worst-case analysis. However, worst-case analysis might be overly conservative because worst-case errors can be extremely rare events in practice. Here we develop a probabilistic model of rounding errors with which it becomes possible to quantify the likelihood that the rounding error of an algorithm lies within a given interval. &lt;br /&gt;
&lt;br /&gt;
Given an input distribution, the model requires the distribution of rounding errors. We show how to exactly compute this distribution for low precision arithmetic. For high precision arithmetic we derive a simple but surprisingly useful approximation. The model is then entirely compositional: given a numerical program written in a simple imperative programing language we can recursively compute the distribution of rounding errors at each step and propagate it through each program instruction. This is done by applying a formalism originaly developed by Kozen to understand the semantics of probabilistic programs, for example how probability distributions gets transformed by assignments or &amp;quot;if then else&amp;quot; statements.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Nov 6th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Jacques Pienaar, International Institute of Physics in Natal, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The new question in quantum foundations: what is causality?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Work in quantum foundations has tended to concentrate on Bell&#039;s Theorem, &lt;br /&gt;
but recently a particular aspect of that theorem has taken on a life of &lt;br /&gt;
its own: the question of what &amp;quot;causality&amp;quot; means in quantum mechanics, &lt;br /&gt;
and how to model it. This movement has been driven in large part by &lt;br /&gt;
recent advances in causal modeling in the statistical and Artificial &lt;br /&gt;
Intelligence communities, which have had a heavy influence on quantum &lt;br /&gt;
causal modeling. These &amp;quot;classical&amp;quot; approaches tend to define causality &lt;br /&gt;
as a probabilistic and action-centered concept, which fits well with &lt;br /&gt;
modern information-theoretic treatments of quantum mechanics. However, &lt;br /&gt;
the classical approaches also tend to emphasize notions of underlying &lt;br /&gt;
determinism and objective mechanisms that do not sit so well in the &lt;br /&gt;
quantum context. In this talk I will step back from most of the &lt;br /&gt;
technical jargon and try to get to the heart of some of the conceptual &lt;br /&gt;
issues involved in &amp;quot;quantizing&amp;quot; the concept of causality, critically &lt;br /&gt;
reviewing some key findings, pointing out potential inconsistencies and &lt;br /&gt;
outlining possible directions for further inquiry into this fascinating &lt;br /&gt;
problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 18th, 2019, 12 - 1 pm in Keck 370, refreshments from 11:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Lev Vaidman, Alex Maguy-Glass Chair in Physics of Complex Systems, Tel Aviv University, Israel&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The past of a quantum particle&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Textbooks of quantum mechanics lack the concept of the past of quantum systems. Few years ago I proposed to define the past of a quantum particle according to the trace it leaves. While in many cases this definition provides a reasonable description, for a nested Mach-Zehnder interferometer it leads to a picture seemingly contradicting common sense: the particle leaves a trace in a place through which it could not pass. I will discuss recent theoretical and experimental studies of this controversial issue.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 11th, 2019, 1 - 2 pm in Keck 370, refreshments from 12:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Thomas Curtright, University of Miami&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Massive Dual Gravity Revisited&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will describe a highly speculative model of gravity as a massive,&lt;br /&gt;
pure spin 2 field, which is &amp;quot;dual&amp;quot; to the usual description in terms of&lt;br /&gt;
a spacetime metric tensor.&lt;br /&gt;
&lt;br /&gt;
In the dual description, for weak fields, the metric emerges as the&lt;br /&gt;
field strength of an underlying fundamental field.  More generally, if&lt;br /&gt;
the gravitational field is not weak, the metric emerges as a nonlinear&lt;br /&gt;
mixture involving the energy momentum tensor.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, October 9th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alain Hénaut, Institut de Mathématiques de Bordeaux, Université de Bordeaux, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;On planar web geometry&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Web geometry deals with foliations in general position. In the planar case and the complex setting, a $d$-web is given by the generic family of integral curves of an analytic or an algebraic differential equation $F(x,y,y&#039;)=0$ with $y&#039;$-degree $d$. Invariants of these configurations as abelian relations (related to Abel&#039;s addition theorem), Lie symmetries or Godbillon-Vey sequences are investigated. This viewpoint enlarges the qualitative study of differential equations and their moduli. In the nonsingular case and through the singularities, Cartan-Spencer and meromorphic connections methods will be used. Basic examples will be given from different domains including classic algebraic geometry and WDVV-equations. Standard results and open problems will be mentioned. Illustration of the interplay between differential and algebraic geometry, new results will be presented. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 5th, 2019, 4 - 5 pm in Keck 171, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Nicole Yunger Halpern, Harvard-Smithsonian ITAMP (Institute for Theoretical Atomic, Molecular, and Optical Physics) Harvard University Department of Physics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Entropic uncertainty relations for quantum-information scrambling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; How violently do two quantum operators disagree? Different subfields of physics feature different notions of incompatibility: (i) In quantum information theory, uncertainty relations are cast in terms of entropies. These entropic uncertainty relations constrain measurement outcomes. (ii) Condensed matter and high-energy physics feature interacting quantum many-body systems, such as spin chains. A local perturbation, such as a Pauli operator on one side of a chain, spreads through many-body entanglement. The perturbation comes to overlap, and to disagree, with probes localized on the opposite side of the system. This disagreement signals that quantum information about the perturbation has scrambled, or become hidden in highly nonlocal correlations. I will unite these two notions of quantum operator disagreement, presenting an entropic uncertainty relation for quantum-information scrambling. The entropies are of distributions over weak and strong measurements’ possible outcomes. The uncertainty bound strengthens when a spin chain scrambles in numerical simulations. Hence the subfields—quantum information, condensed matter, and high-energy physics—can agree about when quantum operations disagree. Our relation can be tested experimentally with superconducting qubits, trapped ions, and quantum dots.&lt;br /&gt;
&lt;br /&gt;
NYH, Bartolotta, and Pollack, Comms. Phys. 2, 92 (2019). https://www.nature.com/articles/s42005-019-0179-8&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, August 26, 2019, 7 - 8:30 pm, in Argyros Forum, Room 209 A&amp;amp;B, networking from 6:15 to 7pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Frederick Eberhardt, Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Computing Causal Relations at Scale    or     Causality: From Aristotle through Computing to Zebrafish&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; What causes what? How do we untangle the “why” behind processes that regulate the brain, the climate or the economy? If “Correlation does not imply causation&amp;quot; is the standard mantra in science, how can we ever discover causal relationships behind the data? Will it ever be possible for intelligent AI to make its own deductions and predictions? In recent years researchers have developed mathematical techniques that give us the power to infer the underlying “why” behind scientific data. What’s more, we’ve learned that we can discover these causes without performing experiments. Starting with a little practical example with lightbulbs that can be worked out by hand we will see how the problem scales as the number of variables increases. To compute the neural connections in a zebrafish brain, high performance computing is essential.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Bio:&#039;&#039; Frederick Eberhardt is Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology. Before coming to Caltech he was Assistant Professor in the Philosophy-Neuroscience-Psychology (PNP) program and the Department of Philosophy at Washington University in St. Louis and a postdoc at the Institute of Cognitive and Brain Sciences at the University of California, Berkeley. As an undergraduate he attended the London School of Economics for a Bachelor in Philosophy &amp;amp; Mathematics. He received his PhD in philosophy from Carnegie Mellon University, where he also completed a Masters in Machine Learning.&lt;br /&gt;
&lt;br /&gt;
His research interests lie at the intersection of philosophy of science, machine learning and statistics. He is particularly interested in the development of methods for causal discovery from statistical data.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=27</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=27"/>
		<updated>2021-09-15T00:49:55Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Fall 2021 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held in-person in the &#039;&#039;&#039;Keck Center of Science and Engineering, Room 370&#039;&#039;&#039; (unless a speaker prefers to hold the talk over Zoom). The date and time are included in the announcements below.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
=== Wednesday, September 22, 2021, 4 - 5 pm in KC 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Lev Vaidman&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Counterfactual communication&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Possibility to communicate between spatially separated regions, without even a single photon passing between the two parties, is an amazing quantum phenomenon. The possibility of transmitting one value of a bit in such a way, the interaction-free measurement, was known for a quarter of a century. The protocols of full communication, including transmitting unknown quantum states were proposed only a few years ago, but it was shown that in all these protocols the particle was leaving a weak trace in the transmission channel, the trace larger than the trace left by a single particle passing through the channel.  However, a simple modification of these recent protocols eliminates the trace in the transmission channel and makes all these protocols truly counterfactual.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2019 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Dec 12th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alí Guzmán Adán, Universiteit Gent, Belgium&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Pizzetti and Cauchy formulae for higher dimensional surfaces: a&lt;br /&gt;
distributional approach&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk, we study Pizzetti-type formulas for Stiefel&lt;br /&gt;
manifolds and Cauchy-type formulas for the tangential Dirac operator&lt;br /&gt;
from a distributional perspective. First, we illustrate a general&lt;br /&gt;
distributional method for integration over manifolds in R^m defined by&lt;br /&gt;
means of k equations. We apply this method to derive an alternative&lt;br /&gt;
proof of the Pizzetti formulae for the real Stiefel manifolds&lt;br /&gt;
SO(m)/SO(m-k). Besides, a distributional interpretation of invariant&lt;br /&gt;
oriented integration is provided. In particular, we obtain a&lt;br /&gt;
distributional Cauchy theorem for the tangential Dirac operator on an&lt;br /&gt;
embedded (m-k)-dimensional smooth surface.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 11th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Arjendu K Pattanayak, Physics and Astronomy, Carleton College, Northfield, Minnesota&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum entanglement and tunneling oscillations in a (few) many-body nonlinear spin system&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Quantum tunnelling permits recoherence or refocusing in real or phase space after the initial quantum state has seemingly delocalized, exhibiting so-called classically forbidden dynamics. For a nonlinearly interacting many-body spin system this interim state can be an entangled state. We report on recent results from investigations into this phenomenon for initially spin coherent pure states in the paradigmatic kicked top (vale Haake) system. This has a mixed regualar and chaotic phase space in the classical limit and exhibits the entanglement tunneling described above,  including coherent dynamics between phase-space stability islands;  here the interim state is maximally entangled. We map the dependence on various parameters including nonlinear spin and number of spins involved (focusing mostly on the remarkable special case N=4) using a metric that attempts to quantify the quality and rate of tunnelling. The calculations of tunneling rates using eigenvalues and eigenstates of the time evolution operator as a function of initial condition compared to classical space structures demonstrates several nontrivial ways in which quantum behavior transitions to classical as the size of the system grows.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 4th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Raphael Drumond, Universidade Federal de Minas Gerais, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The basics of Quantum Darwinism (and its relationship with non-Markovianity)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Some aspects of physical systems described by quantum &lt;br /&gt;
mechanics, most notably the possibility of violating a Bell inequality, &lt;br /&gt;
suggests (to some) or unavoidably implies (to others) that certain &lt;br /&gt;
properties of microscopic systems, like the precise values of position &lt;br /&gt;
and momentum of a fundamental particle, do not have an objective &lt;br /&gt;
reality. This strongly contrasts with the objectivity of properties of &lt;br /&gt;
everyday macroscopic systems like the (rough estimate of) position and &lt;br /&gt;
momentum of a baseball.  Now, how can this objectivity of the &lt;br /&gt;
macroscopic world emerge from a theory where, apparently, not all &lt;br /&gt;
aspects of physical systems are objective? The notion of quantum &lt;br /&gt;
Darwinism, put forward and popularized by Wojciech Zurek, is a path in &lt;br /&gt;
that direction.  In this talk I will discuss the main ideas behind &lt;br /&gt;
quantum Darwinism, explore it in some simple models, and briefly discuss &lt;br /&gt;
its relationship (or the lack of it) with the notion of non-Markovianity &lt;br /&gt;
of quantum dynamical systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Nov 21th, 2019, 12:30 - 1:30 pm in Keck 370, refreshments from 12:15 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Sandu Popescu, University of Bristol, UK&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Exploring the limits of no-backward-in-time signaling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; One of the most routine observations that we make about our world is that we cannot signal backwards in time. So ubiquitous is this understanding that it is often taken as one of the basic laws of Nature. At first glance, this remark seems straightforward. However, as I will show, in probabilistic theories such as quantum mechanics, the consequences of such an assertion are far more involved. In fact, we will see that there is a surprising amount of liberty: some theories even allow the future to affect the past, nevertheless without signaling backwards in time.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, Nov 8th, 2019, 3 - 4 pm in Keck 171, refreshments from 2:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Fredrik Dahlqvist, University College London, UK&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A probabilistic approach to floating point arithmetic&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Finite-precision floating point arithmetic introduces rounding errors which are traditionally bounded using a worst-case analysis. However, worst-case analysis might be overly conservative because worst-case errors can be extremely rare events in practice. Here we develop a probabilistic model of rounding errors with which it becomes possible to quantify the likelihood that the rounding error of an algorithm lies within a given interval. &lt;br /&gt;
&lt;br /&gt;
Given an input distribution, the model requires the distribution of rounding errors. We show how to exactly compute this distribution for low precision arithmetic. For high precision arithmetic we derive a simple but surprisingly useful approximation. The model is then entirely compositional: given a numerical program written in a simple imperative programing language we can recursively compute the distribution of rounding errors at each step and propagate it through each program instruction. This is done by applying a formalism originaly developed by Kozen to understand the semantics of probabilistic programs, for example how probability distributions gets transformed by assignments or &amp;quot;if then else&amp;quot; statements.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Nov 6th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Jacques Pienaar, International Institute of Physics in Natal, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The new question in quantum foundations: what is causality?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Work in quantum foundations has tended to concentrate on Bell&#039;s Theorem, &lt;br /&gt;
but recently a particular aspect of that theorem has taken on a life of &lt;br /&gt;
its own: the question of what &amp;quot;causality&amp;quot; means in quantum mechanics, &lt;br /&gt;
and how to model it. This movement has been driven in large part by &lt;br /&gt;
recent advances in causal modeling in the statistical and Artificial &lt;br /&gt;
Intelligence communities, which have had a heavy influence on quantum &lt;br /&gt;
causal modeling. These &amp;quot;classical&amp;quot; approaches tend to define causality &lt;br /&gt;
as a probabilistic and action-centered concept, which fits well with &lt;br /&gt;
modern information-theoretic treatments of quantum mechanics. However, &lt;br /&gt;
the classical approaches also tend to emphasize notions of underlying &lt;br /&gt;
determinism and objective mechanisms that do not sit so well in the &lt;br /&gt;
quantum context. In this talk I will step back from most of the &lt;br /&gt;
technical jargon and try to get to the heart of some of the conceptual &lt;br /&gt;
issues involved in &amp;quot;quantizing&amp;quot; the concept of causality, critically &lt;br /&gt;
reviewing some key findings, pointing out potential inconsistencies and &lt;br /&gt;
outlining possible directions for further inquiry into this fascinating &lt;br /&gt;
problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 18th, 2019, 12 - 1 pm in Keck 370, refreshments from 11:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Lev Vaidman, Alex Maguy-Glass Chair in Physics of Complex Systems, Tel Aviv University, Israel&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The past of a quantum particle&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Textbooks of quantum mechanics lack the concept of the past of quantum systems. Few years ago I proposed to define the past of a quantum particle according to the trace it leaves. While in many cases this definition provides a reasonable description, for a nested Mach-Zehnder interferometer it leads to a picture seemingly contradicting common sense: the particle leaves a trace in a place through which it could not pass. I will discuss recent theoretical and experimental studies of this controversial issue.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 11th, 2019, 1 - 2 pm in Keck 370, refreshments from 12:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Thomas Curtright, University of Miami&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Massive Dual Gravity Revisited&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will describe a highly speculative model of gravity as a massive,&lt;br /&gt;
pure spin 2 field, which is &amp;quot;dual&amp;quot; to the usual description in terms of&lt;br /&gt;
a spacetime metric tensor.&lt;br /&gt;
&lt;br /&gt;
In the dual description, for weak fields, the metric emerges as the&lt;br /&gt;
field strength of an underlying fundamental field.  More generally, if&lt;br /&gt;
the gravitational field is not weak, the metric emerges as a nonlinear&lt;br /&gt;
mixture involving the energy momentum tensor.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, October 9th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alain Hénaut, Institut de Mathématiques de Bordeaux, Université de Bordeaux, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;On planar web geometry&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Web geometry deals with foliations in general position. In the planar case and the complex setting, a $d$-web is given by the generic family of integral curves of an analytic or an algebraic differential equation $F(x,y,y&#039;)=0$ with $y&#039;$-degree $d$. Invariants of these configurations as abelian relations (related to Abel&#039;s addition theorem), Lie symmetries or Godbillon-Vey sequences are investigated. This viewpoint enlarges the qualitative study of differential equations and their moduli. In the nonsingular case and through the singularities, Cartan-Spencer and meromorphic connections methods will be used. Basic examples will be given from different domains including classic algebraic geometry and WDVV-equations. Standard results and open problems will be mentioned. Illustration of the interplay between differential and algebraic geometry, new results will be presented. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 5th, 2019, 4 - 5 pm in Keck 171, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Nicole Yunger Halpern, Harvard-Smithsonian ITAMP (Institute for Theoretical Atomic, Molecular, and Optical Physics) Harvard University Department of Physics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Entropic uncertainty relations for quantum-information scrambling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; How violently do two quantum operators disagree? Different subfields of physics feature different notions of incompatibility: (i) In quantum information theory, uncertainty relations are cast in terms of entropies. These entropic uncertainty relations constrain measurement outcomes. (ii) Condensed matter and high-energy physics feature interacting quantum many-body systems, such as spin chains. A local perturbation, such as a Pauli operator on one side of a chain, spreads through many-body entanglement. The perturbation comes to overlap, and to disagree, with probes localized on the opposite side of the system. This disagreement signals that quantum information about the perturbation has scrambled, or become hidden in highly nonlocal correlations. I will unite these two notions of quantum operator disagreement, presenting an entropic uncertainty relation for quantum-information scrambling. The entropies are of distributions over weak and strong measurements’ possible outcomes. The uncertainty bound strengthens when a spin chain scrambles in numerical simulations. Hence the subfields—quantum information, condensed matter, and high-energy physics—can agree about when quantum operations disagree. Our relation can be tested experimentally with superconducting qubits, trapped ions, and quantum dots.&lt;br /&gt;
&lt;br /&gt;
NYH, Bartolotta, and Pollack, Comms. Phys. 2, 92 (2019). https://www.nature.com/articles/s42005-019-0179-8&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, August 26, 2019, 7 - 8:30 pm, in Argyros Forum, Room 209 A&amp;amp;B, networking from 6:15 to 7pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Frederick Eberhardt, Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Computing Causal Relations at Scale    or     Causality: From Aristotle through Computing to Zebrafish&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; What causes what? How do we untangle the “why” behind processes that regulate the brain, the climate or the economy? If “Correlation does not imply causation&amp;quot; is the standard mantra in science, how can we ever discover causal relationships behind the data? Will it ever be possible for intelligent AI to make its own deductions and predictions? In recent years researchers have developed mathematical techniques that give us the power to infer the underlying “why” behind scientific data. What’s more, we’ve learned that we can discover these causes without performing experiments. Starting with a little practical example with lightbulbs that can be worked out by hand we will see how the problem scales as the number of variables increases. To compute the neural connections in a zebrafish brain, high performance computing is essential.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Bio:&#039;&#039; Frederick Eberhardt is Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology. Before coming to Caltech he was Assistant Professor in the Philosophy-Neuroscience-Psychology (PNP) program and the Department of Philosophy at Washington University in St. Louis and a postdoc at the Institute of Cognitive and Brain Sciences at the University of California, Berkeley. As an undergraduate he attended the London School of Economics for a Bachelor in Philosophy &amp;amp; Mathematics. He received his PhD in philosophy from Carnegie Mellon University, where he also completed a Masters in Machine Learning.&lt;br /&gt;
&lt;br /&gt;
His research interests lie at the intersection of philosophy of science, machine learning and statistics. He is particularly interested in the development of methods for causal discovery from statistical data.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=26</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=26"/>
		<updated>2021-09-15T00:45:45Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: /* Spring 2021 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Fall 2021 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held in-person in the Keck Center of Science and Engineering, Room 370 (unless a speaker prefers to hold the talk over Zoom). The date and time are included in the announcements below.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2019 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Dec 12th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alí Guzmán Adán, Universiteit Gent, Belgium&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Pizzetti and Cauchy formulae for higher dimensional surfaces: a&lt;br /&gt;
distributional approach&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk, we study Pizzetti-type formulas for Stiefel&lt;br /&gt;
manifolds and Cauchy-type formulas for the tangential Dirac operator&lt;br /&gt;
from a distributional perspective. First, we illustrate a general&lt;br /&gt;
distributional method for integration over manifolds in R^m defined by&lt;br /&gt;
means of k equations. We apply this method to derive an alternative&lt;br /&gt;
proof of the Pizzetti formulae for the real Stiefel manifolds&lt;br /&gt;
SO(m)/SO(m-k). Besides, a distributional interpretation of invariant&lt;br /&gt;
oriented integration is provided. In particular, we obtain a&lt;br /&gt;
distributional Cauchy theorem for the tangential Dirac operator on an&lt;br /&gt;
embedded (m-k)-dimensional smooth surface.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 11th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Arjendu K Pattanayak, Physics and Astronomy, Carleton College, Northfield, Minnesota&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum entanglement and tunneling oscillations in a (few) many-body nonlinear spin system&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Quantum tunnelling permits recoherence or refocusing in real or phase space after the initial quantum state has seemingly delocalized, exhibiting so-called classically forbidden dynamics. For a nonlinearly interacting many-body spin system this interim state can be an entangled state. We report on recent results from investigations into this phenomenon for initially spin coherent pure states in the paradigmatic kicked top (vale Haake) system. This has a mixed regualar and chaotic phase space in the classical limit and exhibits the entanglement tunneling described above,  including coherent dynamics between phase-space stability islands;  here the interim state is maximally entangled. We map the dependence on various parameters including nonlinear spin and number of spins involved (focusing mostly on the remarkable special case N=4) using a metric that attempts to quantify the quality and rate of tunnelling. The calculations of tunneling rates using eigenvalues and eigenstates of the time evolution operator as a function of initial condition compared to classical space structures demonstrates several nontrivial ways in which quantum behavior transitions to classical as the size of the system grows.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 4th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Raphael Drumond, Universidade Federal de Minas Gerais, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The basics of Quantum Darwinism (and its relationship with non-Markovianity)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Some aspects of physical systems described by quantum &lt;br /&gt;
mechanics, most notably the possibility of violating a Bell inequality, &lt;br /&gt;
suggests (to some) or unavoidably implies (to others) that certain &lt;br /&gt;
properties of microscopic systems, like the precise values of position &lt;br /&gt;
and momentum of a fundamental particle, do not have an objective &lt;br /&gt;
reality. This strongly contrasts with the objectivity of properties of &lt;br /&gt;
everyday macroscopic systems like the (rough estimate of) position and &lt;br /&gt;
momentum of a baseball.  Now, how can this objectivity of the &lt;br /&gt;
macroscopic world emerge from a theory where, apparently, not all &lt;br /&gt;
aspects of physical systems are objective? The notion of quantum &lt;br /&gt;
Darwinism, put forward and popularized by Wojciech Zurek, is a path in &lt;br /&gt;
that direction.  In this talk I will discuss the main ideas behind &lt;br /&gt;
quantum Darwinism, explore it in some simple models, and briefly discuss &lt;br /&gt;
its relationship (or the lack of it) with the notion of non-Markovianity &lt;br /&gt;
of quantum dynamical systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Nov 21th, 2019, 12:30 - 1:30 pm in Keck 370, refreshments from 12:15 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Sandu Popescu, University of Bristol, UK&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Exploring the limits of no-backward-in-time signaling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; One of the most routine observations that we make about our world is that we cannot signal backwards in time. So ubiquitous is this understanding that it is often taken as one of the basic laws of Nature. At first glance, this remark seems straightforward. However, as I will show, in probabilistic theories such as quantum mechanics, the consequences of such an assertion are far more involved. In fact, we will see that there is a surprising amount of liberty: some theories even allow the future to affect the past, nevertheless without signaling backwards in time.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, Nov 8th, 2019, 3 - 4 pm in Keck 171, refreshments from 2:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Fredrik Dahlqvist, University College London, UK&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A probabilistic approach to floating point arithmetic&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Finite-precision floating point arithmetic introduces rounding errors which are traditionally bounded using a worst-case analysis. However, worst-case analysis might be overly conservative because worst-case errors can be extremely rare events in practice. Here we develop a probabilistic model of rounding errors with which it becomes possible to quantify the likelihood that the rounding error of an algorithm lies within a given interval. &lt;br /&gt;
&lt;br /&gt;
Given an input distribution, the model requires the distribution of rounding errors. We show how to exactly compute this distribution for low precision arithmetic. For high precision arithmetic we derive a simple but surprisingly useful approximation. The model is then entirely compositional: given a numerical program written in a simple imperative programing language we can recursively compute the distribution of rounding errors at each step and propagate it through each program instruction. This is done by applying a formalism originaly developed by Kozen to understand the semantics of probabilistic programs, for example how probability distributions gets transformed by assignments or &amp;quot;if then else&amp;quot; statements.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Nov 6th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Jacques Pienaar, International Institute of Physics in Natal, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The new question in quantum foundations: what is causality?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Work in quantum foundations has tended to concentrate on Bell&#039;s Theorem, &lt;br /&gt;
but recently a particular aspect of that theorem has taken on a life of &lt;br /&gt;
its own: the question of what &amp;quot;causality&amp;quot; means in quantum mechanics, &lt;br /&gt;
and how to model it. This movement has been driven in large part by &lt;br /&gt;
recent advances in causal modeling in the statistical and Artificial &lt;br /&gt;
Intelligence communities, which have had a heavy influence on quantum &lt;br /&gt;
causal modeling. These &amp;quot;classical&amp;quot; approaches tend to define causality &lt;br /&gt;
as a probabilistic and action-centered concept, which fits well with &lt;br /&gt;
modern information-theoretic treatments of quantum mechanics. However, &lt;br /&gt;
the classical approaches also tend to emphasize notions of underlying &lt;br /&gt;
determinism and objective mechanisms that do not sit so well in the &lt;br /&gt;
quantum context. In this talk I will step back from most of the &lt;br /&gt;
technical jargon and try to get to the heart of some of the conceptual &lt;br /&gt;
issues involved in &amp;quot;quantizing&amp;quot; the concept of causality, critically &lt;br /&gt;
reviewing some key findings, pointing out potential inconsistencies and &lt;br /&gt;
outlining possible directions for further inquiry into this fascinating &lt;br /&gt;
problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 18th, 2019, 12 - 1 pm in Keck 370, refreshments from 11:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Lev Vaidman, Alex Maguy-Glass Chair in Physics of Complex Systems, Tel Aviv University, Israel&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The past of a quantum particle&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Textbooks of quantum mechanics lack the concept of the past of quantum systems. Few years ago I proposed to define the past of a quantum particle according to the trace it leaves. While in many cases this definition provides a reasonable description, for a nested Mach-Zehnder interferometer it leads to a picture seemingly contradicting common sense: the particle leaves a trace in a place through which it could not pass. I will discuss recent theoretical and experimental studies of this controversial issue.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 11th, 2019, 1 - 2 pm in Keck 370, refreshments from 12:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Thomas Curtright, University of Miami&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Massive Dual Gravity Revisited&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will describe a highly speculative model of gravity as a massive,&lt;br /&gt;
pure spin 2 field, which is &amp;quot;dual&amp;quot; to the usual description in terms of&lt;br /&gt;
a spacetime metric tensor.&lt;br /&gt;
&lt;br /&gt;
In the dual description, for weak fields, the metric emerges as the&lt;br /&gt;
field strength of an underlying fundamental field.  More generally, if&lt;br /&gt;
the gravitational field is not weak, the metric emerges as a nonlinear&lt;br /&gt;
mixture involving the energy momentum tensor.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, October 9th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alain Hénaut, Institut de Mathématiques de Bordeaux, Université de Bordeaux, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;On planar web geometry&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Web geometry deals with foliations in general position. In the planar case and the complex setting, a $d$-web is given by the generic family of integral curves of an analytic or an algebraic differential equation $F(x,y,y&#039;)=0$ with $y&#039;$-degree $d$. Invariants of these configurations as abelian relations (related to Abel&#039;s addition theorem), Lie symmetries or Godbillon-Vey sequences are investigated. This viewpoint enlarges the qualitative study of differential equations and their moduli. In the nonsingular case and through the singularities, Cartan-Spencer and meromorphic connections methods will be used. Basic examples will be given from different domains including classic algebraic geometry and WDVV-equations. Standard results and open problems will be mentioned. Illustration of the interplay between differential and algebraic geometry, new results will be presented. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 5th, 2019, 4 - 5 pm in Keck 171, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Nicole Yunger Halpern, Harvard-Smithsonian ITAMP (Institute for Theoretical Atomic, Molecular, and Optical Physics) Harvard University Department of Physics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Entropic uncertainty relations for quantum-information scrambling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; How violently do two quantum operators disagree? Different subfields of physics feature different notions of incompatibility: (i) In quantum information theory, uncertainty relations are cast in terms of entropies. These entropic uncertainty relations constrain measurement outcomes. (ii) Condensed matter and high-energy physics feature interacting quantum many-body systems, such as spin chains. A local perturbation, such as a Pauli operator on one side of a chain, spreads through many-body entanglement. The perturbation comes to overlap, and to disagree, with probes localized on the opposite side of the system. This disagreement signals that quantum information about the perturbation has scrambled, or become hidden in highly nonlocal correlations. I will unite these two notions of quantum operator disagreement, presenting an entropic uncertainty relation for quantum-information scrambling. The entropies are of distributions over weak and strong measurements’ possible outcomes. The uncertainty bound strengthens when a spin chain scrambles in numerical simulations. Hence the subfields—quantum information, condensed matter, and high-energy physics—can agree about when quantum operations disagree. Our relation can be tested experimentally with superconducting qubits, trapped ions, and quantum dots.&lt;br /&gt;
&lt;br /&gt;
NYH, Bartolotta, and Pollack, Comms. Phys. 2, 92 (2019). https://www.nature.com/articles/s42005-019-0179-8&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, August 26, 2019, 7 - 8:30 pm, in Argyros Forum, Room 209 A&amp;amp;B, networking from 6:15 to 7pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Frederick Eberhardt, Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Computing Causal Relations at Scale    or     Causality: From Aristotle through Computing to Zebrafish&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; What causes what? How do we untangle the “why” behind processes that regulate the brain, the climate or the economy? If “Correlation does not imply causation&amp;quot; is the standard mantra in science, how can we ever discover causal relationships behind the data? Will it ever be possible for intelligent AI to make its own deductions and predictions? In recent years researchers have developed mathematical techniques that give us the power to infer the underlying “why” behind scientific data. What’s more, we’ve learned that we can discover these causes without performing experiments. Starting with a little practical example with lightbulbs that can be worked out by hand we will see how the problem scales as the number of variables increases. To compute the neural connections in a zebrafish brain, high performance computing is essential.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Bio:&#039;&#039; Frederick Eberhardt is Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology. Before coming to Caltech he was Assistant Professor in the Philosophy-Neuroscience-Psychology (PNP) program and the Department of Philosophy at Washington University in St. Louis and a postdoc at the Institute of Cognitive and Brain Sciences at the University of California, Berkeley. As an undergraduate he attended the London School of Economics for a Bachelor in Philosophy &amp;amp; Mathematics. He received his PhD in philosophy from Carnegie Mellon University, where he also completed a Masters in Machine Learning.&lt;br /&gt;
&lt;br /&gt;
His research interests lie at the intersection of philosophy of science, machine learning and statistics. He is particularly interested in the development of methods for causal discovery from statistical data.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=25</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=25"/>
		<updated>2021-05-02T18:21:14Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Undo revision 24 by Jipsen (talk)&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held via Zoom for now. The Zoom address will be sent in the email announcements (email jipsen@chapman.edu if you would like to have your email address added to the mailing list).&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2019 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Dec 12th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alí Guzmán Adán, Universiteit Gent, Belgium&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Pizzetti and Cauchy formulae for higher dimensional surfaces: a&lt;br /&gt;
distributional approach&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk, we study Pizzetti-type formulas for Stiefel&lt;br /&gt;
manifolds and Cauchy-type formulas for the tangential Dirac operator&lt;br /&gt;
from a distributional perspective. First, we illustrate a general&lt;br /&gt;
distributional method for integration over manifolds in R^m defined by&lt;br /&gt;
means of k equations. We apply this method to derive an alternative&lt;br /&gt;
proof of the Pizzetti formulae for the real Stiefel manifolds&lt;br /&gt;
SO(m)/SO(m-k). Besides, a distributional interpretation of invariant&lt;br /&gt;
oriented integration is provided. In particular, we obtain a&lt;br /&gt;
distributional Cauchy theorem for the tangential Dirac operator on an&lt;br /&gt;
embedded (m-k)-dimensional smooth surface.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 11th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Arjendu K Pattanayak, Physics and Astronomy, Carleton College, Northfield, Minnesota&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum entanglement and tunneling oscillations in a (few) many-body nonlinear spin system&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Quantum tunnelling permits recoherence or refocusing in real or phase space after the initial quantum state has seemingly delocalized, exhibiting so-called classically forbidden dynamics. For a nonlinearly interacting many-body spin system this interim state can be an entangled state. We report on recent results from investigations into this phenomenon for initially spin coherent pure states in the paradigmatic kicked top (vale Haake) system. This has a mixed regualar and chaotic phase space in the classical limit and exhibits the entanglement tunneling described above,  including coherent dynamics between phase-space stability islands;  here the interim state is maximally entangled. We map the dependence on various parameters including nonlinear spin and number of spins involved (focusing mostly on the remarkable special case N=4) using a metric that attempts to quantify the quality and rate of tunnelling. The calculations of tunneling rates using eigenvalues and eigenstates of the time evolution operator as a function of initial condition compared to classical space structures demonstrates several nontrivial ways in which quantum behavior transitions to classical as the size of the system grows.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 4th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Raphael Drumond, Universidade Federal de Minas Gerais, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The basics of Quantum Darwinism (and its relationship with non-Markovianity)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Some aspects of physical systems described by quantum &lt;br /&gt;
mechanics, most notably the possibility of violating a Bell inequality, &lt;br /&gt;
suggests (to some) or unavoidably implies (to others) that certain &lt;br /&gt;
properties of microscopic systems, like the precise values of position &lt;br /&gt;
and momentum of a fundamental particle, do not have an objective &lt;br /&gt;
reality. This strongly contrasts with the objectivity of properties of &lt;br /&gt;
everyday macroscopic systems like the (rough estimate of) position and &lt;br /&gt;
momentum of a baseball.  Now, how can this objectivity of the &lt;br /&gt;
macroscopic world emerge from a theory where, apparently, not all &lt;br /&gt;
aspects of physical systems are objective? The notion of quantum &lt;br /&gt;
Darwinism, put forward and popularized by Wojciech Zurek, is a path in &lt;br /&gt;
that direction.  In this talk I will discuss the main ideas behind &lt;br /&gt;
quantum Darwinism, explore it in some simple models, and briefly discuss &lt;br /&gt;
its relationship (or the lack of it) with the notion of non-Markovianity &lt;br /&gt;
of quantum dynamical systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Nov 21th, 2019, 12:30 - 1:30 pm in Keck 370, refreshments from 12:15 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Sandu Popescu, University of Bristol, UK&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Exploring the limits of no-backward-in-time signaling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; One of the most routine observations that we make about our world is that we cannot signal backwards in time. So ubiquitous is this understanding that it is often taken as one of the basic laws of Nature. At first glance, this remark seems straightforward. However, as I will show, in probabilistic theories such as quantum mechanics, the consequences of such an assertion are far more involved. In fact, we will see that there is a surprising amount of liberty: some theories even allow the future to affect the past, nevertheless without signaling backwards in time.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, Nov 8th, 2019, 3 - 4 pm in Keck 171, refreshments from 2:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Fredrik Dahlqvist, University College London, UK&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A probabilistic approach to floating point arithmetic&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Finite-precision floating point arithmetic introduces rounding errors which are traditionally bounded using a worst-case analysis. However, worst-case analysis might be overly conservative because worst-case errors can be extremely rare events in practice. Here we develop a probabilistic model of rounding errors with which it becomes possible to quantify the likelihood that the rounding error of an algorithm lies within a given interval. &lt;br /&gt;
&lt;br /&gt;
Given an input distribution, the model requires the distribution of rounding errors. We show how to exactly compute this distribution for low precision arithmetic. For high precision arithmetic we derive a simple but surprisingly useful approximation. The model is then entirely compositional: given a numerical program written in a simple imperative programing language we can recursively compute the distribution of rounding errors at each step and propagate it through each program instruction. This is done by applying a formalism originaly developed by Kozen to understand the semantics of probabilistic programs, for example how probability distributions gets transformed by assignments or &amp;quot;if then else&amp;quot; statements.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Nov 6th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Jacques Pienaar, International Institute of Physics in Natal, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The new question in quantum foundations: what is causality?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Work in quantum foundations has tended to concentrate on Bell&#039;s Theorem, &lt;br /&gt;
but recently a particular aspect of that theorem has taken on a life of &lt;br /&gt;
its own: the question of what &amp;quot;causality&amp;quot; means in quantum mechanics, &lt;br /&gt;
and how to model it. This movement has been driven in large part by &lt;br /&gt;
recent advances in causal modeling in the statistical and Artificial &lt;br /&gt;
Intelligence communities, which have had a heavy influence on quantum &lt;br /&gt;
causal modeling. These &amp;quot;classical&amp;quot; approaches tend to define causality &lt;br /&gt;
as a probabilistic and action-centered concept, which fits well with &lt;br /&gt;
modern information-theoretic treatments of quantum mechanics. However, &lt;br /&gt;
the classical approaches also tend to emphasize notions of underlying &lt;br /&gt;
determinism and objective mechanisms that do not sit so well in the &lt;br /&gt;
quantum context. In this talk I will step back from most of the &lt;br /&gt;
technical jargon and try to get to the heart of some of the conceptual &lt;br /&gt;
issues involved in &amp;quot;quantizing&amp;quot; the concept of causality, critically &lt;br /&gt;
reviewing some key findings, pointing out potential inconsistencies and &lt;br /&gt;
outlining possible directions for further inquiry into this fascinating &lt;br /&gt;
problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 18th, 2019, 12 - 1 pm in Keck 370, refreshments from 11:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Lev Vaidman, Alex Maguy-Glass Chair in Physics of Complex Systems, Tel Aviv University, Israel&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The past of a quantum particle&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Textbooks of quantum mechanics lack the concept of the past of quantum systems. Few years ago I proposed to define the past of a quantum particle according to the trace it leaves. While in many cases this definition provides a reasonable description, for a nested Mach-Zehnder interferometer it leads to a picture seemingly contradicting common sense: the particle leaves a trace in a place through which it could not pass. I will discuss recent theoretical and experimental studies of this controversial issue.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 11th, 2019, 1 - 2 pm in Keck 370, refreshments from 12:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Thomas Curtright, University of Miami&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Massive Dual Gravity Revisited&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will describe a highly speculative model of gravity as a massive,&lt;br /&gt;
pure spin 2 field, which is &amp;quot;dual&amp;quot; to the usual description in terms of&lt;br /&gt;
a spacetime metric tensor.&lt;br /&gt;
&lt;br /&gt;
In the dual description, for weak fields, the metric emerges as the&lt;br /&gt;
field strength of an underlying fundamental field.  More generally, if&lt;br /&gt;
the gravitational field is not weak, the metric emerges as a nonlinear&lt;br /&gt;
mixture involving the energy momentum tensor.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, October 9th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alain Hénaut, Institut de Mathématiques de Bordeaux, Université de Bordeaux, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;On planar web geometry&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Web geometry deals with foliations in general position. In the planar case and the complex setting, a $d$-web is given by the generic family of integral curves of an analytic or an algebraic differential equation $F(x,y,y&#039;)=0$ with $y&#039;$-degree $d$. Invariants of these configurations as abelian relations (related to Abel&#039;s addition theorem), Lie symmetries or Godbillon-Vey sequences are investigated. This viewpoint enlarges the qualitative study of differential equations and their moduli. In the nonsingular case and through the singularities, Cartan-Spencer and meromorphic connections methods will be used. Basic examples will be given from different domains including classic algebraic geometry and WDVV-equations. Standard results and open problems will be mentioned. Illustration of the interplay between differential and algebraic geometry, new results will be presented. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 5th, 2019, 4 - 5 pm in Keck 171, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Nicole Yunger Halpern, Harvard-Smithsonian ITAMP (Institute for Theoretical Atomic, Molecular, and Optical Physics) Harvard University Department of Physics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Entropic uncertainty relations for quantum-information scrambling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; How violently do two quantum operators disagree? Different subfields of physics feature different notions of incompatibility: (i) In quantum information theory, uncertainty relations are cast in terms of entropies. These entropic uncertainty relations constrain measurement outcomes. (ii) Condensed matter and high-energy physics feature interacting quantum many-body systems, such as spin chains. A local perturbation, such as a Pauli operator on one side of a chain, spreads through many-body entanglement. The perturbation comes to overlap, and to disagree, with probes localized on the opposite side of the system. This disagreement signals that quantum information about the perturbation has scrambled, or become hidden in highly nonlocal correlations. I will unite these two notions of quantum operator disagreement, presenting an entropic uncertainty relation for quantum-information scrambling. The entropies are of distributions over weak and strong measurements’ possible outcomes. The uncertainty bound strengthens when a spin chain scrambles in numerical simulations. Hence the subfields—quantum information, condensed matter, and high-energy physics—can agree about when quantum operations disagree. Our relation can be tested experimentally with superconducting qubits, trapped ions, and quantum dots.&lt;br /&gt;
&lt;br /&gt;
NYH, Bartolotta, and Pollack, Comms. Phys. 2, 92 (2019). https://www.nature.com/articles/s42005-019-0179-8&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, August 26, 2019, 7 - 8:30 pm, in Argyros Forum, Room 209 A&amp;amp;B, networking from 6:15 to 7pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Frederick Eberhardt, Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Computing Causal Relations at Scale    or     Causality: From Aristotle through Computing to Zebrafish&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; What causes what? How do we untangle the “why” behind processes that regulate the brain, the climate or the economy? If “Correlation does not imply causation&amp;quot; is the standard mantra in science, how can we ever discover causal relationships behind the data? Will it ever be possible for intelligent AI to make its own deductions and predictions? In recent years researchers have developed mathematical techniques that give us the power to infer the underlying “why” behind scientific data. What’s more, we’ve learned that we can discover these causes without performing experiments. Starting with a little practical example with lightbulbs that can be worked out by hand we will see how the problem scales as the number of variables increases. To compute the neural connections in a zebrafish brain, high performance computing is essential.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Bio:&#039;&#039; Frederick Eberhardt is Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology. Before coming to Caltech he was Assistant Professor in the Philosophy-Neuroscience-Psychology (PNP) program and the Department of Philosophy at Washington University in St. Louis and a postdoc at the Institute of Cognitive and Brain Sciences at the University of California, Berkeley. As an undergraduate he attended the London School of Economics for a Bachelor in Philosophy &amp;amp; Mathematics. He received his PhD in philosophy from Carnegie Mellon University, where he also completed a Masters in Machine Learning.&lt;br /&gt;
&lt;br /&gt;
His research interests lie at the intersection of philosophy of science, machine learning and statistics. He is particularly interested in the development of methods for causal discovery from statistical data.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=24</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=24"/>
		<updated>2021-05-02T18:19:37Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held via Zoom for now. The Zoom address will be sent in the email announcements.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2019 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Dec 12th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alí Guzmán Adán, Universiteit Gent, Belgium&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Pizzetti and Cauchy formulae for higher dimensional surfaces: a&lt;br /&gt;
distributional approach&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk, we study Pizzetti-type formulas for Stiefel&lt;br /&gt;
manifolds and Cauchy-type formulas for the tangential Dirac operator&lt;br /&gt;
from a distributional perspective. First, we illustrate a general&lt;br /&gt;
distributional method for integration over manifolds in R^m defined by&lt;br /&gt;
means of k equations. We apply this method to derive an alternative&lt;br /&gt;
proof of the Pizzetti formulae for the real Stiefel manifolds&lt;br /&gt;
SO(m)/SO(m-k). Besides, a distributional interpretation of invariant&lt;br /&gt;
oriented integration is provided. In particular, we obtain a&lt;br /&gt;
distributional Cauchy theorem for the tangential Dirac operator on an&lt;br /&gt;
embedded (m-k)-dimensional smooth surface.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 11th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Arjendu K Pattanayak, Physics and Astronomy, Carleton College, Northfield, Minnesota&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum entanglement and tunneling oscillations in a (few) many-body nonlinear spin system&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Quantum tunnelling permits recoherence or refocusing in real or phase space after the initial quantum state has seemingly delocalized, exhibiting so-called classically forbidden dynamics. For a nonlinearly interacting many-body spin system this interim state can be an entangled state. We report on recent results from investigations into this phenomenon for initially spin coherent pure states in the paradigmatic kicked top (vale Haake) system. This has a mixed regualar and chaotic phase space in the classical limit and exhibits the entanglement tunneling described above,  including coherent dynamics between phase-space stability islands;  here the interim state is maximally entangled. We map the dependence on various parameters including nonlinear spin and number of spins involved (focusing mostly on the remarkable special case N=4) using a metric that attempts to quantify the quality and rate of tunnelling. The calculations of tunneling rates using eigenvalues and eigenstates of the time evolution operator as a function of initial condition compared to classical space structures demonstrates several nontrivial ways in which quantum behavior transitions to classical as the size of the system grows.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 4th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Raphael Drumond, Universidade Federal de Minas Gerais, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The basics of Quantum Darwinism (and its relationship with non-Markovianity)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Some aspects of physical systems described by quantum &lt;br /&gt;
mechanics, most notably the possibility of violating a Bell inequality, &lt;br /&gt;
suggests (to some) or unavoidably implies (to others) that certain &lt;br /&gt;
properties of microscopic systems, like the precise values of position &lt;br /&gt;
and momentum of a fundamental particle, do not have an objective &lt;br /&gt;
reality. This strongly contrasts with the objectivity of properties of &lt;br /&gt;
everyday macroscopic systems like the (rough estimate of) position and &lt;br /&gt;
momentum of a baseball.  Now, how can this objectivity of the &lt;br /&gt;
macroscopic world emerge from a theory where, apparently, not all &lt;br /&gt;
aspects of physical systems are objective? The notion of quantum &lt;br /&gt;
Darwinism, put forward and popularized by Wojciech Zurek, is a path in &lt;br /&gt;
that direction.  In this talk I will discuss the main ideas behind &lt;br /&gt;
quantum Darwinism, explore it in some simple models, and briefly discuss &lt;br /&gt;
its relationship (or the lack of it) with the notion of non-Markovianity &lt;br /&gt;
of quantum dynamical systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Nov 21th, 2019, 12:30 - 1:30 pm in Keck 370, refreshments from 12:15 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Sandu Popescu, University of Bristol, UK&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Exploring the limits of no-backward-in-time signaling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; One of the most routine observations that we make about our world is that we cannot signal backwards in time. So ubiquitous is this understanding that it is often taken as one of the basic laws of Nature. At first glance, this remark seems straightforward. However, as I will show, in probabilistic theories such as quantum mechanics, the consequences of such an assertion are far more involved. In fact, we will see that there is a surprising amount of liberty: some theories even allow the future to affect the past, nevertheless without signaling backwards in time.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, Nov 8th, 2019, 3 - 4 pm in Keck 171, refreshments from 2:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Fredrik Dahlqvist, University College London, UK&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A probabilistic approach to floating point arithmetic&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Finite-precision floating point arithmetic introduces rounding errors which are traditionally bounded using a worst-case analysis. However, worst-case analysis might be overly conservative because worst-case errors can be extremely rare events in practice. Here we develop a probabilistic model of rounding errors with which it becomes possible to quantify the likelihood that the rounding error of an algorithm lies within a given interval. &lt;br /&gt;
&lt;br /&gt;
Given an input distribution, the model requires the distribution of rounding errors. We show how to exactly compute this distribution for low precision arithmetic. For high precision arithmetic we derive a simple but surprisingly useful approximation. The model is then entirely compositional: given a numerical program written in a simple imperative programing language we can recursively compute the distribution of rounding errors at each step and propagate it through each program instruction. This is done by applying a formalism originaly developed by Kozen to understand the semantics of probabilistic programs, for example how probability distributions gets transformed by assignments or &amp;quot;if then else&amp;quot; statements.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Nov 6th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Jacques Pienaar, International Institute of Physics in Natal, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The new question in quantum foundations: what is causality?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Work in quantum foundations has tended to concentrate on Bell&#039;s Theorem, &lt;br /&gt;
but recently a particular aspect of that theorem has taken on a life of &lt;br /&gt;
its own: the question of what &amp;quot;causality&amp;quot; means in quantum mechanics, &lt;br /&gt;
and how to model it. This movement has been driven in large part by &lt;br /&gt;
recent advances in causal modeling in the statistical and Artificial &lt;br /&gt;
Intelligence communities, which have had a heavy influence on quantum &lt;br /&gt;
causal modeling. These &amp;quot;classical&amp;quot; approaches tend to define causality &lt;br /&gt;
as a probabilistic and action-centered concept, which fits well with &lt;br /&gt;
modern information-theoretic treatments of quantum mechanics. However, &lt;br /&gt;
the classical approaches also tend to emphasize notions of underlying &lt;br /&gt;
determinism and objective mechanisms that do not sit so well in the &lt;br /&gt;
quantum context. In this talk I will step back from most of the &lt;br /&gt;
technical jargon and try to get to the heart of some of the conceptual &lt;br /&gt;
issues involved in &amp;quot;quantizing&amp;quot; the concept of causality, critically &lt;br /&gt;
reviewing some key findings, pointing out potential inconsistencies and &lt;br /&gt;
outlining possible directions for further inquiry into this fascinating &lt;br /&gt;
problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 18th, 2019, 12 - 1 pm in Keck 370, refreshments from 11:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Lev Vaidman, Alex Maguy-Glass Chair in Physics of Complex Systems, Tel Aviv University, Israel&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The past of a quantum particle&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Textbooks of quantum mechanics lack the concept of the past of quantum systems. Few years ago I proposed to define the past of a quantum particle according to the trace it leaves. While in many cases this definition provides a reasonable description, for a nested Mach-Zehnder interferometer it leads to a picture seemingly contradicting common sense: the particle leaves a trace in a place through which it could not pass. I will discuss recent theoretical and experimental studies of this controversial issue.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 11th, 2019, 1 - 2 pm in Keck 370, refreshments from 12:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Thomas Curtright, University of Miami&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Massive Dual Gravity Revisited&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will describe a highly speculative model of gravity as a massive,&lt;br /&gt;
pure spin 2 field, which is &amp;quot;dual&amp;quot; to the usual description in terms of&lt;br /&gt;
a spacetime metric tensor.&lt;br /&gt;
&lt;br /&gt;
In the dual description, for weak fields, the metric emerges as the&lt;br /&gt;
field strength of an underlying fundamental field.  More generally, if&lt;br /&gt;
the gravitational field is not weak, the metric emerges as a nonlinear&lt;br /&gt;
mixture involving the energy momentum tensor.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, October 9th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alain Hénaut, Institut de Mathématiques de Bordeaux, Université de Bordeaux, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;On planar web geometry&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Web geometry deals with foliations in general position. In the planar case and the complex setting, a $d$-web is given by the generic family of integral curves of an analytic or an algebraic differential equation $F(x,y,y&#039;)=0$ with $y&#039;$-degree $d$. Invariants of these configurations as abelian relations (related to Abel&#039;s addition theorem), Lie symmetries or Godbillon-Vey sequences are investigated. This viewpoint enlarges the qualitative study of differential equations and their moduli. In the nonsingular case and through the singularities, Cartan-Spencer and meromorphic connections methods will be used. Basic examples will be given from different domains including classic algebraic geometry and WDVV-equations. Standard results and open problems will be mentioned. Illustration of the interplay between differential and algebraic geometry, new results will be presented. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 5th, 2019, 4 - 5 pm in Keck 171, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Nicole Yunger Halpern, Harvard-Smithsonian ITAMP (Institute for Theoretical Atomic, Molecular, and Optical Physics) Harvard University Department of Physics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Entropic uncertainty relations for quantum-information scrambling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; How violently do two quantum operators disagree? Different subfields of physics feature different notions of incompatibility: (i) In quantum information theory, uncertainty relations are cast in terms of entropies. These entropic uncertainty relations constrain measurement outcomes. (ii) Condensed matter and high-energy physics feature interacting quantum many-body systems, such as spin chains. A local perturbation, such as a Pauli operator on one side of a chain, spreads through many-body entanglement. The perturbation comes to overlap, and to disagree, with probes localized on the opposite side of the system. This disagreement signals that quantum information about the perturbation has scrambled, or become hidden in highly nonlocal correlations. I will unite these two notions of quantum operator disagreement, presenting an entropic uncertainty relation for quantum-information scrambling. The entropies are of distributions over weak and strong measurements’ possible outcomes. The uncertainty bound strengthens when a spin chain scrambles in numerical simulations. Hence the subfields—quantum information, condensed matter, and high-energy physics—can agree about when quantum operations disagree. Our relation can be tested experimentally with superconducting qubits, trapped ions, and quantum dots.&lt;br /&gt;
&lt;br /&gt;
NYH, Bartolotta, and Pollack, Comms. Phys. 2, 92 (2019). https://www.nature.com/articles/s42005-019-0179-8&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, August 26, 2019, 7 - 8:30 pm, in Argyros Forum, Room 209 A&amp;amp;B, networking from 6:15 to 7pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Frederick Eberhardt, Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Computing Causal Relations at Scale    or     Causality: From Aristotle through Computing to Zebrafish&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; What causes what? How do we untangle the “why” behind processes that regulate the brain, the climate or the economy? If “Correlation does not imply causation&amp;quot; is the standard mantra in science, how can we ever discover causal relationships behind the data? Will it ever be possible for intelligent AI to make its own deductions and predictions? In recent years researchers have developed mathematical techniques that give us the power to infer the underlying “why” behind scientific data. What’s more, we’ve learned that we can discover these causes without performing experiments. Starting with a little practical example with lightbulbs that can be worked out by hand we will see how the problem scales as the number of variables increases. To compute the neural connections in a zebrafish brain, high performance computing is essential.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Bio:&#039;&#039; Frederick Eberhardt is Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology. Before coming to Caltech he was Assistant Professor in the Philosophy-Neuroscience-Psychology (PNP) program and the Department of Philosophy at Washington University in St. Louis and a postdoc at the Institute of Cognitive and Brain Sciences at the University of California, Berkeley. As an undergraduate he attended the London School of Economics for a Bachelor in Philosophy &amp;amp; Mathematics. He received his PhD in philosophy from Carnegie Mellon University, where he also completed a Masters in Machine Learning.&lt;br /&gt;
&lt;br /&gt;
His research interests lie at the intersection of philosophy of science, machine learning and statistics. He is particularly interested in the development of methods for causal discovery from statistical data.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=23</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=23"/>
		<updated>2021-05-02T18:17:07Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held via Zoom for now. The Zoom address will be sent in the email announcements (email jipsen@chapman.edu if you would like to have your email address added to the mailing list).&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, May 3rd, 2021, 1 - 2 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Henry, University of Ottawa&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Localic C*-algebras and the Geometric Bohr topos&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Bohr topos is a space attached to a C*-algebra A that has been introduced in the hope of producing a new point of view on the mathematics of Quantum mechanics. It is essentially the &amp;quot;space of commutative sub-C*-algebra of A&amp;quot;. But its original construction had two problems: (1) it had &amp;quot;the wrong topology&amp;quot; and (2) it was a &amp;quot;non-geometric&amp;quot; construction, i.e. when applied to continuous families of C*-algebras, it wasn&#039;t compatible with certain change-of-base functors. In this talk I&#039;ll explain how the theory of localic C*-algebras and some classical idea from &amp;quot;geometric logic&amp;quot; allows to give a new version of this construction that solves both of these problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://arxiv.org/pdf/1502.01896.pdf arxiv.org/pdf/1502.01896.pdf]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2019 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Dec 12th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alí Guzmán Adán, Universiteit Gent, Belgium&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Pizzetti and Cauchy formulae for higher dimensional surfaces: a&lt;br /&gt;
distributional approach&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk, we study Pizzetti-type formulas for Stiefel&lt;br /&gt;
manifolds and Cauchy-type formulas for the tangential Dirac operator&lt;br /&gt;
from a distributional perspective. First, we illustrate a general&lt;br /&gt;
distributional method for integration over manifolds in R^m defined by&lt;br /&gt;
means of k equations. We apply this method to derive an alternative&lt;br /&gt;
proof of the Pizzetti formulae for the real Stiefel manifolds&lt;br /&gt;
SO(m)/SO(m-k). Besides, a distributional interpretation of invariant&lt;br /&gt;
oriented integration is provided. In particular, we obtain a&lt;br /&gt;
distributional Cauchy theorem for the tangential Dirac operator on an&lt;br /&gt;
embedded (m-k)-dimensional smooth surface.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 11th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Arjendu K Pattanayak, Physics and Astronomy, Carleton College, Northfield, Minnesota&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum entanglement and tunneling oscillations in a (few) many-body nonlinear spin system&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Quantum tunnelling permits recoherence or refocusing in real or phase space after the initial quantum state has seemingly delocalized, exhibiting so-called classically forbidden dynamics. For a nonlinearly interacting many-body spin system this interim state can be an entangled state. We report on recent results from investigations into this phenomenon for initially spin coherent pure states in the paradigmatic kicked top (vale Haake) system. This has a mixed regualar and chaotic phase space in the classical limit and exhibits the entanglement tunneling described above,  including coherent dynamics between phase-space stability islands;  here the interim state is maximally entangled. We map the dependence on various parameters including nonlinear spin and number of spins involved (focusing mostly on the remarkable special case N=4) using a metric that attempts to quantify the quality and rate of tunnelling. The calculations of tunneling rates using eigenvalues and eigenstates of the time evolution operator as a function of initial condition compared to classical space structures demonstrates several nontrivial ways in which quantum behavior transitions to classical as the size of the system grows.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 4th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Raphael Drumond, Universidade Federal de Minas Gerais, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The basics of Quantum Darwinism (and its relationship with non-Markovianity)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Some aspects of physical systems described by quantum &lt;br /&gt;
mechanics, most notably the possibility of violating a Bell inequality, &lt;br /&gt;
suggests (to some) or unavoidably implies (to others) that certain &lt;br /&gt;
properties of microscopic systems, like the precise values of position &lt;br /&gt;
and momentum of a fundamental particle, do not have an objective &lt;br /&gt;
reality. This strongly contrasts with the objectivity of properties of &lt;br /&gt;
everyday macroscopic systems like the (rough estimate of) position and &lt;br /&gt;
momentum of a baseball.  Now, how can this objectivity of the &lt;br /&gt;
macroscopic world emerge from a theory where, apparently, not all &lt;br /&gt;
aspects of physical systems are objective? The notion of quantum &lt;br /&gt;
Darwinism, put forward and popularized by Wojciech Zurek, is a path in &lt;br /&gt;
that direction.  In this talk I will discuss the main ideas behind &lt;br /&gt;
quantum Darwinism, explore it in some simple models, and briefly discuss &lt;br /&gt;
its relationship (or the lack of it) with the notion of non-Markovianity &lt;br /&gt;
of quantum dynamical systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Nov 21th, 2019, 12:30 - 1:30 pm in Keck 370, refreshments from 12:15 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Sandu Popescu, University of Bristol, UK&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Exploring the limits of no-backward-in-time signaling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; One of the most routine observations that we make about our world is that we cannot signal backwards in time. So ubiquitous is this understanding that it is often taken as one of the basic laws of Nature. At first glance, this remark seems straightforward. However, as I will show, in probabilistic theories such as quantum mechanics, the consequences of such an assertion are far more involved. In fact, we will see that there is a surprising amount of liberty: some theories even allow the future to affect the past, nevertheless without signaling backwards in time.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, Nov 8th, 2019, 3 - 4 pm in Keck 171, refreshments from 2:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Fredrik Dahlqvist, University College London, UK&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A probabilistic approach to floating point arithmetic&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Finite-precision floating point arithmetic introduces rounding errors which are traditionally bounded using a worst-case analysis. However, worst-case analysis might be overly conservative because worst-case errors can be extremely rare events in practice. Here we develop a probabilistic model of rounding errors with which it becomes possible to quantify the likelihood that the rounding error of an algorithm lies within a given interval. &lt;br /&gt;
&lt;br /&gt;
Given an input distribution, the model requires the distribution of rounding errors. We show how to exactly compute this distribution for low precision arithmetic. For high precision arithmetic we derive a simple but surprisingly useful approximation. The model is then entirely compositional: given a numerical program written in a simple imperative programing language we can recursively compute the distribution of rounding errors at each step and propagate it through each program instruction. This is done by applying a formalism originaly developed by Kozen to understand the semantics of probabilistic programs, for example how probability distributions gets transformed by assignments or &amp;quot;if then else&amp;quot; statements.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Nov 6th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Jacques Pienaar, International Institute of Physics in Natal, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The new question in quantum foundations: what is causality?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Work in quantum foundations has tended to concentrate on Bell&#039;s Theorem, &lt;br /&gt;
but recently a particular aspect of that theorem has taken on a life of &lt;br /&gt;
its own: the question of what &amp;quot;causality&amp;quot; means in quantum mechanics, &lt;br /&gt;
and how to model it. This movement has been driven in large part by &lt;br /&gt;
recent advances in causal modeling in the statistical and Artificial &lt;br /&gt;
Intelligence communities, which have had a heavy influence on quantum &lt;br /&gt;
causal modeling. These &amp;quot;classical&amp;quot; approaches tend to define causality &lt;br /&gt;
as a probabilistic and action-centered concept, which fits well with &lt;br /&gt;
modern information-theoretic treatments of quantum mechanics. However, &lt;br /&gt;
the classical approaches also tend to emphasize notions of underlying &lt;br /&gt;
determinism and objective mechanisms that do not sit so well in the &lt;br /&gt;
quantum context. In this talk I will step back from most of the &lt;br /&gt;
technical jargon and try to get to the heart of some of the conceptual &lt;br /&gt;
issues involved in &amp;quot;quantizing&amp;quot; the concept of causality, critically &lt;br /&gt;
reviewing some key findings, pointing out potential inconsistencies and &lt;br /&gt;
outlining possible directions for further inquiry into this fascinating &lt;br /&gt;
problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 18th, 2019, 12 - 1 pm in Keck 370, refreshments from 11:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Lev Vaidman, Alex Maguy-Glass Chair in Physics of Complex Systems, Tel Aviv University, Israel&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The past of a quantum particle&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Textbooks of quantum mechanics lack the concept of the past of quantum systems. Few years ago I proposed to define the past of a quantum particle according to the trace it leaves. While in many cases this definition provides a reasonable description, for a nested Mach-Zehnder interferometer it leads to a picture seemingly contradicting common sense: the particle leaves a trace in a place through which it could not pass. I will discuss recent theoretical and experimental studies of this controversial issue.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 11th, 2019, 1 - 2 pm in Keck 370, refreshments from 12:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Thomas Curtright, University of Miami&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Massive Dual Gravity Revisited&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will describe a highly speculative model of gravity as a massive,&lt;br /&gt;
pure spin 2 field, which is &amp;quot;dual&amp;quot; to the usual description in terms of&lt;br /&gt;
a spacetime metric tensor.&lt;br /&gt;
&lt;br /&gt;
In the dual description, for weak fields, the metric emerges as the&lt;br /&gt;
field strength of an underlying fundamental field.  More generally, if&lt;br /&gt;
the gravitational field is not weak, the metric emerges as a nonlinear&lt;br /&gt;
mixture involving the energy momentum tensor.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, October 9th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alain Hénaut, Institut de Mathématiques de Bordeaux, Université de Bordeaux, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;On planar web geometry&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Web geometry deals with foliations in general position. In the planar case and the complex setting, a $d$-web is given by the generic family of integral curves of an analytic or an algebraic differential equation $F(x,y,y&#039;)=0$ with $y&#039;$-degree $d$. Invariants of these configurations as abelian relations (related to Abel&#039;s addition theorem), Lie symmetries or Godbillon-Vey sequences are investigated. This viewpoint enlarges the qualitative study of differential equations and their moduli. In the nonsingular case and through the singularities, Cartan-Spencer and meromorphic connections methods will be used. Basic examples will be given from different domains including classic algebraic geometry and WDVV-equations. Standard results and open problems will be mentioned. Illustration of the interplay between differential and algebraic geometry, new results will be presented. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 5th, 2019, 4 - 5 pm in Keck 171, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Nicole Yunger Halpern, Harvard-Smithsonian ITAMP (Institute for Theoretical Atomic, Molecular, and Optical Physics) Harvard University Department of Physics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Entropic uncertainty relations for quantum-information scrambling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; How violently do two quantum operators disagree? Different subfields of physics feature different notions of incompatibility: (i) In quantum information theory, uncertainty relations are cast in terms of entropies. These entropic uncertainty relations constrain measurement outcomes. (ii) Condensed matter and high-energy physics feature interacting quantum many-body systems, such as spin chains. A local perturbation, such as a Pauli operator on one side of a chain, spreads through many-body entanglement. The perturbation comes to overlap, and to disagree, with probes localized on the opposite side of the system. This disagreement signals that quantum information about the perturbation has scrambled, or become hidden in highly nonlocal correlations. I will unite these two notions of quantum operator disagreement, presenting an entropic uncertainty relation for quantum-information scrambling. The entropies are of distributions over weak and strong measurements’ possible outcomes. The uncertainty bound strengthens when a spin chain scrambles in numerical simulations. Hence the subfields—quantum information, condensed matter, and high-energy physics—can agree about when quantum operations disagree. Our relation can be tested experimentally with superconducting qubits, trapped ions, and quantum dots.&lt;br /&gt;
&lt;br /&gt;
NYH, Bartolotta, and Pollack, Comms. Phys. 2, 92 (2019). https://www.nature.com/articles/s42005-019-0179-8&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, August 26, 2019, 7 - 8:30 pm, in Argyros Forum, Room 209 A&amp;amp;B, networking from 6:15 to 7pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Frederick Eberhardt, Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Computing Causal Relations at Scale    or     Causality: From Aristotle through Computing to Zebrafish&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; What causes what? How do we untangle the “why” behind processes that regulate the brain, the climate or the economy? If “Correlation does not imply causation&amp;quot; is the standard mantra in science, how can we ever discover causal relationships behind the data? Will it ever be possible for intelligent AI to make its own deductions and predictions? In recent years researchers have developed mathematical techniques that give us the power to infer the underlying “why” behind scientific data. What’s more, we’ve learned that we can discover these causes without performing experiments. Starting with a little practical example with lightbulbs that can be worked out by hand we will see how the problem scales as the number of variables increases. To compute the neural connections in a zebrafish brain, high performance computing is essential.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Bio:&#039;&#039; Frederick Eberhardt is Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology. Before coming to Caltech he was Assistant Professor in the Philosophy-Neuroscience-Psychology (PNP) program and the Department of Philosophy at Washington University in St. Louis and a postdoc at the Institute of Cognitive and Brain Sciences at the University of California, Berkeley. As an undergraduate he attended the London School of Economics for a Bachelor in Philosophy &amp;amp; Mathematics. He received his PhD in philosophy from Carnegie Mellon University, where he also completed a Masters in Machine Learning.&lt;br /&gt;
&lt;br /&gt;
His research interests lie at the intersection of philosophy of science, machine learning and statistics. He is particularly interested in the development of methods for causal discovery from statistical data.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2007&amp;diff=22</id>
		<title>MathCS Seminar 2007</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2007&amp;diff=22"/>
		<updated>2021-02-22T19:05:47Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;== Fall 2007 ==  The seminar talks are usually in Beckman Hall 207 (corner of [http://maps.google.com/maps?q=N+Glassell+St+%26+University+Dr,+Orange,+CA+92866,+USA&amp;amp;sa=X&amp;amp;oi=map...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Fall 2007 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are usually in Beckman Hall 207 (corner of [http://maps.google.com/maps?q=N+Glassell+St+%26+University+Dr,+Orange,+CA+92866,+USA&amp;amp;sa=X&amp;amp;oi=map&amp;amp;ct=title N. Glassell St and University Drive], Orange, CA 92866)&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 15, 2007, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Adrian Vajiac, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Equivariant Localization in Mathematics and Physics II&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 8, 2007, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Adrian Vajiac, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Equivariant Localization in Mathematics and Physics&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will describe localization phenomena in mathematics and physics, especially recent applications of equivariant localization techniques and Weyl&#039;s integration formula in Topological Quantum Field Theories (TQFT). This is a summary of the talk I gave this summer at the &amp;quot;Recent Developments in Quantum Field Theory&amp;quot; conference held at the Max Plank Institute, Leipzig. I will conclude with a report on a work in progress regarding the relationship between equivariant localization and computational algebra techniques applied to 4 dimensional TQFTs.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 25, 2007, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Andrew Moshier, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Representations of Heyting Algebras in Bitopological Spaces II&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; See below.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 18, 2007, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Andrew Moshier, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Representations of Heyting Algebras in Bitopological Spaces&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Heyting algebras formalize intuitionistic propositional logic in essentially the same way as Boolean algebras formalize classical propositional logic. While one can regard classical propositions as being characterized by their totality (in any world either &amp;quot;p&amp;quot; or &amp;quot;not p&amp;quot;), in contrast, tertium non datur fails in intuitionistic logic. This simple observation lead Kleene to investigate three-valued logic in which a proposition may be true, false or neither. As part of his investigation, Kleene showed that intuitionistic propositions can be translated into three-valued logic so that a proposition is intuitionistically valid if and only if its translate is valid in three-value logic. Of course, Kleene&#039;s program went much deeper, leading to many useful insights into the connection between intuitionistic mathematics and computation (recursion theory). But one important thing missing was a suitable topological representation theory. In this talk, we establish a representation theorem for Heyting algebras in bitopological spaces (spaces equipped with two topologies). In the course of developing this, we will see that the essentials of Kleene&#039;s ideas about three-valued logic resurface as a natural way to view a bitopological space. Time permitting we will also discuss connections to Priestley Duality via the work of Esakia.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, October 2, 2007, 1:00-2:00 pm, BK 207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Gunduz Caginalp, University of Pittsburgh&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Toward a mathematical theory of financial market dynamics.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Methodology for understanding the deterministic aspects of the dynamics of asset markets will be presented. These include differential and difference equations, optimization and statistical time-series methods. The integration of mathematical modeling with economics experiments will also be discussed.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 27, 2007, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; The structure of the one-generated free domain semiring &#039;&#039;Abstract:&#039;&#039; In this talk we consider idempotent semirings with an additional unary operation d that has the properties of a domain operation. Concrete models of such algebras are e.g. reducts of relation algebras (with d(x)=(x;x^{-1})\cap id), as well as reducts of Kleene algebras with domain. Applications of these algebras to the semantic of various programming calculi have been considered by several researchers. Since both relation algebras and Kleene algebras have rich and complex (quasi)equational theories, we will only consider the simpler equational theory of idempotent semirings with domain.&lt;br /&gt;
&lt;br /&gt;
The aim of this talk is to give an explicit construction of the one-generated free domain semiring. In particular it is proved that the elements can be represented uniquely by finite antichains in the poset of finite strictly decreasing sequences of nonnegative integers. It is also shown that this domain semiring can be represented by sets of binary relations with union, composition and relational domain as operations.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 20, 2007, 1:30-2:30 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Visiting Prof. Alberto Damiano, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Constructing Free Resolutions of Differential Operators - part II&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will continue to talk about free resolutions for modules over the polynomial ring and define their cohomology modules. I will then shift to the non commutative case, and introduce the Weyl algebra, the Clifford algebra and the Exterior algebra. Gröbner basis type of algorithms have been studied recently for such algebras, allowing one to compute “effectively” syzygies and free resolutions. I will then show some examples of calculation using Singular, from which it will be clear that such methods are not really “efficient”, mostly because of the lack of a proper graded structure on such algebras.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 13, 2007, 1:30-2:30 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Visiting Prof. Alberto Damiano, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Constructing Free Resolutions of Differential Operators - part I&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this series of two talks, I will illustrate how to construct free resolutions associated to invariant differential operators. Since most of the examples of operators that have been studied within the framework of Algebraic Analysis are constant coefficient operators, this theory possesses mostly an algebraic flavor because an operator is viewed as a matrix with polynomial entries. In this first lecture, I will review some of the basic concepts of commutative and homological algebra such as:&lt;br /&gt;
&lt;br /&gt;
- Syzygies of ideals and modules over the polynomial ring&lt;br /&gt;
&lt;br /&gt;
- Complexes of free modules, free resolutions, “uniqueness” of the minimal free resolution of a graded module&lt;br /&gt;
&lt;br /&gt;
- Ext modules and cohomology&lt;br /&gt;
&lt;br /&gt;
Since all such objects can be effectively constructed thanks to the theory of Gröbner bases, I will show some examples of calculations using the software package CoCoA.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2007 ==&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, May 17, 2007, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Joanne Walters-Wayland&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Framing &amp;quot;Mel&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Unfortunately I was unable to attend a recent conference in Baton Rouge honoring Professor Melvin Henriksen&#039;s 80th birthday. I had been allocated the opening slot for a short talk which was to be a tribute to Mel and the influence he has had, albeit mainly inadvertently, on frame theory. I decided to take the opportunity to present the talk I had intended to give in Baton Rouge when I was invited to speak at Chapman University. Here is my original &#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;As a tribute to Mel Henriksen and, in thanks for, his ability to inspire and motivate, I would like to give a few snapshots of work he has done over the years, taken through a localic lens. Starting with work presented to the AMS in 1954 on finitely generated ideals, the &amp;quot;raison d&#039;etre&amp;quot; of F-frames, P-frames etc, including his work on prime ideals (1965), quasi-F-covers (1987) and pretty bases (1991), and concluding with some results about cozero complemented spaces (2003).&amp;quot;&lt;br /&gt;
&lt;br /&gt;
I will give a brief introduction to Frame Theory at the beginning of the talk, and will conclude, if time permits, with a sketch of some of our (this is joint work with Rick Ball) recent results and problems in these areas.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, May 10, 2007, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Irene Sabatini&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; An algebraic approach to Hermitian monogenic function&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk we describe the algebraic analysis of the system of differential equations described by the Hermitian Dirac operator, which is a linear first order operator invariant with respect to the action of the unitary group. We show that it is possible to give explicit formulae for the first syzygies of the resolution associated to the system, and we study the removability of compact singularities. We will also discuss the quaternionic version of the hermitian system.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, May 3, 2007, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Andrew Moshier, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Generalizations of Topology with an Eye on Stone Duality&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; One view of point-set topology is that it is the study of concrete representations of frames, i.e., complete lattices in which finite meet distributes over arbitrary join. The utility of this view comes into clear focus when we consider Stone Duality and its close relatives such as Priestley Duality. Recently, we have found a bitopological setting in which Stone and Priestley are unified, but this unification leaves open the question of how to relate topology (as the study of concrete representations of frames) to bitopology (as the study of concrete representations of what?). In this talk, we will make some preliminary steps toward a general approach to topological duality theorems in which topology and bitopology appear as special cases. We will look at possible further applications of this to so-called &amp;quot;quantum logic&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 26, 2007, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Ovidiu Munteanu, UCI&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Curvature invariants in submanifold geometry. New developments&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk we will discuss the structure at infinity of manifolds that admit a weighted Poincare inequality and have a Ricci curvature lower bound defined by the weight function. We will recall Li-Wang&#039;s fundamental results on the subject and discuss some new ideas.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 19, 2007 in BK 207, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Professor Fabrizio Colombo, Politecnico di Milano&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Identification of convolution memory kernels&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We investigate some abstract integrodifferential inverse problems that can be applied to the heat equation with memory, to the strongly damped wave equation with memory and to some other models.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 12, 2007, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Visiting Assistant Professor Nelia Charalambous, UCI&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; The Yang-Mills heat equation on compact manifolds with boundary&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Gauge theory is the study of differential equations for fields over a principal bundle. The case of a principal bundle with a nonabelian group was first introduced by R.L. Mills and C.N. Yang [&#039;54] in order to give a model of the weak and strong interactions in the nucleus of a particle. They wanted to mirror the invariance of physics under an infinite dimensional gauge group, also known as the principle of local invariance.&lt;br /&gt;
&lt;br /&gt;
In this talk we will consider a gauge-theoretic heat equation, the Yang-Mills heat equation. The underlying manifold will be smooth, three-dimensional, with a nonempty boundary. We will prove the existence and uniqueness of solutions to this equation, and consider questions about its convergence at infinite time.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 29, 2007, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Bogdan Suceava, Cal State Fullerton&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Curvature invariants in submanifold geometry. New developments.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Recently, in 2005, B.-Y. Chen has proved the most general form of a fundamental inequality with curvature invariants. The first version of his geometric inequality has been given in 1993, and it inspired in the last decade many geometers. The geometric motivation of this study was a classical fundamental problem in Riemannian geometry stated originally by S.-S. Chern, in a monograph from 1968: When does a given Riemannian manifold admit (or does not admit) a minimal immersion into a Euclidean space of arbitrary dimension? This study extends the study of the embedding problem, in the spirit of J. F. Nash&#039;s embedding theorem, in terms of curvature invariants. In our talk, we will survey a few recent results in this area and we will present future directions of study in this class of geometric inequalities with new curvature invariants.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 8, 2007, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Adrian Vajiac&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Overview of Hamilton-Perelman&#039;s proof of Poincare Conjecture&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will present some of the main ideas behind the works of Hamilton and Perelman on Ricci flows, and how these prove Poincare Conjecture. The speaker is far from being an expert in this field, so the exposition will be informal.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 1, 2007, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Professor Atanas Radenski&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Digital Support for Abductive Learning in Introductory Computing Courses&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Students who grew up browsing the Web are skilled in what is usually referred to as abduction, a reasoning process that starts with a set of specific observations and then generates the best possible explanation of those observations. In order to exploit the abduction skills of contemporary students, I have developed digital CS1/2 study packs that promote and support active learning through abduction, i.e., abductive learning. The study packs integrate a variety of digital resources: online self-guided labs, e-texts, tutorial links, sample programs, quizzes, and slides. These online packs stimulate students to learn abductively by browsing, searching, and performing self-guided lab experiments. In two years of study pack use, the failure rate in the CS1/2 courses at Chapman University has been reduced from 14% to 5%. In surveys conducted at Chapman University in 2005/06, students gave the same high rating of 4.5 (on a 1 to 5 scale) to the CS1 and the CS2 digital study packs. The study packs have been published online at studypack.com and adopted in various institutions.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 15, 2007, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Harmonic Maps, Loop Groups, and Virasoro Actions, Part II&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Continuation of Part I last December: Harmonic maps have been the intense subject in differential geometry for some time now. We will talk about the theory of harmonic maps in Lie groups and the loop groups associated to these spaces of maps. We will then move to describing how this can be thought of as a Riemann-Hilbert Factorization Problem and conclude with the newly found Virasoro action on this space.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, February 6, 2007, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Alberto Damiano, Eduard Cech Center, Charles University, Prague.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Constructing a Dolbeault complex for the Dirac operator in several vector variables.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk I will present the problem of finding a resolution for the system of partial differential equations associated to the classical Dirac operator in several vector variables. It is now widely accepted that such a system constitutes a proper generalization of the Cauchy-Riemann system which defines holomorphic functions of several complex variables, The analysis of the multivariable Dirac operator corresponds then to studying properties of hyperholomorphic functions. So far, mathematicians have attacked the problem of finding compatibiltiy conditions and global properties for the solutions of the system in essentially three different (but strongly related) ways. The first method (see the work of D.C.Struppa, I. Sabadini, F. Colombo et al.) uses techniques of algebraic analysis and Groebner bases to construct a free resolution of the polynomial module given by the cokernel of the symbol of the operator. The second follows the ideas of Baston for case of quaternionic analysis and aims at constructing the so called BGG graph associated to the system. It is an oriented graph in which nodes are representation spaces of a semisimple Lie Algebra [in this case the sum of sl(k) with so(n), where k is the number of variables and n is the dimension of the space] and the arrows are differential operators, the first one being the Dirac operator. The third method is based on some algebraic relations satisfied by the Dirac operator(s) called radial relations.&lt;br /&gt;
&lt;br /&gt;
Calculations with radial relations lead to the construction of an associative, non commutative algebra called algebra of Megaforms. I will discuss mainly the first two methods and their respective advantages and limitations. In particular, I will show that even when using the representation-theoretic point of view, the aid of a computer algebra system becomes crucial to perform experiments, and in some cases even to prove partial results.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, January 18, 2007, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Professor Graziano Gentili, University of Firenze&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Zeroes and singularities of regular maps of a quaternionic variable.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; A geometrical interpretation of a definition originally given by Cullen allows the construction of a new theory of regular functions over the skew field of quaternions. Unlike what happens with other notions of regularity, including the Fueter-regularity, the zero-set and the singular-set of a Cullen-regular function have very nice properties. In this talk we will present the main features of the theory of Cullen-regular functions and show that the zero-sets and singular-sets of such functions consist of isolated points or isolated 2-spheres in the 4-dimensional space of quaternions. &lt;br /&gt;
&lt;br /&gt;
----&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2002&amp;diff=21</id>
		<title>MathCS Seminar 2002</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2002&amp;diff=21"/>
		<updated>2021-02-22T18:42:54Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;&amp;#039;&amp;#039;Seminar Organizer:&amp;#039;&amp;#039; Mihaela Vajiac, &amp;#039;&amp;#039;Webpage maintained by:&amp;#039;&amp;#039; Peter Jipsen  == Fall 2002 == &amp;#039;&amp;#039;&amp;#039;All seminar talks take place Wednesday mornings in Beckman Hall 402 (corner...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;Seminar Organizer:&#039;&#039; Mihaela Vajiac, &#039;&#039;Webpage maintained by:&#039;&#039; Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
== Fall 2002 ==&lt;br /&gt;
&#039;&#039;&#039;All seminar talks take place Wednesday mornings in Beckman Hall 402 (corner of One University Drive and N. Glassell, Orange, CA) at 11 am.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== December 11, 2002 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Adrian Vajiac (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Topological Quantum Field Theory and Invariants of 4-manifolds (Part 2)&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== December 4, 2002 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Adrian Vajiac (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Topological Quantum Field Theory and Invariants of 4-manifolds (Part 1)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We investigate the relationship between Donaldson and Seiberg-Witten invariants of smooth 4-manifolds,using equivariant localization techniques applied to the corresponding TQFTs that generate these invariants.&lt;br /&gt;
This approach is intended to lower the gap between the mathematics and the physics of this subject, possibly leading to a rigorous interpretation of the physics of the generating TQFTs.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== November 13, 2002 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mohamed Allali (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; A Covering of the Sphere by a Special Set of Rotations&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We will present a method of covering the unit sphere by means of spherical caps of fixed radius. The method based on a set of rotations provides an explicit formula for the number of spherical caps that cover the whole unit sphere and the exact positioning of their centers. To find the optimal number (the minimal number of spherical caps) is still an open problem.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== November 6, 2002 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &amp;quot;Harmonic Maps and Integrable Systems&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The theory of harmonic maps on Lie groups has &lt;br /&gt;
aquired a modern interpretation through integrable systems. We will  outline the structual background on harmonic maps into a (compact) Lie group and talk about the arising loop group action and the implications in the theory of integrable systems.  &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== October 30, 2002 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Andrew Moshier (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Stably Compact and Related Spaces&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Compact Hausdorff spaces, which are well-known to classical mathematicians, have a useful generalization to the setting of non-T1 spaces. The resulting spaces, known as Stably Compact, enjoy many of the useful properties of compact Hausdorff spaces and in fact help to tease apart some concepts that accidentally coindice in the Hausdorff setting. In this talk, we will discuss various topological ideas that lead to characterizations of stable compactness. We will introduce the key result in this area: the Hofmann-Mislove Theorem. Time permitting, we may also discuss interesting topological constructions under which stable compactness is preserved, particularly the construction of the space of Borel measures on an underlying space.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== October 23, 2002 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; An introduction to residuated KATs and RATs and related algebraic models of computation&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this seminar I will examine some algebraic theories that have been developed in the past half century to reason about algorithms and automata. In particular I will look at Kleene algebras with test and relation algebras with transitive closure. Adding residuation to Kleene algebras gives the algebraic form of Pratt&#039;s action logic. It has many of the useful features of relation algebras and is still decidable. I will give a number of finite examples and indicate how to calculate the models on an n-element set.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== October 9, 2002 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Adrian Vajiac (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; The Geometry and Physics of Fermat&#039;s Last Theorem&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2003&amp;diff=20</id>
		<title>MathCS Seminar 2003</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2003&amp;diff=20"/>
		<updated>2021-02-22T18:42:14Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;&amp;#039;&amp;#039;Seminar Organizer:&amp;#039;&amp;#039; Mihaela Vajiac, &amp;#039;&amp;#039;Webpage maintained by:&amp;#039;&amp;#039; Peter Jipsen  == Fall 2003 ==  === Wednesday, November 26, 2003, 10 am ===  &amp;#039;&amp;#039;Speaker:&amp;#039;&amp;#039; Viorel Costeanu (MIT...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;Seminar Organizer:&#039;&#039; Mihaela Vajiac, &#039;&#039;Webpage maintained by:&#039;&#039; Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
== Fall 2003 ==&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, November 26, 2003, 10 am ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Viorel Costeanu (MIT)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; The 2-typical de Rham-Witt complex of the integers&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; For any ring $A$ and any prime number $p$ there is a construction called the&lt;br /&gt;
2-typical de Rham-Witt complex of $A$. It is related to Milnor&#039;s $K$-theory,&lt;br /&gt;
Quillen&#039;s $K$-theory, and topological cyclic homology. This algebraic&lt;br /&gt;
structure was studied and quite well understood for $p$ odd. When $p=2$ there&lt;br /&gt;
are a few problems that need to be addressed. I will speak about these and&lt;br /&gt;
then describe the 2-typical de Rham-Witt complex of the integers.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 13, 2003, 2:30 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Quantum Cohomology on Symplectic Manifolds. Properties of the &lt;br /&gt;
quantum products.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The quantum products on a symplectic manifold are deformations of the &lt;br /&gt;
cup product. The motivation for the theory of Quantum Cohomology comes from &lt;br /&gt;
physics, and the mathematical theory has been built rigurously on the theory&lt;br /&gt;
of J-holomorphic curves on symplectic manifolds. &lt;br /&gt;
We will explore the properties of the quantum products, together with gauge &lt;br /&gt;
theoretic techniques developed to anlayze them. &lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 6, 2003, 2:30 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Annika Wille (Vanderbilt University; TU Darmstadt, Germany)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; A Gentzen System for Involutive Residuated Lattices&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Involutive residuated lattices $\langle L,\wedge,\vee,\cdot,e,&#039;\rangle$ are involutive&lt;br /&gt;
lattices with a residuated monoid operation, such that&lt;br /&gt;
&lt;br /&gt;
$a\cdot b \le c\quad$ iff  $\quad a \le (b\cdot c&#039;)&#039;\quad$ iff $\quad b \le (c&#039;\cdot a)&#039;$,&lt;br /&gt;
&lt;br /&gt;
for all $a,b,c \in L$. We can also see an involutive residuated lattice as&lt;br /&gt;
a Girard quantale, where the underlying lattice need not be complete.&lt;br /&gt;
&lt;br /&gt;
A cut-free Gentzen system for Girard quantales is already given by J. Y.&lt;br /&gt;
Girard. We will describe a cut-free Gentzen system for involutive&lt;br /&gt;
residuated lattices from an algebraic point of view. Finally we conclude&lt;br /&gt;
decidability.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 30, 2003, 4 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Jeff Lawson (Trinity University, Texas; Caltech)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Lagrangian reduction by symmetry: Variations on a theme&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 23 ===&lt;br /&gt;
&lt;br /&gt;
Seminar cancelled&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 9, 2003, 4 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Adrian Vajiac (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Mathematical Background for Topological Quantum Field Theories&amp;quot;&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 2, 2003, 4 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Andrew Moshier (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Measure Theoretic, Domain Theoretic and Logical Views of Labelled Markov Processes&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
Recently, researchers have become increasingly interested in models of&lt;br /&gt;
computation in the presence of chance. These models are motivated by&lt;br /&gt;
concerns about verification of properties, such as operation within safe&lt;br /&gt;
envelopes, when the behavior of the system is influenced by random&lt;br /&gt;
events. In one such model, &amp;quot;labelled Markov processes,&amp;quot; a system is&lt;br /&gt;
modelled as a state machine in which transitions are triggered by&lt;br /&gt;
external events, indexed by a set of &amp;quot;labels,&amp;quot; resulting in stochastic&lt;br /&gt;
internal behavior.&lt;br /&gt;
&lt;br /&gt;
We will discuss three related ways to think about labelled Markov&lt;br /&gt;
processes. In the first, a classical measure theoretic definition&lt;br /&gt;
slightly generalizes (discrete time) Markov processes. This yields&lt;br /&gt;
concepts of bisimulation and simulation of the states of a process. In&lt;br /&gt;
the second, a domain theoretic definition involves the solution of a&lt;br /&gt;
certain domain equation. The result can be interpreted as a universal&lt;br /&gt;
labelled Markov process. In the third, we relate the domain theoretic&lt;br /&gt;
and classical definitions to a logical one by defining a propositional&lt;br /&gt;
sequent calculus with semantics definable on any labelled Markov&lt;br /&gt;
process. The result characterizes simulation of two states of a labelled&lt;br /&gt;
Markov process by inclusion of propositional theories, and bisimulation&lt;br /&gt;
by equality of propositional theories. In addition, the very definition&lt;br /&gt;
of the sequent calculus derives from the domain equation used to&lt;br /&gt;
construct a universal labelled Markov process.&lt;br /&gt;
&lt;br /&gt;
We will give examples of results that are easily proved using the logic.&lt;br /&gt;
Time permitting, we will also apply the domain theoretic and logical&lt;br /&gt;
approaches to models of other kinds of probabilistic processes. &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 25, 2003, 4 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; An introduction to generalized basic logic algebras&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Some applications in computing and control theory require a &lt;br /&gt;
logic with truthvalues other than the absolute &amp;quot;true&amp;quot; and &amp;quot;false&amp;quot;. Many &lt;br /&gt;
systems of multi-valued logic have been studied in the past, and quite a &lt;br /&gt;
few of them are based on using the interval [0,1] as a set of truth &lt;br /&gt;
values. This still leaves much choice as to how truthvalues should be &lt;br /&gt;
combined when two statements both hold, but with different degrees of &lt;br /&gt;
certainty. The system of Basic Logic was introduced by Petr Hajek in a &lt;br /&gt;
series of papers and a book (Metamathematics of Fuzzy Logic, Kluwer, &lt;br /&gt;
1998) to give a general framework for a logic that is common to all &lt;br /&gt;
multi-valued logics.&lt;br /&gt;
&lt;br /&gt;
I will review the algebraic version of this logic, called BL-algebra, &lt;br /&gt;
relate it to residuated lattices, and show that some of the strong &lt;br /&gt;
properties of this logic are also true in various generalized contexts. &lt;br /&gt;
In particular I will prove that the extension of BL-algebras with the &lt;br /&gt;
so-called projection, gives a class of discriminator algebras, which &lt;br /&gt;
explains why the projections have such far reaching consequences for &lt;br /&gt;
basic logic. A modification of this result also holds for residuated &lt;br /&gt;
lattices with a least element.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Summer 2003 ==&lt;br /&gt;
&#039;&#039;&#039;Seminar talks during the summer take place at various times but still in Beckman Hall 402 (corner of One University Drive and N. Glassell, Orange, CA).&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, June 10, 2003, 2 pm, &#039;&#039;&#039;Colloquium Talk&#039;&#039;&#039; ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Dexter Kozen, Cornell University&lt;br /&gt;
(joint work with Mark Hopkins, AMS Inc.)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Parikh&#039;s Theorem in Commutative Kleene Algebra&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Parikh&#039;s theorem says that every context-free language&lt;br /&gt;
is &amp;quot;letter-equivalent&amp;quot; to a regular set.  Formally, two sets&lt;br /&gt;
are letter-equivalent if any word in one has an anagram&lt;br /&gt;
in the other.  For example, the CFL $\{a^n b^n \mid n \ge 0\}$&lt;br /&gt;
is letter-equivalent to the regular set $(ab)^*$.&lt;br /&gt;
&lt;br /&gt;
The usual proofs of Parikh&#039;s theorem involve an induction&lt;br /&gt;
on parse trees of context-free grammars.  However, this&lt;br /&gt;
result is a special case of a more general result in&lt;br /&gt;
commutative Kleene algebra, namely: every commutative&lt;br /&gt;
Kleene algebra is uniformly algebraically closed.&lt;br /&gt;
Formally, every system of inequalities&lt;br /&gt;
&lt;br /&gt;
$f_i(x_1,...,x_n) \le x_i,\quad 1 \le i \le n$,&lt;br /&gt;
&lt;br /&gt;
where the $f_i$ are polynomials in $K[x_1,...,x_n]$ over a commutative&lt;br /&gt;
Kleene algebra $K$, has a unique least solution in $K^n$.  Moreover,&lt;br /&gt;
the components of the solution are given by regular expressions&lt;br /&gt;
in the coefficients of the $f_i$.&lt;br /&gt;
&lt;br /&gt;
The proof involves the definition of a differential operator&lt;br /&gt;
$d/dx : K[x] \to K[x]$ on polynomials over a commutative Kleene&lt;br /&gt;
algebra and a version of Taylor&#039;s theorem&lt;br /&gt;
&lt;br /&gt;
$f(x+d) = f(x) + d f&#039;(x+d)$.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, May 21, 2003, 4 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Marcus Kracht (UCLA)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Weakly Transitive and Semisimple Varieties of Modal Algebras&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In polymodal logics one often has to generalize notions from monomodal &lt;br /&gt;
logic, eg transitivity and symmetry. It turns out that this can be done &lt;br /&gt;
using notions that have originally been invented for monomodal logics. &lt;br /&gt;
The notion of weak transitivity (going back to Wim Blok) generalizes the &lt;br /&gt;
notion of transitivity in the right way. It shall be shown that many &lt;br /&gt;
results in modal logic do not depend on transitivity, they only depend &lt;br /&gt;
on weak transitivity. One result is the existence of a deduction theorem &lt;br /&gt;
for the global frame consequence, finite equivalentiality, the existence &lt;br /&gt;
of many splitting algebras. A variety is cyclic if every operator possesses &lt;br /&gt;
(or is included in) a converse. Cyclicity generalizes the notion of &lt;br /&gt;
symmetry. It turns out that a variety of modal algebras is semisimple &lt;br /&gt;
iff it is both weakly transitive and cyclic iff it is discriminator.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2003 ==&lt;br /&gt;
&#039;&#039;&#039;All seminar talks take place Thursday afternoons in Beckman Hall 402 (corner of One University Drive and N. Glassell, Orange, CA) at 4 pm.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== May 8, 2003 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. John Yules (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Design of an Ocean Wave Recorder -- My Sabbatical Project&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I plan first to discuss &amp;quot;an oceanographer&#039;s view of waves,&amp;quot; which encompasses not only wind-generated waves, but also tsunamis and tides. We&#039;ll review a wide variety of  techniques for making measurements of waves, and I&#039;ll show how my plan of attack fits in. Finally, we&#039;ll talk about the phenomena that might present themselves for study and perhaps brainstorm about data analysis.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== May 1, 2003 ===&lt;br /&gt;
Discussion about departmental goals and assessment&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== April 24, 2003 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Bogdan Suceava (CSU Fullerton)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Fundamental Inequalities and Strongly Minimal Submanifolds&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The classical obstruction to minimal isometric immersions into Euclidean space is $Ric \geq 0.$  A question originated in the work of S.-S.Chern  (1968) asked if there are any other curvature Riemannian obstructions to minimal isometric immersion in a space form. The answer has been given by B.-Y. Chen (first form in 1993, general form in 2000). An interesting problem is to see examples of Riemannian manifolds with $Ric&amp;lt;0$ which don&#039;t admit any minimal isometric immersion into Euclidean space for any codimension. The proof uses a consequence of Chen&#039;s fundamental inequality. The fundamental inequalities have been extended recently in complex space forms, where one of the equality cases bring to our attention a new class of geometric objects: strongly minimal submanifolds. These submanifolds (whose classification is not yet completed) would be the Kaehler submanifolds that best fit in an ambient complex space form.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== April 10, 2003 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mohamed Allali (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Fourier Transforms and Wavelets (Part 2)&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== April 3, 2003 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mohamed Allali (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Fourier Transforms and Wavelets (Part 1)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Wavelets are now a driving force that has regrouped a&lt;br /&gt;
community of mathematicians and engineers sharing representation&lt;br /&gt;
techniques. The two-part talk will introduce Fourier Transforms and&lt;br /&gt;
Wavelet theory, in particular Multiresolution Analysis.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== March 27, 2003 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Lie Groups, Loop Groups in Lie Groups and Harmonic Maps (Part 3)&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== March 20, 2003 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Lie Groups, Loop Groups in Lie Groups and Harmonic Maps (Part 2)&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== March 13, 2003 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Lie Groups, Loop Groups in Lie Groups and Harmonic Maps (Part 1)&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== March 6, 2003 ===&lt;br /&gt;
&lt;br /&gt;
=== February 27, 2003 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; An online database of ordered algebraic structures (Part 2)&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== February 20, 2003 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; An online database of ordered algebraic structures (Part 1)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Research in ordered algebraic structures has grown from the classical&lt;br /&gt;
areas of ordered groups, rings, and fields to the study of a wide&lt;br /&gt;
variety of classes of partially ordered algebras, where the order takes&lt;br /&gt;
the form of (join- or meet-) semilattices, lattices, or Boolean&lt;br /&gt;
algebras. In addition, subclasses determined by various completeness&lt;br /&gt;
properties and residuation properties have received considerable&lt;br /&gt;
attention, motivated by studies in algebraic logic, topology, and&lt;br /&gt;
theoretical computer science. While researchers are familiar with the&lt;br /&gt;
structures in their areas of expertise, it is no small task to be&lt;br /&gt;
informed about the terminology, definitions, basic properties and&lt;br /&gt;
relationships between the many classes of structures in this growing field.&lt;br /&gt;
&lt;br /&gt;
This talk will present a preliminary version of an online database that&lt;br /&gt;
aims to (eventually) survey most classes of ordered algebraic structures&lt;br /&gt;
that have appeared in the literature. At minimum, a record for a class&lt;br /&gt;
contains its name, (several) definition(s), some of the basic properties&lt;br /&gt;
and results about the class, and the position of the class in this&lt;br /&gt;
hierarchy relative to its ``nearest&#039;&#039; sub- and superclasses. Most of the&lt;br /&gt;
classes are categories in a natural way, and concepts from category&lt;br /&gt;
theory are used to express structure preserving relationships between&lt;br /&gt;
different classes. Currently the database contains around a hundred&lt;br /&gt;
classes from action algebras to weakly representable relation algebras.&lt;br /&gt;
Although intended mainly as a reference for researchers, with citations&lt;br /&gt;
to the literature for further detail, the database aims to store&lt;br /&gt;
definitions in machine-readable form to allow additional processing with&lt;br /&gt;
computational tools. It will also provide access to families of examples&lt;br /&gt;
and (where feasible) implementations of algorithms for computable&lt;br /&gt;
syntactic or semantic properties of a given class. For example, if a&lt;br /&gt;
class has a decidable equational theory, an implementation of a decision&lt;br /&gt;
procedure may be included in the entry for the class. Tools for&lt;br /&gt;
visualizing (parts of) the partial order structure of specific examples&lt;br /&gt;
and of the hierarchy of classes will be discussed, as well as recent&lt;br /&gt;
significant online developments such as MathML and XML transformation&lt;br /&gt;
tools that play a role in our approach.&lt;br /&gt;
&lt;br /&gt;
Much work remains to be done to give this database the breadth and&lt;br /&gt;
consistency that would ensure it is a useful research tool and is&lt;br /&gt;
helpful to students entering this area. In fact, in a successful&lt;br /&gt;
scenario, this project will not be completed at some stage, but will&lt;br /&gt;
continue to grow in a collaborative style, thereby ensuring that the&lt;br /&gt;
information in the database remains up-to-date.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== February 13, 2003 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Andrew Moshier (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Stably Compact Spaces Predicatively Understood (Part 2)&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== February 6, 2003 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Drew Moshier (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Stably Compact Spaces Predicatively Understood (Part 1)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Stably compact spaces are suitable for investigating relationships between classical mathematics and computation because they include compact regular spaces and topological spaces that arise in domain theory. Proofs of many theorems involving stably compact spaces, however, depend on the axiom of choice and other non-constructive principles. This presents a problem if we are to understand these spaces computationally. The axiom of choice comes into play when we need to speak about existence of points in a space. Impredicativity (roughly, non-constructive quantification over powersets) comes into play when we need to speak about compactness, and more generally about arbitrary collections of opens.&lt;br /&gt;
&lt;br /&gt;
We briefly motivate the concern about predicativity and constructivity, and then consider two alternatives to stably compact spaces: stably compact locales and stable sequent calculi. The former can be thought of as stably compact spaces &amp;quot;without points.&amp;quot; The latter can be thought of representations of compactness information in stably compact locales. We sketch proofs showing that stably compact spaces, stably compact locales and stable sequent calculi form equivalent categories, isolating the use of non-constructive principles in these equivalences. To illustrate the point, we also give an entirely predicative proof of Tychonoff&#039;s theorem for stable calculi (a product of stable calculi is a stable calculus).&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2004&amp;diff=19</id>
		<title>MathCS Seminar 2004</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2004&amp;diff=19"/>
		<updated>2021-02-22T18:41:45Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;&amp;#039;&amp;#039;Seminar Organizer:&amp;#039;&amp;#039; Mihaela Vajiac, &amp;#039;&amp;#039;Webpage maintained by:&amp;#039;&amp;#039; Peter Jipsen  == Fall 2004 ==  === Thursday, December 2, 2004, 3 pm ===  &amp;#039;&amp;#039;Speaker:&amp;#039;&amp;#039; Dr. Mohamed Allali  &amp;#039;&amp;#039;T...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;Seminar Organizer:&#039;&#039; Mihaela Vajiac, &#039;&#039;Webpage maintained by:&#039;&#039; Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
== Fall 2004 ==&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 2, 2004, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mohamed Allali&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Interpolation and Equidistribution on the unit sphere&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The problem of generating a large number of points on the&lt;br /&gt;
sphere has many applications in various fields of computation such as&lt;br /&gt;
quadrature, placing grids on S2, tomography, coding theory, etc. This&lt;br /&gt;
talk will introduce different methods of equidistributing points on the&lt;br /&gt;
sphere. Moreover, of practical importance is the problem of&lt;br /&gt;
interpolating scattered data on the sphere. Strictly positive definite&lt;br /&gt;
functions shall be introduced and connected to the interpolation&lt;br /&gt;
problem.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 18, 2004, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Mihaela Vajiac&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Harmonic Maps on SU(n) and Virasoro actions, part II&lt;br /&gt;
&lt;br /&gt;
Joint work with Professor Karen Uhlenbech, UT Austin&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; This introductive talk covers the interaction between Harmonic&lt;br /&gt;
Maps, Loop Groups and Integrable Systems.&lt;br /&gt;
&lt;br /&gt;
We continue with the construction of the Virasoro algebra in the SU(n)&lt;br /&gt;
case.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 28, 2004, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Mihaela Vajiac&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Harmonic Maps on SU(n) and Virasoro actions&lt;br /&gt;
&lt;br /&gt;
Joint work with Professor Karen Uhlenbech, UT Austin&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; This introductive talk covers the interaction between Harmonic Maps, Loop Groups and Integrable Systems.&lt;br /&gt;
&lt;br /&gt;
We will continue next thursday with the construction of the Virasoro algebra in the SU(n) case.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2004 ==&lt;br /&gt;
&#039;&#039;&#039;All seminar talks take place Thursday afternoons in Beckman Hall 402 (corner of One University Drive and N. Glassell, Orange, CA).&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 29, 2004, 4 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Joanne Walters-Wayland&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; $G_{\delta}$-density in a pointfree setting&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I shall endeavour to give a short history of, and motivation for&lt;br /&gt;
studying, &amp;quot;generalized topoplogy&amp;quot;. I shall also attempt to highlight the&lt;br /&gt;
beauty of this theory by considering $G_{\delta}$-density in this setting. In&lt;br /&gt;
particular, I will introduce the cozero part of a frame - the cozeros are&lt;br /&gt;
essential in understanding many concepts especially when dealing with&lt;br /&gt;
complete regularity and related notions. &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 8, 2004, 1:30 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Catalin Zara (Penn State)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Hamiltonian GKM Spaces: From Geometry To Combinatorics, And Back.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 1, 2004, 2:45 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speakers:&#039;&#039; Catherine Parsons, Vicki Shultz and Zack Wheatly (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Morphing, Warping and SVD Through Linear Algebra.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Linear Algebra is used throughout Digital Image Processing (DIP) for both effects and compression. Morphing and warping, two techniques in DIP used to make one image &amp;quot;transform&amp;quot; into another, and Singular Value Decomposition (SVD) are examples of this which we will present in this talk. Morphing fades one image into another, while warping stretches and skews the images based off chosen lines. SVD takes an original image, breaks it into three distinct matrices, and extracts enough pertinent information to still&lt;br /&gt;
recreate the image while using less memory. Through our presentation we&lt;br /&gt;
will show how these three techniques in DIP can be achieved with the basic tools of Linear Algebra.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 18, 2004, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Noah Salvaterra (Indiana University, Bloomington)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; A Brief Introduction to Khovanov Homology&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; By a modification of Kauffman&#039;s bracket for a link diagram one can construct a chain complex of graded vector spaces. Just as a renormalization of the Kauffman bracket leads to a link invariant, the Jones polynomial, a similar renormalization of this complex gives rise to interesting homologies which are actually link invariants. While in fact the Jones polynomial arises as the graded Euler characteristic in this construction, the Poincare polynomial of these homologies is a strictly stronger invariant.&lt;br /&gt;
&lt;br /&gt;
I hope to give a brief overview of this construction with lots of pictures, filling in the necessary knot theory along the way.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 11, 2004, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Quantum Cohomology and Quantum Products.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The theory of quantum cohomology and Gromov-Witten invariants was&lt;br /&gt;
first developed by Witten and has been the subject of&lt;br /&gt;
active research in algebraic and symplectic geometry.&lt;br /&gt;
In my talk, gauge theory techniques and the theory of flat&lt;br /&gt;
connections are used to prove that the small quantum product is a&lt;br /&gt;
gauge theoretic deformation of the cup product on a symplectic&lt;br /&gt;
manifold M and to construct a moduli space of products on a&lt;br /&gt;
vector space which are associative, commutative, Frobenius, and have&lt;br /&gt;
unit (we will call these quantum-type products). &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 25, 2004, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
Meeting on assessment of GE Calculus&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 19, 2004, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
Meeting to discuss GE, precalculus textbook adoption.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 12, 2004, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Representable l-groups are algebras of binary relations, and representable finite GBL-algebras are commutative.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; It is shown that any representable l-group G is isomorphic to a set of binary relations $R(G)$ closed under union, intersection, composition and residuals. The identity element of the l-group corresponds to the partial order relation rather than the diagonal relation, and the collection of binary relations is not closed under relation converse. However this construction never-the-less shows that the variety of representable l-groups is contained in the class of all binary relations closed under union, intersection, composition and residuals. It is interesting to note that, in contrast to the variety of representable l-groups, the latter class is not finitely axiomatizable. The construction shows that representable l-groups are subreducts of relation algebras with an additional constant, and leads to a number of interesting problems regarding the algebras of binary relations generated by $R(G)$ if we also include relation converse and/or complementation as basic operations.&lt;br /&gt;
&lt;br /&gt;
In the second part of the talk we will show that representable generalized basic logic algebras are commutative, hence simply BL-hoops. Some possible generalizations of this result will also be discussed.&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2005&amp;diff=18</id>
		<title>MathCS Seminar 2005</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2005&amp;diff=18"/>
		<updated>2021-02-22T18:41:13Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;&amp;#039;&amp;#039;Seminar Organizer:&amp;#039;&amp;#039; Mihaela Vajiac, &amp;#039;&amp;#039;Webpage maintained by:&amp;#039;&amp;#039; Peter Jipsen  == Fall 2005 == &amp;#039;&amp;#039;&amp;#039;All seminar talks take place in Argyros Forum 211.&amp;#039;&amp;#039;&amp;#039;  ----  === Thursday, D...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;Seminar Organizer:&#039;&#039; Mihaela Vajiac, &#039;&#039;Webpage maintained by:&#039;&#039; Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
== Fall 2005 ==&lt;br /&gt;
&#039;&#039;&#039;All seminar talks take place in Argyros Forum 211.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 7, 2005, 12-1 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Professor Achim Jung, University of Birmingham&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Extending valuations to measures&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Many theorems in measure theory are about extending a &amp;quot;proto-measure&amp;quot; to&lt;br /&gt;
a full measure, where &amp;quot;proto&amp;quot; means that the given function assigns a&lt;br /&gt;
volume only to some measureable sets. Computer scientists became&lt;br /&gt;
interested in one particular instance of this where the proto-measure is&lt;br /&gt;
defined on the open sets of a topological space. Such proto-measures had&lt;br /&gt;
been looked at before under the name &amp;quot;valuations&amp;quot;.&lt;br /&gt;
&lt;br /&gt;
In my talk I will try to explain why valuations are particularly&lt;br /&gt;
interesting from a computer science point of view, and I will prove an&lt;br /&gt;
extension theorem using classical theorems from analysis. This proof&lt;br /&gt;
works only for compact ordered spaces, and so I will get an excuse for&lt;br /&gt;
explaining why these are of interest to computer scientists, too.&lt;br /&gt;
&lt;br /&gt;
The talk is based on joint work with Klaus Keimel.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 30, 2005, 12-1 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Harmonic Maps and Loop Groups on SU(2).&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 29, 2005, 12-1 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Arek Goetz, University of San Francisco&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Multimedia online learning environment as a tool in teaching&lt;br /&gt;
calculus and in research in geometric dynamical systems&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 9, 2005, 12-1 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Quantum Cohomology in Symplectic Geometry &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 26, 2005, 12-1 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Adrian Vajiac&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Equivariant Cohomology&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 12, 2005, 12-1 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Adrian Vajiac&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; The Global Aspect of the Parallelism Axiom&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 5, 2005, 12-1 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Complex algebras of groups and Boolean algebras&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Given a group $G$, the complex algebra Cm$(G)$ is defined by&lt;br /&gt;
$(P(G),\cup,\sim,\emptyset,*,^{-1},\{e\})$, where &lt;br /&gt;
&lt;br /&gt;
$X*Y=\{xy : x \in X, y \in Y\}$  and  $X^{-1}=\{x^{-1} : x \in X\}$&lt;br /&gt;
&lt;br /&gt;
for any subsets $X,Y$ of $G$. Likewise, for a&lt;br /&gt;
Boolean algebra $B$, the complex algebra Cm$(B)$ is defined by&lt;br /&gt;
$(P(B),\cup,\sim,\emptyset,+,-,\{0\})$, where $+,-$ are the lifted&lt;br /&gt;
versions of the Boolean join and complementation of $B$.  It is&lt;br /&gt;
well-known that the class of all complex algebras of groups is&lt;br /&gt;
nonfinitely axiomatizable and undecidable. The corresponding problems&lt;br /&gt;
for the variety HBA generated by complex algebras of Boolean algebras&lt;br /&gt;
have not yet been resolved. As a contribution in this direction, we&lt;br /&gt;
find a number of identities that hold in all complex algebras of&lt;br /&gt;
Boolean algebras, and we prove that if a Boolean algebra with&lt;br /&gt;
additional operations $+,-,0$ has $\le 24$ elements then it will be in the&lt;br /&gt;
variety HBA iff it satisfies these identities.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 29, 2005, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Atanas Radenski&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Can Introductory Computer Science Be Relieved From the Complexity&lt;br /&gt;
of Commercial Languages? A &amp;quot;Python First, Java Second&amp;quot; Approach to&lt;br /&gt;
CS1/CS2&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
In this talk, I will advocate the need for, and the benefits from, a&lt;br /&gt;
dual-language approach to the introductory computer science course&lt;br /&gt;
sequence, commonly referred to as CS1/CS2. I will describe my&lt;br /&gt;
implementation of a &amp;quot;Python First, Java Second&amp;quot; approach that has been&lt;br /&gt;
used at Chapman University since the fall of 2004: A gentle CS1 course&lt;br /&gt;
builds core knowledge using the Python language, while a subsequent&lt;br /&gt;
comprehensive CS2 course upgrades and extends this knowledge using a&lt;br /&gt;
mainstream language, Java.&lt;br /&gt;
&lt;br /&gt;
To support &amp;quot;Python first, Java second&amp;quot; courses, I have created&lt;br /&gt;
comprehensive online study packs that provide complete coverage for all&lt;br /&gt;
course activities. Both study packs feature detailed self-guided lab&lt;br /&gt;
assignments and honor lab report system. The study packs reduce the need&lt;br /&gt;
for face-to-face activities thus facilitating students with busy class&lt;br /&gt;
and work schedules. Both study packs are installed on a Moodle server.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2005 ==&lt;br /&gt;
&#039;&#039;&#039;All seminar talks take place in Beckman Hall 402.&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 14, 2005, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr Adrian Vajiac&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Topological Invariants of 4-manifolds&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 7, 2005, 4 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr Scott Baldridge (Louisiana State University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; On symplectic 4-manifolds with prescribed fundamental group&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
In this talk I will discuss minimizers of the function $f=a\chi+b\sigma$ on the class of all&lt;br /&gt;
symplectic 4--manifolds with prescribed fundamental group $G$ ($\chi$ is the Euler&lt;br /&gt;
characteristic, $\sigma$ is the signature, and $a,b\in \BR$). The values of $a,b$ for which&lt;br /&gt;
the function $f$ has a lower bound have some surprising features. I will discuss these&lt;br /&gt;
features and describe some examples of manifolds which minimize $\chi$.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 31, 2005, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr Andrew Moshier (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Synthetic Topology and Semantics of Exceptions. Part II&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 17, 2005, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr Andrew Moshier (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Synthetic Topology and Semantics of Exceptions.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
In the late 1980&#039;s, Mike Smyth developed a series of analogies between computational and topological ideas that have come to be known as &amp;quot;Smyth&#039;s dictionary&amp;quot;. Recently the dictionary has been extended along various lines leading to research programs called &amp;quot;Synthetic Topology&amp;quot; (pursued especially by Martin Escardo and Andre Bauer) and &amp;quot;Abstract Stone Duality&amp;quot; (pursued by Paul Taylor). In this talk, we will introduce the basics of Smyth&#039;s dictionary, outline some of the newer directions of this research (borrowing heavily from Escardo and Taylor), and mention a further recent development that brings bitopological concepts into the story and sheds some promising light on how computational exceptions fit into Smyth&#039;s analogies. &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 17, 2005, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr Peter Jipsen (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; On congruences in Residuated Kleene algebras&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Kleene algebras have a long history in Computer Science, with applications in formal foundation for automata theory, regular grammars, semantics of programming languages and other areas.&lt;br /&gt;
&lt;br /&gt;
However the algebraic structure of Kleene algebras has not been studied as extensively. This is partly because the class of all Kleene algebras is a quasivariety but not a variety, i.e. it can be defined by strict Horn formulas but not by identities.  If we add the quite natural operations of left and right residuals for the Kleene product, we get the variety of residuated Kleene algebras (also called action algebras by V. Pratt, 1990 and D. Kozen, 1994). Until recently it was not even known if the variety of residuated Kleene algebras is congruence distributive. Since this property has many useful algebraic consequences, it is certainly of interest that (a noncommmutative version of) a result in algebraic logic by C. van Alten and J. Raftery, 2004, based on a description of congruence filters by W. Blok and J. Raftery, implies that the congruence lattice of any residuated Kleene algebra is distributive.&lt;br /&gt;
&lt;br /&gt;
We give an overview of this result in the present setting and explore some of its consequences for the lattice of varieties of residuated Kleene algebras. In particular we show that this lattice contains uncountably many varieties covering the Boolean variety.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 10, 2005, 3 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mohamed Allali&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Interpolation and Equidistribution on the unit sphere, part II.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The problem of generating a large number of points on the&lt;br /&gt;
sphere has many applications in various fields of computation such as&lt;br /&gt;
quadrature, placing grids on S2, tomography, coding theory, etc.&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2006&amp;diff=17</id>
		<title>MathCS Seminar 2006</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2006&amp;diff=17"/>
		<updated>2021-02-22T18:40:37Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;== Fall 2006 == &amp;#039;&amp;#039;&amp;#039;All seminar talks take place in Beckman Hall 402 (corner of One University Drive and N. Glassell, Orange, CA).&amp;#039;&amp;#039;&amp;#039;  === Thursday, November 30, 2006, 12:30-1:...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Fall 2006 ==&lt;br /&gt;
&#039;&#039;&#039;All seminar talks take place in Beckman Hall 402 (corner of One University Drive and N. Glassell, Orange, CA).&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 30, 2006, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Harmonic Maps and Loop Groups&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Harmonic maps have been the intense subject in differential geometry for some time now. We will talk about the theory of harmonic maps in Lie groups and the loop groups associated to these spaces of maps. We will then move to describing how this can be thought of as a Riemann-Hilbert Factorization Problem and conclude with the newly found Virasoro action on this space .&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, November 15, 2006, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Halina Goetz&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Challenges and success stories in teaching preparatory courses&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The speaker summarizes her experience teaching remedial courses in various settings, she will outline misconceptions about tutoring, will and some challenges in teaching Mathematics for Elementary Teachers by comparing and contrasting the delivery of the course at other institutions. She will conclude the talk with tangible and concrete steps for improving the overall teaching results in remedial and MATH 206 class.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 2, 2006, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Involutive residuated frames with applications to decidability&lt;br /&gt;
&lt;br /&gt;
(joint work with Dr. Nikolaos Galatos, Japan Advanced Institute for Science and Technology)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We consider frames for involutive residuated lattices. We use them to prove a general cut-elimination result for this variety and derive the finite model property for classical substructural logics (without any assumption of commutativity or cyclicity). Connections with relation algebras are highlighted, and we examine several constructions on frames (various unions and products) that illustrate how involutive frames provide a unifying perspective for involutive lattices.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 26, 2006, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Residuated (Kripke) frames&lt;br /&gt;
&lt;br /&gt;
(joint work with Dr. Nikolaos Galatos, Japan Advanced Institute for Science and Technology)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The notion of frames from modal logic has been generalized in a number of different ways. We present some background on residuated lattice ordered groupoids,&lt;br /&gt;
FL-algebras and several important subvarieties (involutive, cyclic, classical, commutative, distributive, Boolean). The represention of lattices via Galois correspondences and the concept of nucleus are shown to lead naturally to the notion of nuclear Galois relation. This results in the definition of residuated frames as a suitable generalization of Kripke semantics for FL-algebras. &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 19, 2006, 12:30-1:50 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. M. Andrew Moshier&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Hofmann-Mislove Theorems in Bitopological Settings&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The Hofmann-Mislove Theorem for sober topological spaces establishes a valuable connection between compact subsets and certain filters of opens, roughly speaking, by extending the bijection between points and completely prime filters that characterizes sober spaces. The theorem has proved to be very useful in domain theory and other areas of topology. &lt;br /&gt;
&lt;br /&gt;
In the first part of this talk, we will consider ways to interpret the classical result as well as its frame-theoretic analogue. Following that, we will discuss new results on bitopological spaces and their Stone duals.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;N.B&#039;&#039;. This talk is self-contained. Although last seminar talk &amp;quot;On the Bitopological Nature of Stone Duality&amp;quot; provides some motivation, I will not use any technical ideas from that talk.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 28, 2006, 12:30-1:30 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. M. Andrew Moshier&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; On the Bitopological Nature of Stone Duality&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; &lt;br /&gt;
The relationship between classical Stone Duality and the theory of frames is much more subtle than one is often lead to believe. In particular, Stone Duality has to do with bounded distributive lattices (and more specially, Boolean rings) that need not be complete, whereas a frame is a special sort of complete lattice. So Stone&#039;s original results, as well as several more recent Stone-type dualities, do not actually generalize, nor specialize, the duality between spaces and frames (here refered to as &amp;quot;Papert/Isbell duality&amp;quot;).&lt;br /&gt;
&lt;br /&gt;
We provide a uniform treatment of Stone-type dualities as well as Papert/Isbell duality, both as specializations of a general concrete adjunction. Toward this end, we introduce the category of &amp;quot;d-frames&amp;quot; as the duals of bi topological spaces. In frames, two distinct notions of order are conflated: a frame is a certain kind of dcpo (information ordered) and is a certain kind of distributive lattice (logically ordered). In d-frames, the symmetry between information and logic breaks naturally. It is this broken symmetry on the &amp;quot;frame-theoretic&amp;quot; side along with the asymmetry of bispaces on the &amp;quot;topological side&amp;quot; that allows for a uniform treatment of Stone and Isbell duality.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 21, 2006, 12:30-1:30 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Raymundo Marcial Romero&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; A computational framework for exact real number arithmetic.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Almost every mechanical device to do real number calculations uses the well-known floating-point arithmetic. However floating-point arithmetic cannot represent every real number in an exact form. Hence, in a calculation a rounding is done to the closest floating-point number. Although this kind of representation is useful for a large number of calculations, there are other frameworks in which more accurate solutions are required. Exact real number arithmetic is a different paradigm to do real number computation in an &amp;quot;exact&amp;quot; form. In this talk we sketch exact real number arithmetic and present a programming language to work with it.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 14, 2006, 12:30-1:30 pm ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Professor Daniele Struppa &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Algebraic Analysis of Dirac Systems&lt;br /&gt;
&lt;br /&gt;
----&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2008&amp;diff=16</id>
		<title>MathCS Seminar 2008</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2008&amp;diff=16"/>
		<updated>2021-02-22T18:37:11Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;== Fall 2008 ==  The seminar talks are usually in Beckman Hall 207 (corner of [http://maps.google.com/maps?q=N+Glassell+St+%26+University+Dr,+Orange,+CA+92866,+USA&amp;amp;sa=X&amp;amp;oi=map...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Fall 2008 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are usually in Beckman Hall 207 (corner of [http://maps.google.com/maps?q=N+Glassell+St+%26+University+Dr,+Orange,+CA+92866,+USA&amp;amp;sa=X&amp;amp;oi=map&amp;amp;ct=title N. Glassell St and University Drive], Orange, CA 92866)&lt;br /&gt;
----&lt;br /&gt;
 &lt;br /&gt;
=== Friday, December 5th, at 1:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr.Martha Dussan, Universidade de Sao Paulo &amp;amp; UCI&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
A characterization of Christoffel transform in the Split-Quaternions&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
This talk is focusing to characterize the Christoffel pairs of timelike isothermic surfaces in the split-quaternions $H&#039; = \mathbb R^4_2$. When we restrict the ambient space to the imaginary split-quaternions $Im H&#039; = \mathbb R^3_2$, we also characterize  that kind of pair through of the existence of an integranting factor. This a joint work with Prof. M. Magid.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 20th, at 1:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. David Pincus , &lt;br /&gt;
Chapman University, &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
Fractal Dynamics in Interpersonal Processes&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
This presentation will review a line of research investigating a theoretical model of interpersonal dynamics based on processes of self-organization and complexity theory.  Empirical investigations of the complexity of patterns of repetition in verbal turn-taking behaviors during conversations using various measures of entropy (topological, information, and fractal dimension) have consistently demonstrated that interpersonal dynamics exhibit fractal patterns characteristic of far-from-equilibrium conditions at the “edge-of-chaos.”  For example, statistical fits between an inverse-power-law (IPL) model and long-sequence patterning in conversations have ranged from R2 = .87 to R2 = .99.  These results have been found in conversations within group therapy, family therapy, and experimentally-created relationships among strangers. Furthermore, a statistical model of interpersonal closeness, conflict, and control accounted for a combined 48% of the variance in pattern repetition (structure) within the IPL above and beyond speaker base-rates (combinatorial probabilities).  Finally, a series of experimental investigations has demonstrated that the fractal dimension of turn-taking patterns within small groups shifts significantly in the direction of rigidity depending upon levels of internal conflict within group members.  In addition to some practical significance for applied psychology, these results provide for a number of possible theoretical integrations, within psychology between psychology and other scientific domains.  Key areas for discussion will include:  a) The potential to derive more formal and specific mathematical models (e.g., differential equation models) to simulate relationship development over time and under various conditions; b) Graphics programs that could more effectively display the fractals underlying these conversations; and c) improved statistical procedures that could better identify processes such as bifurcations, transients, and changes in the contributions of individuals to overall group structure during conversations.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 6th, at 4:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Adrian Vajiac, &lt;br /&gt;
Chapman University, &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
Algebraic Analysis of ElectroMagnetism&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
In recent years, techniques from computational algebra have become important to render effective general results in the theory of Partial Differential Equations.  Following our work with D.C. Struppa, I. Sabadini, F. Colombo, and M. Vajiac, we will present how these tools can be used to discover and identify important properties of several physical systems of interest such as Electromagnetism and Abelian Instantons.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 23rd, at 4:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Professor Roman A. Polyak, &lt;br /&gt;
Department of Mathematical sciences &amp;amp; SEOR Department, George Mason University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
Nonlinear Equilibrium vs. Linear Optimization&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
We consider the Generalized Walras-Wald Equilibrium (GE) as an alternative to Linear Programming (LP) approach for optimal recourse allocation. There are two fundamental differences between the GE and LP approach for the best resource allocation.&lt;br /&gt;
First, the prices for goods (products) are not fixed as they are in LP; they are functions of the production output.&lt;br /&gt;
Second, the factors (resources) used in the production process are not fixed either; they are functions of the prices for the resources.&lt;br /&gt;
It was shown that under natural economic assumptions on both prices and factors vector functions the GE exists and unique. &lt;br /&gt;
Finding the GE is equivalent to solving a variational inequality with a strongly monotone operator on nonnegative octants of the primal and dual spaces. For solving the variational inequality a projected pseudo-gradient method was introduced , his global convergence with Q-linear rate was proven an its computational complexity was estimated. &lt;br /&gt;
The method can be viewed as a natural pricing mechanism for establishing an economic equilibrium.&lt;br /&gt;
&lt;br /&gt;
About this week&#039;s speaker: Roman A.Polyak, received Ph. D in mathematics from Moscow Central Institute of Mathematics and Economics at the Soviet Academy of Sciences.&lt;br /&gt;
After emigration from the former Soviet Union he was a visiting scientist at the Mathematical Sciences Department at the T.J. Watson Research Center IBM. &lt;br /&gt;
Since 1995 Dr. Polyak is a Professor of Mathematics and Operations Research at George Mason University.&lt;br /&gt;
He is an author and co-author of six monographs and chapters of books and published more than sixty papers in refereed professional journals. &lt;br /&gt;
His area of expertise is Linear and Nonlinear programming  , game theory and mathematical economics. &lt;br /&gt;
He received several NSF and NASA Awards as well as the Fulbright Scholarship Award for his work on Nonlinear Rescaling Theory and Methods in constrained optimization.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 16th, at 4:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac, &lt;br /&gt;
Chapman University, &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
Hartogs Phenomena and Antisyzygies for Systems of Differential Equations&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
This work, in collaboration with A. Damiano, D. Struppa, and A. Vajiac introduces the notion of antisyzygies, which studies the inverse problem of finding a system of PDEs, given compatibility conditions. The system obtained possesses the property of removability of compact singularities. We also write explicit computations in the cases of the Cauchy-Fueter system and Maxwell’s system for electromagnetism, and we conclude with a study of systems of non-maximal rank.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 2nd, at 4:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Cyril Rakovski, &lt;br /&gt;
Chapman University, &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
Unweighted analysis of counter-matched case-control data. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
Informative sampling based on counter-matching risk set subjects on an exposure variable has been shown to be an efficient alternative to simple random sampling when the counter-matching variable is correlated with the variable of interest; however, the opposite is true when the counter-matching variable is independent of the variable of interest. For given counter-matched data, we consider a naive analysis of the effect of a dichotomous covariate on the disease rates that ignores the underlying sampling design and its corresponding effect on the analytic expression of the partial likelihood. We provide analytical expressions for the bias and variance and show that under mild common conditions such an analysis is clearly advantageous over the standard &amp;quot;weighted&amp;quot; approach. The efficiency gains could be large and are inversely related to the prevalence of the counter-matching variable. Finally, we ascertain that departures from the required assumptions entail biased estimates and provide numerical values for the bias for common scenarios.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 25th, at 4:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Arek Goetz, &lt;br /&gt;
San Francisco State University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
The interplay of symbolic computing with geometry in dynamical systems arising from theoretical electrical engineering problems.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
The talk accessible to nonprofessionals will lead the audience into an exciting journey of the beauty of geometric structures obtained using computational mathematics derived from discontinuous dynamical systems that arise from problems in electrical engineering.&lt;br /&gt;
We illustrate how rigorous computational mathematics and elementary number theory is used producing fractal structure of piecewise isometries.&lt;br /&gt;
&lt;br /&gt;
Key words: fractals, computational mathematics, cyclotomic fields, dynamical systems, digital filters, piecewise isometries, computers producing publishable papers.&lt;br /&gt;
&lt;br /&gt;
The CV link: http://calculus.sfsu.edu/goetz/vitae.pdf&lt;br /&gt;
Arek Goetz is professor of mathematics at San Francisco State University. An active researcher in dynamical systems, software architect and an educator, has delivered over 90 talks on 5 continents. He is a recipient of two National Science Foundation Grants, as well as numerous teaching grants.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 11th, at 4:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Giovanni Sambin&lt;br /&gt;
Department of Pure and Applied Logic&lt;br /&gt;
University of Padua&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
The Basic Picture: an interactive introduction by questions &amp;amp; answers.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
To define a topology on a set $X$ in a constructive way (where contructive here means both intuitionistic and predicative), one needs a second set $S$ and a family of subsets of $X$ indexed on $S$, that is, a relation between $X$ and $S$. I have called this structure a basic pair.&lt;br /&gt;
One can show that interior and closure of a subset are defined in a basic pair by formulae which are strictly dual of each other (the former is of the form $\exists\forall$, the latter $\forall \exists $).&lt;br /&gt;
&lt;br /&gt;
Continuity between basic pairs is expressed by a commutative diagram of relations (up to a suitable notion of equality).&lt;br /&gt;
&lt;br /&gt;
The main pointfree structure has a primitive for closed subsets (positivity) which is dual to that for open subsets (formal cover), and they are linked by a condition (called compatibility) which is best expressed by using the notion of overlap between subsets (the existential dual of inclusion).&lt;br /&gt;
&lt;br /&gt;
These discoveries show that there is a  clear and simple structure underlying topology, and that it is a sort of applied logic. I have called it the Basic Picture. Both traditional (&amp;quot;pointwise&amp;quot;) and pointfree topology  in the proper sense are obtained as a special case. In fact,  a topological space is just a basic pair equipped with convergence (any two approximations of a point can be refined to a third), and continuous functions are just those relations which preserve  convergence.&lt;br /&gt;
&lt;br /&gt;
Besides allowing for a fully constructive development of topology, this approach brings to some technical improvements which are new also for the classical approach. In particular, one can prove that the category of topological spaces with continuous relations can be embedded in the category of formal topologies (i.e. pointfree topologies in a constructive sense), thus giving a mathematical form to the well-known claim that pointfree topology generalizes the traditional one with points.&lt;br /&gt;
&lt;br /&gt;
On all this, I am writing a book (The Basic Picture. Structures for constructive topology&amp;quot;,  Oxford U.P., forthcoming). After around 20 minutes expanding on the above summary, I am ready to give an introduction to the content and general philosophy of the book, by discussing with the audience any questions they would like to put.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, August 28, 2008, 4-5 pm, BK 207 ===&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Georg Struth (University of Sheffield, UK)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Verification Based on Algebra and Automated Deduction&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The formal analysis and verification of computing systems has so far been dominated by model checkers and other decision procedures which are fully automated, but limited in expressive power, and by interactive theorem provers which are quite expressive, but limited in automation. Due to improved hardware and theoretical developments, automated deduction is currently emerging as a third way in which expressivity and computational power are differently balanced and which conveniently complements the other approaches.&lt;br /&gt;
&lt;br /&gt;
I will present a new approach to formal verification in which computational algebras are combined with off-the-shelf automated theorem provers for first-order equational logic. The algebras considered are variants of Kleene algebras and their extensions by modal operators. Particular strengths of these structures are syntactic simplicity, wide applicability, concise elegant equational proofs, easy mechanizability and strong decidability.&lt;br /&gt;
&lt;br /&gt;
I will sketch the axiomatization and calculus of Kleene algebras and modal Kleene algebras, discuss some computationally interesting models, such as traces, graphs, languages and relations, and point out their relationship to popular verification formalisms, including dynamic logic, temporal logic and Hoare logic. I will also report on some automation results in the areas of action system refinement, termination analysis and program verification that demonstrate the benefits and the potential of the algebraic approach.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2008 ==&lt;br /&gt;
&lt;br /&gt;
=== Thursday, May 8, 2008, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Professor Alfonso Cariazzo (University of Sevilla)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Chen&#039;s inequalities in generalized Sasakian-space-forms&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Recently, P. Alegre, D. E. Blair and the speaker defined generalized Sasakian-space-forms as those almost contact metric manifolds with a Riemann curvature tensor satisfying the usual equation for a Sasakian-space-form, but with some differentiable functions $f_1; f_2; f_3$ instead of the well-known constant quantities (c + 3)=4 and (c ¡ 1)=4.&lt;br /&gt;
In this talk, we will review the main facts about generalized Sasakian-space-forms, such as the existence of interesting examples in any dimension, or the possible structures for these spaces. After that, we will present sharp inequalities involving ±-invariants for submanifolds in this setting, with arbitrary codimension. In fact, ±-invariants, introduced by B.-Y. Chen, have proven to be a key tool in Submanifolds Theory, providing new very useful information concerning the immersion problem.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, May 1, 2008, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Professor Vincenzo Vespri, (University of Firenze)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Harnack inequalities for nonlinear parabolic equations&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk I&#039;ll speak about recent results obtained in collaboration with Emmanuele DiBenedetto and Ugo Gianazza.&lt;br /&gt;
In the sixties Moser, using deep Nash ideas, proved Harnack inequalities for nonnegative solutions of linear parabolic equations with $L^\infty$ coefficients.  This approach, however,  seems not to work in the nonlinear case (for instance in the case of p-Laplacean and porous medium equation). In recent papers published on Calc. Var., Acta Math and Duke Math. J., we  give an alternative proof of the Harnack inequality with respect the Moser&#039;s one based on DeGiorgi&#039;s function classes. This approach is so flexible that it can be extended to the nonlinear case.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, April 29, 2008, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Hung-Jen (Steward) Huang, (Chapman University) &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Bayesian Analysis of Errors-in-Variables Growth Curves with Skewness in Models&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We propose to analyze model data 1) using errors-in-variables (EIV) model and 2) using the assumptions that the error random variables are subject to the influence of skewness through Bayesian approach. The use of EIV in model is necessary and realistic in studying many statistical problems, but their analysis usually mandate many simplifying and restrictive assumptions. Previous studies have shown the superiority of Bayesian approach in dealing with the complexity of these models. &lt;br /&gt;
&lt;br /&gt;
In fitting statistical models for the analysis of growth data, many models have been proposed. We selected an extensive list of the most important growth curves and using some of them in our model analysis. Much research using classical approach has clustered on this area. However, the incorporation of EIV into these growth models under Bayesian formulation with skewness models have not yet been considered or studied. A motivating example is presented and in which we expose certain lacunae in the analysis previously done as well as justify, the applicability of the our general approach proposed alone. In addition, auxiliary covariates, both qualitative and quantitative, can be added into our model as an extension. This EIV growth curves with auxiliary covariates in models renders a very general framework for practical application. &lt;br /&gt;
&lt;br /&gt;
Another illustrative example is also available to demonstrate how Bayesian approach through MCMC (Metropolis Hastings/slice sampling in Gibbs sampler) techniques as well as Bayesian Information Criterion (BIC) for model selection can be utilized in the analysis of this complex EIV growth curves with skewness in models.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 24, 2008, 2:15-3:15 pm, BK 207 ===&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Alberto Damiano (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Syzygies, Antisyzygies, and how I defeated the Dirac system in a Singular way&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In my talk I will present an overview of some of the results from this year’s collaboration with D. Struppa, and A. and M. Vajiac, together with some of the questions that still remain open. First, I will introduce a new concept of “antisyzygies”, which constitutes a sort of inverse problem within the framework of algebraic analysis. Usually people start from a (non-homogeneous) system of PDEs, and hunt for the integrability conditions. We asked ourselves the opposite question: if we are given the compatibility laws, how can we reconstruct the system in some canonical way? What are the properties of the system that we get? In particular, I will mention the relation between the antisyzygy construction and Hartogs type of phenomena (removability of compact singularities from the solutions).&lt;br /&gt;
&lt;br /&gt;
On a more computational side, I will present an idea that D. Eelbode and I had during his stay at Chapman. The goal is to construct the syzygies for the Dirac system in several vector variables. I already touched upon some of the possible techniques to computer those syzygies in my previous talks. This time, I will show how to use the computer algebra software Singular and the structure of the super Lie algebra osp(1|2) to get the (minimal) free resolution of the system, in just a few command lines.  &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, April 17, 2008, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Jeff Krause, Shodor Foundation&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Preparing for the Interdisciplinary Challenges of Post-Genomic Biology:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Biology is in a state of flux. The tremendous changes are due to rapidly advancing experimental technologies that are producing previously unheard of quantities of data. Storing these data and extracting information from them have caused an explosion in the field of biomedical informatics. A further quantitative emphasis results from the fact that these new experimental technologies are able to make many measurements from complex multi-scale biological systems in a single experiment. Our ability to effectively validate these data and hypothesize with them is dependent on our ability to produce predictive quantitative models of these systems. While the past decade has been truly exciting for biologists and others drawn to the field, it has resulted in a dire need for curricular reform in the biological sciences in order to prepare students for careers in post-genomic biology. In my talk I will survey the quantitative and computational landscape of contemporary biology, and I will discuss various organizations, programs and resources that have been developed in support of efforts to integrate quantitative and computational training into the undergraduate biology curriculum.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, April 8, 2008, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; David Eelbode (University of Ghent, Belgium)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Higher spin operators in Clifford analysis:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this lecture, we will explain how one can fully exploit the framework of Clifford algebras and Clifford analysis in order to construct a function theory for higher spin Dirac operators. These are to be seen as far-reaching generalizations of the classical Dirac operator, possibly describing (exotic) elementary particles in higher dimensions. We will carefully explain how to describe the underlying invariance with respect to the underlying Lie algebra so(m), and how to relates the associated theory to Clifford analysis in several vector variables.&lt;br /&gt;
&lt;br /&gt;
This work is done in collaboration with my PhD-student Liesbet Van de Voorde&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 3, 2008, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Cyril Rakovski, Department of Preventive Medicine, Division of Biostatistics, Keck School of Medicine, USC&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Novel statistical methods for detecting genetic association between phenotypes and multiple genes:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Association methods employed for finding deleterious mutations in human populations are categorized into two broad classes with respect to the structure of the analyzed data, case-control and family-based. Case-control studies are flexible, powerful and cost-efficient approaches that possess an inherent design disadvantage, susceptibility to inflated rates of false-positive results due to unaccounted population structure and hidden relatedness. Family-based tests for association (FBATs) provide a robust alternative to case-control methods that address the above-mentioned shortcomings by conditioning on the population information. New FBAT extensions for handling multiple correlated genes and a relatedness-adjusted case-control statistical method that accounts for stratified populations are proposed and studied through extensive simulations in various settings. Our results show that in most of the analyzed scenarios the new tests attain higher power than the currently existing approaches.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 6, 2008, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Hendrik de Bie, Ghent University, Belgium&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Harmonic and Clifford analysis in superspace:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Superspaces are spaces with not only commuting variables but also anti-commuting variables. We will show how it is possible to extend harmonic and Clifford analysis to these superspaces by constructing a suitable representation of sl(2) and osp(1|2). Then we will use this representation to consider integration in superspaces and we will give a set of properties that uniquely determine the Berezin integral on the supersphere.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 28, 2008, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Peter Jipsen, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Using Gentzen system techniques with existing automated theorem provers and rewriting tools&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Gentzen systems have been used to present many logics, such as classical logic, intuitionistic logic, modal logics, substructural logics, and their corresponding algebraic axiomatizations, in modular ways that provide new insights and often lead to effective decision procedures.&lt;br /&gt;
The aim of this talk is to show that Gentzen sequent calculi can be used in standard resolution theorem provers to improve their search space characteristics. This is mostly of use with (semi)lattice ordered algebras, and does not require cut-free Gentzen systems. For example it is currently not known if there is a cut-free Gentzen system for residuated Kleene algebras or residuated Kleene lattices. However if axiomatizations for these equational theories are presented in the style of Gentzen sequent rules, then a theorem prover such as Prover9&lt;br /&gt;
(www.prover9.org) can be quite an effective reasoning tool in these otherwise rather untractable theories.&lt;br /&gt;
I will also discuss how cut-free Gentzen systems can be implemented effectively using standard rewriting tools such as Maude (http://maude.cs.uiuc.edu/).&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 21, 2008, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Andrew Moshier, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;  Free Constructions of Directed Complete Partial Orders&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We develop a &amp;quot;generators and relations&amp;quot; method of constructing directed complete partial orders (dcpos), and show that the results are indeed free in the usual sense. We then continue by considering the situation where the generator set is equipped with finitary operations, showing that the free construction yields a dcpo algebra (in which the operations are Scott continuous) in the same algebraic variety as the generating structure. We apply the results to the construction of co-products, and the characterization of sub-objects, in the category of &amp;quot;proto-frames&amp;quot;. This is joint work with Achim Jung and Steve Vickers of Univ. of Birmingham, UK.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 7, 2008, 1:30-2:30 pm, BK 207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Jack Stecher, Norwegian School of Economics and Business Administration&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;  Decision Making and Trade with Subjective Information&lt;br /&gt;
&lt;br /&gt;
----&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2009&amp;diff=15</id>
		<title>MathCS Seminar 2009</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2009&amp;diff=15"/>
		<updated>2021-02-22T18:36:29Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;== Fall 2009 ==   The seminar talks are usually in Beckman Hall 207 (corner of [http://maps.google.com/maps?q=N+Glassell+St+%26+University+Dr,+Orange,+CA+92866,+USA&amp;amp;sa=X&amp;amp;oi=ma...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Fall 2009 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The seminar talks are usually in Beckman Hall 207 (corner of [http://maps.google.com/maps?q=N+Glassell+St+%26+University+Dr,+Orange,+CA+92866,+USA&amp;amp;sa=X&amp;amp;oi=map&amp;amp;ct=title N. Glassell St and University Drive], Orange, CA 92866)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, December 3rd, at 4:00pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039;  Prof. Robert Desharnais (CSULB)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Chaos in a Bottle:  Experimental Nonlinear Population Dynamics&lt;br /&gt;
&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; Research in ecology is increasingly interdisciplinary.  This presentation will describe a long-term collaboration among biologists, mathematicians, statisticians which is focused on understanding how nonlinearity manifests itself in the dynamics of ecological populations.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, November 19th, at 5:15pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Irene Sabadini, Dipartimento di Matematica, Politecnico di Milano&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Slice Hyperholomorphy and its Functional Calculus&lt;br /&gt;
&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; TBA&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, November 5th, at 4:00pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speakers:&#039;&#039; Prof. Cyril Rakovski and Lisa Brown, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; On the ranking of the disease susceptibility locus in family-based candidate gene studies: a simulation-based analysis&lt;br /&gt;
&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; We carried out an extensive family-based candidate gene simulation study to analyze the position of the true causal single nucleotide polymorphism in the complete list of marker p-values ordered according to their statistical significance. We used the real haplotype structures of 10 genes from the HapMap dataset, various sample sizes that current studies employ and disease models that mimic the characteristics of complex human disorders. We found that the all three factors, gene, disease model and sample size have profound effect on the rank of the causal SNP.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, October 22nd, at 4:00pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Bicomplex Hyperfunctions&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; In this talk we will develop the foundations for a theory of hyperfunctions as cohomology classes of bicomplex hyperholomorphic functions. The sheaf H of bicomplex hyperholomorphic functions was defined and studied in an earlier paper. We discuss some cohomological properties of H, we compute its flabby dimension and we use the knowledge of its resolution to define a sheaf of hyperfunctions. These hyperfunctions will be objects defined on a codimension three real analytic variety in the space BC of hypercomplex numbers. This is consistent with the fact that the flabby dimension of H is three.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, October 8th, at 4:00pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Adrian Vajiac, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Singularities of functions of one and several bicomplex variables&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; In this talk we introduce the notion of regularity for functions of one, as well as several bicomplex variables.&lt;br /&gt;
Moreover, using computational algebra techniques, we prove that regular functions of one bicomplex variable have the property that their compact singularities can be removed.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, September 17th, at 4:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Andrew Moshier, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Concrete Limits of Locales&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; In the category of locales, dual to the concrete category of frames, limits are usually constructed as co-limits of frames. In this talk, we reconsider the limit constructions by viewing locales concretely as certain complete meet semi lattices.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, August 27th, at 4:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Lev Vaidman, Tel Aviv University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Where is the  Quantum Particle between two Measurements?&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; Wheeler Delayed Choice experiment, Elitzur-Vaidman Interaction-free Measurement, and Hosten-Kwiat Counterfactual Computation will be discussed to answer Bohr&#039;s forbidden question: &amp;quot;Where is a quantum particle while it is inside a Mach-Zehnder Interferometer?&amp;quot; The analysis reveals a paradoxical feature of a pre- and post-selected quantum particle: it can reach a certain location without being on the path that leads to and from this location.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
== Spring 2009 ==&lt;br /&gt;
&lt;br /&gt;
  &lt;br /&gt;
=== Thursday, March 5th, at 4:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
Topological duality, canonical extensions and decidability for lattices with quasioperators.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
Lattice-ordered monoids, residuated lattices, modal lattices and De Morgan lattices are all examples of lattices with quasioperators, i.e. operations that preserve joins or send meets to joins in each argument or preserve meets or send joins to meets in each argument. In a previous seminar talk Prof. Moshier presented a duality between bounded lattices and a natural subcategory of topological spaces. We will review this duality and extend it to bounded lattices with quasioperators. We consider the connection to earlier dualities of Urquhart, Hartung, and Hartonas and to the canonical extension  by Gehrke and Harding, as well as to Galois frames with additional relations.&lt;br /&gt;
&lt;br /&gt;
Within this framework, we then discuss techniques for proving the decidability of the equational theory of various varieties of bounded lattices with quasioperators. We will also consider algorithms for constructing finite models in these varieties, and present an implementation that enumerates all models based on a given finite Galois frame. &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 19th, at 4:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Professor Bernhard Banaschewski&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
Point-free Topology and the Representation of Lattice-ordered Rings&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
The classical representation of archimedian f-rings with unit by continuous functions on topological spaces unavoidably requires the use of extended realvalued functions, with all the inherent complications that involves. By way of contrast, the natural counterpart of the usual notion of a real-valued continuous function in point-free topology provides a setting in which these l-rings can be embedded in the corresponding rings of real-valued continuous functions. This talk will describe that point-free representation in terms of the relevant function ring functor and its left adjoint, and then show how this adjointness may be used to obtain certain results about f-rings from point-free topology.&lt;br /&gt;
&lt;br /&gt;
This seminar is part of CHAPMAN UNIVERSITY&#039;s &amp;quot;WORKSHOP ON POINT-FREE TOPOLOGY&amp;quot; to which you are also invited.&lt;br /&gt;
Week of: February 17–20, 2009&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Week of February 16th-20th, in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;WORKSHOP ON POINT-FREE TOPOLOGY&#039;&#039; in honor of Bernhard Banaschewski’s visit to ChapmanvUniversity.&lt;br /&gt;
&lt;br /&gt;
Organized by Dr. Andrew Moshier&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Initial schedule:&#039;&#039;&lt;br /&gt;
Feb 17 &lt;br /&gt;
&lt;br /&gt;
11:00 – 1:00 B. Banaschewski&lt;br /&gt;
Essential Completion in Point-free Topology, Part I.&lt;br /&gt;
&lt;br /&gt;
4:00 – 5:00 M. A. Moshier&lt;br /&gt;
Skew frames and Point-free Bitopology.&lt;br /&gt;
&lt;br /&gt;
Feb 18 &lt;br /&gt;
&lt;br /&gt;
11:00 – 1:00 B. Banaschewski&lt;br /&gt;
Essential Completion in Point-free Topology, Part II.&lt;br /&gt;
&lt;br /&gt;
Feb 19 &lt;br /&gt;
&lt;br /&gt;
10:00 – 11:15 F. Dashiell&lt;br /&gt;
Kuratowski Reduction in ?-frames.&lt;br /&gt;
&lt;br /&gt;
4:00 – 5:00 B. Banaschewski&lt;br /&gt;
Point-free Topology and the Representation of Lattice-ordered Rings.&lt;br /&gt;
&lt;br /&gt;
Feb 20 &lt;br /&gt;
&lt;br /&gt;
11:00 – 1:00 B. Banaschewski&lt;br /&gt;
Essential Completion in Point-free Topology, Part III.&lt;br /&gt;
&lt;br /&gt;
For more information and updates contact:&lt;br /&gt;
M. Andrew Moshier&lt;br /&gt;
(714) 997 6628&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
 &lt;br /&gt;
=== Thursday, February 12th, at 4:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Andrew Moshier Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
Topological Duals and Canonical Extensions for Arbitrary Bounded Lattices&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
Is there a subcategory of Top (the category of topological spaces) that is dually equivalent to BLat (the category of bounded lattices)?&lt;br /&gt;
&lt;br /&gt;
This question has only been affirmatively answered either by restricting BLat to special cases, e.g., Boolean or distributice lattices, or by expanding Top to a category of spaces with extra structure. The latter approach indeed yields duality theories for the general case of BLat, but the results are highly technical and have turned out not to be particularly useful to lattice theorists.&lt;br /&gt;
&lt;br /&gt;
We give an affirmative answer to the above question with no qualifications. &lt;br /&gt;
The result is a significant improvement in the theory of topological duality for lattices. To illustrate the point, we show that the canonical extension of a lattice &#039;lives&#039; inside its topological dual in a very natural way.  &lt;br /&gt;
Time permitting, as a further illustration, we will also derive a representation theory for orthocomplemented lattices from the general setting.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
 &lt;br /&gt;
=== Friday, January 12th, at 1:00pm in BK207 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Rebecca Goldin, GMU, Director of Research at STATS (www.stats.org), a nonprofit affiliated with GMU.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;&lt;br /&gt;
The Two-Sphere Spinning Around an Axis: an Introduction to Symplectic Geometry with Hamiltonian Group Actions&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
I will describe a beautiful relationship between symplectic manifolds with Hamiltonian group actions, and convex polytopes. The essential goal in this &amp;quot;business&amp;quot; is to find a way of describing difficult geometry in terms of combinatorial objects such as polytopes. We will illustrate these ideas through one of the most basic example, the two-sphere with a circle rotating it around an axis. All terms will be defined.&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2010&amp;diff=14</id>
		<title>MathCS Seminar 2010</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2010&amp;diff=14"/>
		<updated>2021-02-22T18:35:44Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;== Fall 2010 ==  The seminar talks are in Von Neumann Hall 116 (545 W Palm Ave corner of W Palm Ave and railroad, Orange, CA 92866)  The talks usually start at 4 pm. From 3:30...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Fall 2010 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are in Von Neumann Hall 116 (545 W Palm Ave corner of W Palm Ave and railroad, Orange, CA 92866)&lt;br /&gt;
&lt;br /&gt;
The talks usually start at 4 pm. From 3:30 pm to 4:00 pm is time for refreshments and interesting conversations with the speaker, so consider coming a bit early.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 9, at 3:30 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. M. Andrew Moshier (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; A Bitopological Point-free Approach to Compactifications&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; D-frames, consist of a pair of frames, together with two relations which serve as abstractions of disjointness and covering, are a suitable point-free counterpart to bitopological spaces. In particular, the &amp;quot;topological&amp;quot; separation axioms of regularity and normality have natural analogues in d-frames. We develop a bitopological point-free notion of complete regularity and characterise all compactifications of completely regular d-frames. Given that normality of topological spaces does not behave well with respect to products and subspaces, probably the most surprising result is this: The compact regular coreflection of completely regular d-frames (Stone-C(ech compactification) factors through the subcategory of normal d-frames. Moreover, any compactification can be obtained by first producing a regular normal d-frame and then applying the Stone-C(ech compactification to it. Our point-free bitopological compactification subsumes all classical compactifications of frames as well as Smyth?s stable compactification.&lt;br /&gt;
&lt;br /&gt;
This is joint work with Olaf Klinke and Achim Jung (Univ. of Birmingham, UK).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 18, at 4 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. John Harding (New Mexico State University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Subalgebras of orthomodular lattices&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Recent approaches to the foundations of quantum mechanics initiated by Isham and others make use of the topology determined by the abelian subalgebras of a von Neumann algebra to treat various quantum mechanical concepts as sheafs of structures that locally behave as the classical counterparts. This leads to our investigation of properties of the poset of abelian subalgebras of a von Neumann algebra, or more generally, of the poset of Boolean subalgebras of an orthomodular lattice. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, November 9, at 4 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Fabrizio Colombo, Politecnico of Milano&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; An introduction to the F-functional calculus&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk, I will recall the classical Fueter mapping theorem and I will show how to provide a new version of the result written in integral form. &lt;br /&gt;
I will use this integral representation to construct a functional calculus for n-tuples commuting operators using a subclass of monogenic functions.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Irene Sabadini, Politecnico of Milano&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Some new results on the Dirac complex&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The complex of several Cauchy-Fueter operators is nowadays quite well understood and its knowledge implies several analytical consequences on the space of regular functions with quaternionic values. The higher dimensional analogue, i.e. the complex of several Dirac operators, is known in the case of three operators in the so-called &amp;quot;radial case&amp;quot;. We will show how to prove that the radial case is in fact the general case, using commutative algebra techniques.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 30, at 4 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Daniele Struppa (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; The mathematical legacy of Leon Ehrenpreis: 1930 - 2010&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Leon Ehrenpreis was one of the greatest Fourier analysts&lt;br /&gt;
of the twentieth century. In this talk I will discuss his celebrated Fundamental Principle, and its implications for contemporary research, including some recent results of mine on approximate solutions of differential equations.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 16, at 4 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Relation algebras as residuated lattices expanded with a De Morgan negation&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk we consider the variety DmRL&#039; of residuated lattices with a unary De Morgan operation &#039;. It has the same signature as relation algebras and includes a subvariety qRA of quasi-relation algebras defined by adding equations that ensure &#039; is a homomorphism from the residuated lattice to its dual. We show how relation algebras are a natural subvariety of qRA, but that qRA has the distinct advantage of having a decidable equational theory. This type of result is only possible if the order structure of relation algebras is generalized to De Morgan lattices, since Kuruczs, Nemeti, Sain and Simon proved in 1993 that any `large enough&#039; variety with Boolean algebra reducts and with an associative operator has an undecidable equational theory.&lt;br /&gt;
We also extend a result of Jonsson and Tsinakis [1993], where relation algebras are shown to be term-equivalent to a subvariety of residuated Boolean monoids, to the more general setting of quasi relation algebras. Much of the work reported here was done in collaboration with Nikolaos Galatos.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 9, at 4 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Mihaela Vajiac (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; The notion of Holomorphicity in the context of Multicomplex Spaces&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this presentation we study regularity notions and properties of functions defined on multicomplex spaces BC_n. Our results constitute a generalization of our previous research in this field (joint work with D.C. Struppa and A. Vajiac).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Summer 2010 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, July 22nd, at 10:00am in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Dan Zaffran, KEIST (South Korea)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Euler&#039;s formula and (much) more&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; A cube has F=6 faces, E=12 edges and V=8 vertices. A pyramid with a square base has F=5 faces, E=8 edges and V=5 vertices. Euler discovered in 1750 that for these two cases, or for any other polyhedron, F-E+V=2. He published the result, but he confessed that he was not able to prove it. This celebrated &amp;quot;Euler&#039;s formula&amp;quot; is the starting point of many results and conjectures in higher dimensions. I will explain some of them, and focus on the surprising methods that have been used to solve these problems: topological manifolds and their algebraic topology, algebraic geometry...&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2010 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are usually in Von Neumann Hall 116 (545 W Palm Ave corner of W Palm Ave and railroad, Orange, CA 92866)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, May 11th, at 4:30pm in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Ali Nayeri,, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; The State of the Universe: Certain Present, Dark Future and Shady Past&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; The past 20 years have seen dramatic advances in our understanding about the universe.  We seem to have established the basic parameters describing the behavior of our expanding Universe, thereby putting cosmology on a firm empirical footing. But the emerging  standard? model of the universe leaves many details to be worked out, and new ideas are emerging that challenge the theoretical framework on which the structure of the Big Bang is based. There is still a great deal left to explore in cosmology.&lt;br /&gt;
 &lt;br /&gt;
In this talk I will first review the status of the universe as we (think) we understand now. After reviewing the standard model of cosmology and the problems within I will present the new idea of structure formation and avoiding the initial singularity based on string theory which was developed in Harvard recently by my colleagues and I.&lt;br /&gt;
  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, May 6th, at 4:00pm in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Boyana Norris, Argonne National Laboratory, Mathematics and Computer Science Division&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Annotation-Based Empirical Performance Tuning of Scientific Applications&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; In many high-performance scientific applications, computational scientists spend significant time tuning codes for a particular high-performance architecture. Tuning approaches range from the relatively nonintrusive (e.g., by using compiler options) to extensive code modifications that attempt to exploit specific architecture features. Intrusive techniques often result in code changes that are not easily reversible, which can negatively impact readability, maintainability, and performance on different architectures. We describe an extensible annotation-based empirical tuning system called Orio, which is aimed at improving both performance and productivity by enabling scientific software developers to insert annotations in the form of structured comments that trigger a number of low-level performance optimizations on a specified code fragment. To maximize the performance tuning opportunities, we have designed the Orio framework to support both architecture-independent and architecture-specific code optimizations. Given the annotated code as input, Orio generates many tuned versions of the same operation and empirically evaluates the versions to select the best performing one for production use. We have also integrated other, independently developed, transformation approaches into Orio, such as the Pluto automatic parallelization tool for generation of efficient OpenMP-based parallel code and the PrimeTile tool for parametrized tiling of imperfect loop nests. We describe experimental results involving a number of computational kernels, including dense array and sparse matrix operations.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 22nd, at 3:00pm in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Zair Ibragimov, Cal State Fullerton&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Hyperbolization of metric spaces&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; Suppose Z is a locally compact noncomplete metric space. We introduce a metric u_Z on Z, which induces the topology of Z and turns Z into a hyperbolic metric (in the sense of Gromov). The metric u_Z can be thought of as a canonical Gromov hyperbolic metric of Z since it appears that many Gromov hyperbolic metrics introduced in geometric function theory (such as: the Poincare metric, Barbilian metric, the hyperbolic cone metric, the j-metric and the hyperbolic metric of the hyperspaces) are special cases of u_Z (up to a quasiisometry). In particular, this in combination with the Gromov hyperbolicity of u_Z gives alternative proofs of the Gromov hyperbolicity of these metrics.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 15th, at 3:00pm in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. David Porter, Professor of Economics and Mathematics, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Combinatorial Auctions (with Stephen Rassenti)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; A combinatorial auction is a resource allocation process that can be&lt;br /&gt;
implemented when multiple resources must be simultaneously allocated&lt;br /&gt;
amongst competing users, and information concerning the values of the&lt;br /&gt;
various possible uses and constraints affecting those uses is&lt;br /&gt;
decentralized.  We will go through the design and implementation of&lt;br /&gt;
various methods for solving this problem and the computational and&lt;br /&gt;
incentive issues involved in such designs. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, April 6th, at 3:00pm in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039;  Prof. Le Hung Son, Hanoi University of Technology, Vietnam&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039;Additive Cousin Problem and Hartogs Extension Theorem in Clifford and Quaternion Analysis&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; It is known that the Additive Cousin Problem and Hartogs Extension Theorem are the fundamental events in Complex Analysis of several variables. The first one allows the construction of the global meromorphic functions by given local singularities and the second one states that holomorphic functions of several complex variables possess non isolated singularities. This talk deals with some remarks and comments concerning the same problems in Clifford Analysis, Quaternion Analysis and the theory of functions taking value in a Matrix Algebra.&lt;br /&gt;
Furthermore  in this talk we will try to reflect some new ideas and results on Clifford and Quaternion Analysis of higher dimensions and their applications to Partial Differential Equations, Mathematical Physics and Engineering Problems.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 25th, at 3:00pm in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Hendrik De Bie, Belgium and Oregon State&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039;The Clifford-Fourier transform&lt;br /&gt;
&lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; The Clifford-Fourier transform has been introduced a couple of years &lt;br /&gt;
ago by Brackx et al. So far, it is probably the most interesting &lt;br /&gt;
attempt at introducing a Fourier transform in the setting of Clifford &lt;br /&gt;
analysis, because it is defined by a similar exponential operator as &lt;br /&gt;
the classical Fourier transform. However, several questions regarding &lt;br /&gt;
this transform are still open: the integral kernel is not known, it is &lt;br /&gt;
not known on which function spaces the transform is defined, there is &lt;br /&gt;
only a formal proof of the inversion formula, etc.&lt;br /&gt;
&lt;br /&gt;
In recent work with Yuan Xu, I have succeeded in answering most of &lt;br /&gt;
these questions. We have found explicit expressions for the kernel in &lt;br /&gt;
all even dimensions, leading to estimates of the transform. We have &lt;br /&gt;
introduced a generalized translation operator and a related &lt;br /&gt;
convolution structure, which can be used to prove the inverse of the &lt;br /&gt;
transform.&lt;br /&gt;
&lt;br /&gt;
In this talk, I first give an overview of the classical Fourier &lt;br /&gt;
transform and how it can be generalized to the Clifford-Fourier &lt;br /&gt;
transform (stressing the Lie algebraic background). Next, I will &lt;br /&gt;
explain our recent results.&lt;br /&gt;
&lt;br /&gt;
[No special knowledge of Clifford analysis is necessary to follow the talk]&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 18th, at 3:00pm in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Periodic lattice-ordered pre-groups are distributive&lt;br /&gt;
               &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; \emph{Pregroups} are algebras of the form&lt;br /&gt;
$(A,\cdot,1,^l,^r,\le)$&lt;br /&gt;
such that $(A,\le)$ is a poset, $(A,\cdot,1)$ is a monoid, $x\le&lt;br /&gt;
y\Rightarrow uxv\le uyv$,&lt;br /&gt;
and $^l,^r$ are two unary operations, called the \emph{left and&lt;br /&gt;
right adjoint} that satisfy&lt;br /&gt;
$$&lt;br /&gt;
x^l\cdot x\le1\le x\cdot x^l\qquad x\cdot x^r\le1\le x^r\cdot x.&lt;br /&gt;
$$&lt;br /&gt;
They were defined by J.~Lambek in 1999 in a paper that provides a&lt;br /&gt;
new approach to categorial grammars, and they have been studied in&lt;br /&gt;
a series of recent papers by W.~Buszkowski from an algebraic and&lt;br /&gt;
proof theoretic perspective. Pregroups give an abstract setting for&lt;br /&gt;
studying maps on a poset that have all iterated left and right adjoints&lt;br /&gt;
(i.e. all residuals and dual residuals). E.g. partially ordered groups,&lt;br /&gt;
and hence groups, are pregroups. A \emph{lattice-ordered pregroup}&lt;br /&gt;
or $\ell$-pregroup is a pregroup expanded with $\wedge,\vee$ such&lt;br /&gt;
that the underlying poset is a lattice with respect to these operations.&lt;br /&gt;
The variety of $\ell$-pregroups contains all $\ell$-groups and is&lt;br /&gt;
itself contained in the variety of involutive residuated lattices.&lt;br /&gt;
An $\ell$-pregroup is \emph{periodic} if it satisfies the identity&lt;br /&gt;
$x^{ll\ldots l}=x$ for some finite iteration of left adjoints. In&lt;br /&gt;
this talk it is proved that all such $\ell$-pregroups have distributive&lt;br /&gt;
lattice reducts. The proof was found with assistance from the equational&lt;br /&gt;
theorem prover Waldmeister. It is still an open problem whether the&lt;br /&gt;
same result holds for all $\ell$-pregroups. &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 26th, at 4:00pm in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Marina Borovikova, CSUF&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Symmetric products of lines and circles.&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039;  The notion of symmetric product of topological spaces was introduced in 1931 by two Polish mathematicians, Karol Borsuk and Stanislaw Ulam. Since then it has been studied by many authors, mostly in topology. Recently, Z. Ibragimov has initiated the study of the symmetric product of metric spaces from a point of view of geometric function theory. Given a metric space $X$ and $n\geq 2$, the $n^{th}$ symmetric product $X$ is the set of all subsets of $X$ of cardinality less or equal to $n$, equipped with the Hausdorff metric. In this talk, I will discuss some results of K. Borsuk, S. Ulam and R. Bott on the $3^{rd}$ symmetric product of the real line $\mathbb R$ and the unit circle $\mathbb S^1$, and present some new results. (Joint work with Z. Ibragimov).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, February 18th, at 4:00pm in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Oscar Villareal, UCI&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Rational points on commutative algebraic groups and the Zilber-Pink conjecture.&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039;  Let $A$ be an semiabelian variety and $X$ a subvariety.&lt;br /&gt;
The Zilber-Pink conjecture states that the intersection of $X$ with&lt;br /&gt;
all of the semiabelian subvarieties of $A$ of codimension greater than&lt;br /&gt;
the dimension of $X$ is not Zariski dense.  We give some of the&lt;br /&gt;
motivation behind this conjecture along with known results.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, February 11th, at 4:00pm in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Oepomo, Tedja (WLAC)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Survey of power, QR, and Oepomo&#039;s iterative methods for solution of largest eigenvalue of essentially positive matrices.&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; Many of the popular methods for the solution of largest eigenvalue of essentially positive irreducible matrices are surveyed with the hope of finding an efficient method suitable for electromagnetic engineering, radiation problems, system identification problems, and solid mechanics. Eigenvalue computations are both fundamental and ubiquitous in computational science and its fast application areas. Some comparisons between several known algorithms, i.e. Power and QR methods, and earlier theory of Oepomo iterative techniques for solving largest eigenvalue of nonnegative irreducible matrices are presented since there is a continuing demand for new algorithm and library software that efficiently utilize and adapt to new applications.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, January 28th, at 4:00pm in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Jaroslaw Harezlak, Indiana University School of Medicine&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Impact of the design matrix structure on the performance of LASSO: An empirical study&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039; Abstract:&#039;&#039; High-throughput technologies in medical research provided statisticians with an ever increasing amounts of data. One of the methodological and practical challenges in the analysis of such data is variable selection in regression models. The past 15 years brought a formidable number of methods dealing with the variable selection in the case when the number of covariates is much larger than the number of observations (p &amp;gt;&amp;gt; n). Majority of the methods fall under the category of penalized likelihood which includes ridge regression, LASSO and its variations, SCAD and Dantzig selector.&lt;br /&gt;
&lt;br /&gt;
In our work, we provide simulation results on the performance of LASSO in the case of strong dependence between the columns of the design matrix X. We consider the estimation error, prediction error and a measure of concordance between the true and selected variables. We study the dependence of the results on the design matrix specification, “irrepresentability condition” of Zhao and Yu (2006) and &amp;quot;phase transition&amp;quot; of Donoho and Stodden (2006). We also compare these results with the more common situation of orthogonality of columns of X.&lt;br /&gt;
&lt;br /&gt;
In the compound symmetry case, we find that the increased dependence between the columns of X results in larger estimation error, but decreased prediction error. In the anisotropic correlation case, both estimation and prediction errors are the largest when the covariates exhibit both positive and negative correlations.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
=== Monday, January 4th to Saturday, January 15th in VN116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Workshop:&#039;&#039; OCCTAL WORKSHOP ON CONTEMPORARY TOPOLOGY&lt;br /&gt;
&lt;br /&gt;
                                   &lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Bernhard Banaschewski, McMaster University &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Essential completions in categories of Archimedean l-groups with order unit&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. Bernhard Banaschewski, McMaster University &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; On the ccc characterization of the function rings in pointfree topology.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speakers:&#039;&#039; Prof. Rick Ball, University of Denver, and Dr. Joanne Walters-Wayland, OCCTAL&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; The K-Briar Patch&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Dr. Peter Jipsen, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Some open problems regarding lattice-ordered pre-groups&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; Prof. M. Andrew Moshier, Chapman University&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title: &#039;&#039; Locales and Quantales Concretely&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2011&amp;diff=13</id>
		<title>MathCS Seminar 2011</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2011&amp;diff=13"/>
		<updated>2021-02-22T18:35:09Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;&amp;#039;&amp;#039;Seminar Organizers:&amp;#039;&amp;#039; Peter Jipsen and Cyril Rakovski  == Fall 2011 ==   === Thursday, December 8 at 4:00 pm in VN 116 ===  &amp;#039;&amp;#039;Speaker:&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;Professor Yakir Aharonov, [http:/...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;Seminar Organizers:&#039;&#039; Peter Jipsen and Cyril Rakovski&lt;br /&gt;
&lt;br /&gt;
== Fall 2011 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 8 at 4:00 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Yakir Aharonov, [http://www.chapman.edu Chapman University] and [http://www.chapman.edu/ACFS/Quantum/default.asp Center of Excellence in Quantum Studies]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Weak measurements and the discovery of a new kind of mathematics called superoscillations&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We are taught that if waves with a variety of wavelengths are superposed, then we cannot create structures whose details are smaller than the shortest wavelength in the original superposition. But this is not correct. That is, even if the smallest wave has a wavelength of 1m, we can create arbitrarily detailed structures, say, with feature sizes of 1mm.&lt;br /&gt;
&lt;br /&gt;
This miracle comes with a penalty: outside the superoscillatory region, the wave must be exponentially large. As an example, suppose we wanted to reproduce a Beethoven symphony with sound frequencies not larger than 1Hz, then somebody (possibly far away) would have to listen to sounds exp(10^19) louder.&lt;br /&gt;
&lt;br /&gt;
The new kind of mathematics we’ve been developing here at Chapman (a/k/a Superoscillations) has had significant implications for signal processing and has led to new kinds of microscopes which can resolve sub-wavelength structures without the use of evanescent waves.&lt;br /&gt;
&lt;br /&gt;
We were led to this discovery as a result of our work in quantum mechanics concerning the relationship between past, present and future and weak measurements.&lt;br /&gt;
&lt;br /&gt;
In this talk I will describe how this came about along with some new exciting discoveries concerning the nature of superoscillations.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/~jipsen/seminarposters/Aharonov_120811.pdf Poster]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 8 at 12:00 noon in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Joanne Walters-Wayland, [http://mathcs.chapman.edu/CECAT/ Chapman University Center of Excellence in Computation, Algebra and Topology (CECAT)]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The wizard of Coz&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The importance of considering topologies and topological properties via real-valued functions is indisputable – the well-known book by Gillman and Jerison, Rings of Continuous Functions, more than substantiates this claim. In a pointfree setting, this becomes, in my opinion, even more obvious. I shall endeavor to explain my fascination with the cozero part of a frame. By illustrating various aspects of “Coz”, highlighting a few of my favorite properties and explaining some of the problems I am attempting to understand, I hope to convey to the audience, albeit in a small and somewhat superficial way, why &amp;quot;Coz&amp;quot; is so magical and alluring.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/~jipsen/seminarposters/Walters-Wayland_120811.pdf Poster]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, November 18 at 3:00 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;First [http://www.chapman.edu Chapman University] and [http://www.csuf.edu Cal State University Fullerton] joint Mathematics Colloquium&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Program&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dr. Bogdan Suceava (CSUF)&#039;&#039;&#039; – 3:00 - 3:20&amp;lt;br&amp;gt;&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; A question of David Hilbert and its application to classes of metrics&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Lucy Odom (CSUF Undergraduate)&#039;&#039;&#039; – 3:25 - 3:45&amp;lt;br&amp;gt;&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Chasles Angle Invariance Property for the Helicoid&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Peter T. Ho (CSUF Undergraduate)&#039;&#039;&#039; – 3:50 - 4:10&amp;lt;br&amp;gt;&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Rotation Hypersurfaces in Lorentz-Minkowski Space with All Points Umbilics&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Dr. Peter Jipsen (Chapman)&#039;&#039;&#039; – 4:15 - 4:35&amp;lt;br&amp;gt;&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; Computational Investigations of the Lattice of Lattice Varieties&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/~jipsen/seminarposters/CSF_joint_colloquium.pdf Poster]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 17 at 4:00 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Robert Campbell, [http://www.uci.edu University of California at Irvine]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Interplanetary Communication Made Possible With Algebraic Coding&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; What does it take to send a message across our solar system? Moreover, if I have trouble maintaining a connection on my cell phone calls how does NASA plan to communicate with its satellites in deep space? Algebraic Coding to the rescue! Combining the power of computer science with the theory of mathematics we can create messages that fix themselves when an error occurs.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/~jipsen/seminarposters/Campbell_MathCS_seminar.pdf Poster]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 3 at 4:00 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Monroe Eskew, [http://www.uci.edu University of California at Irvine]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Definability and Infinity&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; What does it mean for a collection to be finite? On the one hand, we have our preschool notion that a collection is finite when it can be counted with natural numbers in a way that terminates. On the other hand, there is a definition due to Dedekind that a set is finite if and only if it cannot be put in one-to-one correspondence with a proper subset. Intuitively these two notions should be equivalent, but can we prove it? I will argue that to avoid a circular argument, one direction requires more care than one would initially think. Further, the other direction is true only by virtue of the Axiom of Choice. To outline the proof of this fact, we will examine formal notions of definiabilty and the set-theoretic technique of forcing.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/~jipsen/seminarposters/Eskew_111030.pdf Poster]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 6 at 3:00 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Fred Dashiell, [http://www.ucla.edu UCLA] and [http://mathcs.chapman.edu/CECAT/ Center of Excellence in Computation, Algebra and Topology (CECAT)]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Various descriptions of hyperstonian Boolean Algebras&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The study of von Neumann algebras in the late 1940’s led Dixmier to identify the class of compact Hausdorff spaces L which occur when C(L) is a Banach dual space.  Dixmier called these spaces “hyperstonian”, and they are totally disconnected, therefore they also represent certain Boolean algebras, which for the purposes of this talk I also call hyperstonian Boolean algebras.  These Boolean algebras are complete as lattices, and obey a further condition as to the existence of certain measures on them.  Every compact space has a unique “hyperstonian cover”, and this dualizes to the existence of a hyperstonian extension of every Boolean algebra.  This talk discusses two approaches to an algebraic description of the hyperstonian cover.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/~jipsen/seminarposters/Dashiell.pdf Poster]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 29 at 3:00 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Peter Jipsen, [http://www.chapman.edu Chapman University] and [http://mathcs.chapman.edu/CECAT/ Center of Excellence in Computation, Algebra and Topology (CECAT)]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The finite congruence lattice representation problem in universal algebra&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The central problem of this talk asks which finite lattices are congruence lattices of finite algebras. I will give all necessary background and show pictures of congruence lattices of small unary algebras. The problem is still open after 50 years, but recently, in collaboration with W. DeMeo, R. Freese, B. Lampe and J.B. Nation at the University of Hawaii, we have shown that all 7-element lattices, except possibly one of them, are congruence lattices of finite algebras. Students can make progress on this problem by searching for finite algebras with specific congruence lattices (either &amp;quot;by hand&amp;quot; or by doing some programming). I will also demonstrate Ralph Freese&#039;s Universal Algebra Calculator (uacalc.org) which makes it possible to easily calculate and display congruence lattices of small algebras.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 22 at 3:00 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor M. Andrew Moshier, [http://www.chapman.edu Chapman University] and [http://mathcs.chapman.edu/CECAT/ Center of Excellence in Computation, Algebra and Topology (CECAT)]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Point-free duality for Archimedean l-groups with strong order unit&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Classically, archimedean lattice ordered groups (l-groups) with strong order unit are representable as sub-l-groups of continuous real functions on compact regular spaces. This fact, however, hinges on understanding the real numbers non-constructively. For that matter, even the proof that archimedean l-groups are commutative is not trivial (without the aid of the representation theorem). &lt;br /&gt;
&lt;br /&gt;
We establish an analogous representation of archimedean l-groups with strong order unit in a category of continuous sequent calculus. The construction of an l-group from a sequent calculus involves simple finitary proof rules using rational numbers. In particular, the group operations are captured by constructing certain entailments capturing informally how &#039;continuous real functions&#039; are related by their behavior on rational numbers. As an illustration of the techniques, we can show that every archimedean l-group with strong order unit is commutative without recourse to non-constructive real numbers. &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/~jipsen/seminarposters/Moshier_092211.pdf Poster]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 15 at 4:00 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Yakir Aharonov, [http://www.chapman.edu Chapman University] and [http://www.chapman.edu/ACFS/Quantum/default.asp Center of Excellence in Quantum Studies]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Can the future affect the present without violating causality?&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will discuss properties of pre- and post-selected ensembles in quantum mechanics and the way to observe these properties through the use of a new type of non-disturbing measurement called &#039;weak measurement&#039;. A number of these new experiments have already been successfully performed.&lt;br /&gt;
&lt;br /&gt;
I will also discuss another type of measurement which does not disturb the observed quantum system. The main result of this new approach is the realization that the basic difference between classical and quantum mechanics is the non-local aspects of quantum dynamics.&lt;br /&gt;
&lt;br /&gt;
Theoretical analysis of the outcomes of these experiments have produced several very rich results. First, it has shed new light on the most puzzling features of quantum mechanics, such as interference, entanglement, etc. Secondly, it has uncovered a host of new quantum phenomena, which were previously hidden.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/~jipsen/seminarposters/Aharonov_090811.pdf Poster]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 8 at 4:00 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Steven Krantz, [http://wustl.edu/ Washington University in St. Louis]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039;  &#039;&#039;&#039;A Matter of Gravity&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We treat the concept of &amp;quot;center of gravity&amp;quot; from a new point of view.  We derive&lt;br /&gt;
a number of original results about the stability of the center of gravity.&lt;br /&gt;
&lt;br /&gt;
We also study asymptotic features of the center of gravity as the dimension of&lt;br /&gt;
the ambient space tends to infinity.&lt;br /&gt;
&lt;br /&gt;
These results are of interest to roboticists and to physicists who study quantum mechanics.&lt;br /&gt;
But they also have intrinsic mathematical merit.&lt;br /&gt;
&lt;br /&gt;
The talk will be accessible to anyone who has had multi-variable calculus.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/~jipsen/seminarposters/Krantz_090811.pdf Poster]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2011 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, May 24 at 4:00 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. David Carfì, Researcher and Aggregate Professor, Faculty of Economics, University of Messina, Visiting Researcher at University of California Riverside&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Dirac Calculus in distribution spaces for Quantum Mechanics and Economics&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In his famous treatise “Principles of Quantum Mechanics” (1930), the great mathematician and physicist Paul Dirac introduced several “manipulation rules” for vectors and operators of linear spaces, which together constitute the so-called “Dirac Calculus”. This Calculus is nothing more than a wide set of formal extensions of the basic properties of the finite-dimensional Linear Algebra to the case of infinite-dimensional vector spaces. The discourse is elegant and surprisingly efficient, but it is far from being a rigorous mathematical treatment. As mathematicians well know, the passage from the finite to the infinite dimensional case does not amount to a mere substitution of finite linear combinations with formal integrals!&lt;br /&gt;
 &lt;br /&gt;
The goal of the research introduced in this talk is to give a precise mathematical meaning and rigorous support to many analytic methods of Quantum Mechanics, starting from the fundamental Dirac Calculus, using the Weak Duality Theory of L. Schwartz and J. A. Dieudonné and the L. Schwartz Theory of Distributions. This approach will give a rigorous justification for the use of Dirac&#039;s tools, leaving them substantially “as they are” in Quantum Mechanics practice. Moreover, by providing a correct interpretation of these heuristic methods in terms of new solid and powerful mathematical entities and concepts, we will be helped in reaching a deeper understanding of the physical structures studied in Quantum Mechanics.&lt;br /&gt;
 &lt;br /&gt;
The new operations of continuous-superposition and that of the Dirac product allow us to build - in a mathematically rigorous way - the &amp;quot;extended Linear Algebra&amp;quot; of Dirac in the spaces of tempered distributions, via their natural topological linear structures. More precisely, we shall see that the algebraic-topological structure of tempered distribution spaces allows us to define - naturally - the linear combinations of a continuous family of vectors and operators and a scalar product (of a vector by such continuous families of vectors) which are absolutely necessary (and already formally introduced and used by Dirac himself) for the modern theoretical development of Quantum Mechanics.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday and Tuesday, April 4 and April 5, at 2:30 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Henry Stapp (Lawrence Berkeley National Laboratory)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Discussions on quantum issues and their mathematical foundations&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Discussions on quantum issues and their mathematical foundations. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 7, at 4:30 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Neil Donaldson (UCI)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Isothermic surfaces - an overview&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk we consider some of the structure of classical isothermic surfaces; those for which there exist conformal curvature line co-ordinates. We moreover consider two modern approaches/generalizations of the classical theory which place the discussion firmly in the realm of integrable systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== January 10 - January 19, 2011 in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;THIRD ANNUAL [http://mathcs.chapman.edu/CECAT CECAT] WORKSHOP IN POINTFREE TOPOLOGY &amp;amp; ANALYSIS&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
(see also the [http://mathcs.chapman.edu/CECAT/workshops.html CECAT workshops] page)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TABLE&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Monday 10th:&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;12pm-2pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Bernhard Banaschewski (McMaster University, Canada)&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;Essential completions - update&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;3pm-5pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Olaf Klinke (University of Birmingham, UK)&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;Pointfree bitopological compactification&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;amp;nbsp;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Tuesday 11th:&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;10am-12pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Bernhard Banaschewski&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;Essential completions - update&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;2pm-4pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;Open session&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;amp;nbsp;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Wednesday 12th:&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TD&amp;gt;12pm-2pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Bernhard Banaschewski&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;Essential completions - update&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;3pm-5pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Andrew Moshier (Chapman University)&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;Another Duality for Commutative C* Algebras&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;amp;nbsp;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Thursday 13th:&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;No scheduled talks&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;amp;nbsp;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Friday 14th:&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;11am-1pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Bernhard Banaschewski&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;Extended real-valued functions&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;2pm-4pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;Open session&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;5pm - 7pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;Drinks and snacks at Von Neumann Hall&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;amp;nbsp;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Saturday 15th:&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;10am&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;Coffee at Café Lucas&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;11am-1pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Bernhard Banaschewski&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;Extended real-valued functions&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;2pm-4pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Andrew Moshier&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;Integration in Logical Form&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;amp;nbsp;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Sunday 16th:&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;10am-12pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Rick Ball (University of Denver)&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;Integration ideas in a pointfree context&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;1pm-3pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;Open session&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;amp;nbsp;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Monday 17th:&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TD&amp;gt;12pm-2pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Bernhard Banaschewski&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;Extended real-valued functions&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;3pm-5pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;Open session&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;amp;nbsp;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Tuesday 18th:&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;10am-12pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Bernhard Banaschewski&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;To be announced&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;2pm-4pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TD&amp;gt;Open session&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;amp;nbsp;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Wednesday 19th:&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;12pm-2pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;STRONG&amp;gt;Bernhard Banaschewski&amp;lt;/STRONG&amp;gt;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;quot;To be announced&amp;quot;&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;TR&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;3pm-5pm&amp;lt;/TD&amp;gt;&lt;br /&gt;
&amp;lt;TD&amp;gt;Open session&amp;lt;/TD&amp;gt;&amp;lt;/TR&amp;gt;&amp;lt;/TABLE&amp;gt;&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2012&amp;diff=12</id>
		<title>MathCS Seminar 2012</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2012&amp;diff=12"/>
		<updated>2021-02-22T18:34:34Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;&amp;#039;&amp;#039;Seminar Organizers:&amp;#039;&amp;#039; Peter Jipsen and Cyril Rakovski  == Fall 2012 ==  === Thursday, November 15, 2012 at 2 pm - 5 pm in VN ===  ==== Third [http://www.chapman.edu Chapman...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&#039;&#039;Seminar Organizers:&#039;&#039; Peter Jipsen and Cyril Rakovski&lt;br /&gt;
&lt;br /&gt;
== Fall 2012 ==&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 15, 2012 at 2 pm - 5 pm in VN ===&lt;br /&gt;
&lt;br /&gt;
==== Third [http://www.chapman.edu Chapman University] and [http://www.fullerton.edu Cal State University Fullerton] Joint Mathematics Colloquium ====&lt;br /&gt;
&lt;br /&gt;
held at &#039;&#039;&#039;Chapman University, Von Neumann Hall&#039;&#039;&#039; (545 W. Palm Ave, Orange)&lt;br /&gt;
meet at 1:30 pm in Von Neumann Hall for a brief reception&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;PROGRAM&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2:00 pm Lucy Odom (CSU Fullerton)&#039;&#039;&#039; - &amp;quot;Amalgamatic Curvature and Absolute Umbilical Hypersurfaces&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2:25 pm David Tyler (Chapman University)&#039;&#039;&#039; - &amp;quot;Map the Network&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2:50 pm Charley Conley (CSU Fullerton)&#039;&#039;&#039; - &amp;quot;A Rigidity Theorem for Hypersurfaces&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3:15 pm Adrian Vajiac (Chapman University)&#039;&#039;&#039; - &amp;quot;Bicomplex Numbers&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3:40 pm Coffee Break&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4:10 pm Nicholas Salinas (CSU Fullerton)&#039;&#039;&#039; - &amp;quot;Polynomial Isometries of P-adic Integers&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;4:35 pm Peter Jipsen (Chapman University)&#039;&#039;&#039; - &amp;quot;A Category of Algebraic Contexts equivalent to Idempotent Semirings&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, October 22 -- Friday, October 26 2012 ===&lt;br /&gt;
&lt;br /&gt;
==== Workshop on Function Theories for Bicomplex and Hyperbolic Numbers ====&lt;br /&gt;
&lt;br /&gt;
Hosted by the &#039;&#039;&#039;Center of Excellence in Complex and Hypercomplex Analysis (CECHA)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;PROGRAM&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Monday October 22nd 2012&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
9:30am-10:30am &#039;&#039;&#039;Adrian Vajiac, Chapman University&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Bicomplex Analysis: an introduction”&lt;br /&gt;
&lt;br /&gt;
10:45am-11:45am &#039;&#039;&#039;Michael Shapiro, Instituto Politecnico Nacional, Mexico&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Bicomplex Derivability, Differentiability, and Holomorphy”&lt;br /&gt;
&lt;br /&gt;
2:00pm-3:00pm &#039;&#039;&#039;John Ryan, University of Arkansas&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Complex Clifford Analysis”&lt;br /&gt;
&lt;br /&gt;
3:15pm-4:15pm &#039;&#039;&#039;Craig Nolder, Florida State University&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Conformal Mappings in R1,1  are Quasi-Conformal”&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Tuesday October 23rd 2012&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
9:30am-10:30am &#039;&#039;&#039;Elena Luna Elizarraras, Instituto Politecnico Nacional, Mexico&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “On Fundamentals of Functional Analysis with Bicomplex Scalars”&lt;br /&gt;
&lt;br /&gt;
10:45am-11:45am &#039;&#039;&#039;Dominic Rochon, Université du Québec à Trois-Rivières, Canada&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Infinite Dimensional Bicomplex Hilbert Spaces“&lt;br /&gt;
&lt;br /&gt;
2:00pm-3:00pm &#039;&#039;&#039;Daniele Struppa, Chapman University&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Holomorphic functions of a bicomplex variable and Ehrenpreis’ Fundamental Principle”&lt;br /&gt;
&lt;br /&gt;
3:15pm-4:15pm &#039;&#039;&#039;Franciscus Sommen, Universiteit Gent, Belgium&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Spherical Monogenics on the Lie Sphere” &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Wednesday October 24th 2012&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
9:30am-10:30am &#039;&#039;&#039;Uwe Kahler, University of Aveiro, Portugal&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Discrete Function theories in the case of bicomplex and hyperbolic numbers“&lt;br /&gt;
&lt;br /&gt;
10:45am-11:45am &#039;&#039;&#039;Paula Cerejeiras, University of Aveiro, Portugal&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “On the Gabor Transform: the Bicomplex Case”&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Thursday October 25th 2012&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
9:30am-10:30am &#039;&#039;&#039;Daniel Alpay, Ben-Gurion University of the Negev, Israel&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Schur Analysis and Theory of Linear Systems: The Bicomplex Case“&lt;br /&gt;
&lt;br /&gt;
10:45am-11:45am &#039;&#039;&#039;Sebastien Tremblay, Université du Québec à Trois-Rivières, Canada&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Hyperbolic Pseudonanalytic Functions in Mathematical Physics“&lt;br /&gt;
&lt;br /&gt;
2:00pm-3:00pm &#039;&#039;&#039;Irene Sabadini, Politecnico di Milano, Italy&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Algebraic Analysis Methods in the Bicomplex setting “&lt;br /&gt;
&lt;br /&gt;
3:15pm-4:15pm &#039;&#039;&#039;Fabrizio Colombo, Politecnico di Milano, Italy&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Bicomplex Holomorphic Functional Calculus “&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday October 26th 2012&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
9:30am-10:30am  &#039;&#039;&#039;Matvei Libine, Indiana University&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Introduction to Split Quaternionic Analysis “&lt;br /&gt;
&lt;br /&gt;
10:45am-11:35am &#039;&#039;&#039;Mihaela Vajiac, Chapman University&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “Hyperbolic Analysis:  an introduction”&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 4, 2012 at 1:15 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;[http://www.chapman.edu/our-faculty/m-andrew-moshier Prof. Andrew Moshier], Faculty of Computer Science and Mathematics, [http://www.chapman.edu Chapman University]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Generalizing Modal Logic for Compact Hausdorff Semantics&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Normal modal logic can be regarded as a specification language for non-deterministic&lt;br /&gt;
state transition systems, modeled as compact, zero-dimensional topological spaces equipped&lt;br /&gt;
with a closed binary relation. The zero-dimensionality requirement, however, severely limits&lt;br /&gt;
potential applications. After all, this rules out such state spaces as spheres, tori and other&lt;br /&gt;
garden variety compact Hausdorff spaces.&lt;br /&gt;
&lt;br /&gt;
In this talk we consider how to generalize descriptive frames to allow for compact Hausdorff&lt;br /&gt;
state spaces, and then ask how modal logic can be adapted to this generalization. In&lt;br /&gt;
the result, we show that a Sahlqvist Theorem holds, characterizing a class of formulas that&lt;br /&gt;
determine first-order definable properties of the state transition.&lt;br /&gt;
&lt;br /&gt;
This is joint work with [http://www.doc.ic.ac.uk/~nbezhani/ Nick Bezhanishvili].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, August 28, 2012 at 4 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;[http://web.cs.du.edu/~petr/ Dr. Petr Vojtechovsky], [http://www.du.edu/nsm/departments/mathematics/ Department of Mathematics], [http://www.du.edu University of Denver]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Computational aspects of loop theory&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Loop theory is closely related to group theory, but the lack of associativity makes calculations with loops difficult. Since 2000, there has been notable progress in several areas of loop theory thanks to a variety of computational tools, including group-theoretical packages, symbolic computation systems, automated theorem provers and finite model builders. In this talk I will present four projects where these computational tools were essential, although one would probably not have guessed it from the results alone. I will not assume any prior knowledge of loop theory in the talk.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Spring 2012 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, May 10, 2012 at 4 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;[http://www.cs.le.ac.uk/people/akurz/ Dr. Alexander Kurz], [http://www.le.ac.uk/ University of Leicester], UK&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Categories definable by operations and equations&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; It is widely accepted that the category theoretic notion of a monad captures abstractly the idea of an algebraic theory. Indeed, a theorem of Linton 1969 says that the algebras for any monad can be represented by operations and equations if we are willing to generalise the notion of arity. In the talk, we are going to recall the notion of monad and the essence of Linton&#039;s argument before giving an application to coalgebras and modal logic (which is joint work with J. Rosicky).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, April 20, 2012, 2 pm CSU Fullerton ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Second [http://www.chapman.edu Chapman University] and [http://www.fullerton.edu Cal State University Fullerton] joint Mathematics Colloquium&#039;&#039;&#039; held at &#039;&#039;&#039;CSU Fullerton, McCarthy Hall 476&#039;&#039;&#039;&lt;br /&gt;
meet at 1:30 pm in McCarthy Hall 484 for a brief reception&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;PROGRAM&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2:00 pm John Simanyi (CSUF undergraduate student) - Complex Series at the Radius of Convergence&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In complex analysis, as in the real case, we can find a radius of convergence for a given series, dividing the complex plane into separate regions of certain convergence and divergence.   What happens at the border, on the circle of precisely that radius?  We consider a few examples to investigate.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2:30 pm Dr. Mark Filowitz (Associate Dean) - Welcoming Address&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;2:35 pm Alex Barrett (Chapman University, undergraduate student) - A Two-Light Version of the Classical Hundred Prisoners and a Light Bulb Problem: Optimizing Experimental Design through Simulations&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We propose five original strategies of successively increasing complexity and efficiency that address a novel version of a classical mathematical problem that, in essence, focuses on the determination of an optimal protocol for exchanging limited amounts of information among a group of subjects with various prerogatives. The inherent intricacy of the problem–solving protocols eliminates the possibility to attain an analytical solution. Therefore, we implemented a large-scale simulation study to exhaustively search through an extensive list of competing algorithms associated with the above-mentioned 5 generally defined protocols. Our results show that the consecutive improvements in the average amount of time necessary for the strategy-specific problem-solving completion over the previous simpler and less advantageously structured designs were 18, 30, 12, and 9% respectively. The optimal multi-stage information exchange strategy allows for a successful execution of the task of interest in 1722 days (4.7 years) on average with standard deviation of 385 days.  The execution of this protocol took as few as 1004 and as many as 4965 with median of 1616 days.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3:00 pm Heng Sok (Chapman University, undergraduate student) - On the Performance of Exact Testing Procedures with Respect to Comparisons of Several Multinomial Distributions in Small Samples&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; This research project focuses on the validity of the exact p-value method under the fully specified and non-specified null hypotheses with respect to comparison of multiple multinomial distributions in small samples, where classical chi-square testing procedure is inappropriate. Here by validity, we mean the type I error rates at several significance levels and the power of the test under various alternatives. The two sample comparison problem arises often in two treatment randomized trials and case-control studies where comparison of background characteristics is an important step of the study analysis. Small samples are an inherent trait of pilot studies and studies with recruitment difficulties due to rare conditions, lack of interest and consent or budget and time restrictions. Further, this analysis could be extended to encompass the comparison of more than two multinomial distributions that would be applicable to multiple treatment randomized trials and as done in the classical large sample theory. Our results show that under the non-specified null hypothesis, the exact p-value method is severely conservative due to the absence of adjustment structure in these tests due the estimation of the common parameters and predictably, as the number of sample increases, the type 1 error rate increases but still remains below its nominal level. Consequently, the power of the test is low when the underlying multinomial probability distributions are relatively close to each other and the number of categories is large compared to the sample size.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;3:30 pm Nicholas Blackford, Daniel Lenders, and Danny Orton - An Inverse-Based Analogue of the Probability that Two Elements of a Finite Group Commute&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Given a finite group G, the probability that two randomly chosen elements of G commute has long been viewed in the literature as a natural measure of the degree of commutativity enjoyed by the group. Many variants on this probabilistic question have arisen in the literature recently, and our research introduces yet another such variation that provides somewhat different information. In particular, given a product of elements of G, we investigate the likelihood of being able to permute the order of the elements in the product and obtain the inverse of the original element. With the help of the software program Groups, Algorithms and Programming (GAP) , we have discovered patterns leading to interesting results about this variant. In our paper, we will examine these patterns for such familiar finite groups as cyclic, dihedral, and symmetric groups, and describe the general results we have obtained. Some of these results are at odds with analogous ones known for the commutativity measure studied in recent articles, thereby adding further interest into our investigation.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, April 20, 2012, 1:30 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Lucas Layton&#039;&#039;&#039;, &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Where the rubber meets the road: How software engineering research can benefit computational science&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Computational science and software engineering are rarely spoken in the same breath. Heavyweight software development processes are not suited to the dynamic nature of scientific exploration. In this talk, I will present how research on modern software engineering tools, developer practices, and software measurement can be applied to the computational sciences to increase productivity and enable lightweight management of development efforts. I will also discuss the unique research opportunities the Chapman environment can provide to students in software engineering, and how Chapman provides a unique setting studying the important yet neglected intersection of computational science and software engineering.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, April 17, 2012 at 4pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Erik Linstead, School of Computational Sciences, Schmid College of Science, Chapman University&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Latent Topic Models for Automated Program Comprehension&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Software development is a complex and multi-faceted process. In recent years, the open-source movement has made available for the first time an abundance of dynamic software trajectories via the public archiving of software releases. This has fueled new directions of research aimed at visualizing and better understanding software and the people who create it.  &lt;br /&gt;
&lt;br /&gt;
Automated topic modeling has been successfully used in text mining and&lt;br /&gt;
information retrieval where it has been applied to the problem of summarizing large text corpora. Recent techniques include Latent Dirichlet Allocation (LDA), which probabilistically models text documents as mixtures of latent topics, where topics correspond to key concepts presented in the corpus. These more recent approaches have been found to produce better results than traditional methods such as latent semantic analysis.  Yet despite the capabilities of statistical topic models, applications have typically been limited to traditional text corpora such as academic publications, news reports, and historical documents.  At the most basic level, however, a code repository can be viewed as a text corpus, where source files are analogous to documents and tokens to words.  Though vocabulary, syntax, and conventions differentiate a programming language from a natural language, the tokens present in a source file are still indicative of its concerns (ie. its topics).&lt;br /&gt;
 &lt;br /&gt;
In this talk we adapt and apply latent topic models to automated program understanding, bug triage, software evolution, and static analysis of software complexity.  In particular we provide, for the first time, a formal definition of software scattering and tangling on which to base new software quality metrics.  The result of this work is an unsupervised, probabilistic, machine learning framework capable of supporting software analysis on an Internet-scale.  Empirical results are presented for several well-known and widely studied open-source software projects, and future research directions in the area of search-driven software development are discussed.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 12, 2012 at 4pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Greg Fasshauer&#039;&#039;&#039;, &#039;&#039;&#039;Department of Applied Mathematics, [http://www.iit.edu/ Illinois Institute of Technology], Chicago, IL&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Computing with Positive Definite Kernels&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; &lt;br /&gt;
Positive definite kernels and their associated reproducing kernel Hilbert spaces&lt;br /&gt;
provide a very flexible and powerful tool for the solution of many typical problems of&lt;br /&gt;
numerical analysis and scientific computing such as function approximation, numerical&lt;br /&gt;
integration or the numerical solution of PDEs. I will provide an introduction to positive&lt;br /&gt;
definite reproducing kernels, mention some applications, and end with a discussion of&lt;br /&gt;
some future research directions. This talk should be accessible to upper-level &lt;br /&gt;
undergraduate students and beginning graduate students.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, April 10, 2012 at 4pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Boyana Norris, [http://www.mcs.anl.gov/index.php Mathematics and Computer Science Division], [http://www.anl.gov/ Argonne National Laboratory], Chicago, IL&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Automatic Differentiation in Computational Science&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;&lt;br /&gt;
Derivatives play an important role in a wide variety of scientific computing applications, including numerical optimization, solution of nonlinear equations, sensitivity analysis, and nonlinear inverse problems. Automatic differentiation (AD) enables the accurate computation of derivatives via semantic transformation of source code via the application of the rules of differential calculus. By using AD, accurate derivatives can be obtained at a small multiple of the cost of computing the original function, which makes AD more efficient than manual parameter perturbation and finite-difference-based calibration. AD has been widely used in applications in the physical, chemical, biological, and social sciences. &lt;br /&gt;
&lt;br /&gt;
In this talk, I will introduce AD and describe our approach to enabling efficient automatic differentiation of computational science applications. Our source-transformation AD tools are implemented by using a component-based software engineering approach, enabling reuse of complex capabilities, such as program analysis and the differentiation transformations, while providing separate parsing and code generation components for C, C++, and Fortran. The differentiation process consists of the following steps implemented as loosely coupled components: parsing of the arbitrarily large application source code; performing a number of program analyses; creating a standard, XML-based language-independent intermediate representation of the computational graph; augmenting the computational graph with derivative computations; converting the resulting graph back into the source language&#039;s intermediate representation; and finally, producing source code for computing the original function and its derivatives. In addition to existing capabilities, I will discuss a number of open research issues, ranging from mathematical considerations to software engineering challenges in enabling robust and efficient AD in an environment of ever-increasing software and hardware complexity.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 22, 2012 at 4pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Mihaela Vajiac, Faculty of Mathematics, [http://www.chapman.edu Chapman University]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Examples of Functional Calculus&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk, I will present examples of Functional Calculus, a subject introduced recently by F. Colombo, I. Sabadini, and D. Struppa,  for commuting and non-commuting operators, using different classes of functions.  The theory is quite new and lacks examples, a gap which this work is attempting to fill.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, March 20, 2012 at 4pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Eddy Sfeir, [http://www.db.com/usa/ Deutsche Bank], and [http://www.chapman.edu Chapman University] Alumnus&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Trading Foreign Exchange Options&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Out of all markets, the currency market is the biggest out there with over 3 Trillion USD exchanging hands every day. From the basic Black-Scholes formula to slightly more advanced concepts such as delta and gamma hedging, the purpose of this talk is to show you what a day in the life of a currency options trader consists of.&lt;br /&gt;
&lt;br /&gt;
Eddy Sfeir has been trading options for Deutsche Bank for nearly 4 years. He started out on Wall St, and is now trading in London. Deutsche Bank has been number 1 in FX for 7 years in a row (in terms of market share, customer surveys etc.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 15, 2012 at 4pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Atanas Radenski, School of Computational Sciences, Schmid College of Science, [http://www.chapman.edu Chapman University]&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Distributed Simulated Annealing with MapReduce on the Cloud&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Simulated annealing’s high computational intensity has stimulated researchers to experiment with various annealing algorithms for shared memory, message-passing, and hybrid-parallel platforms. MapReduce is an emerging distributed computing framework for large-scale data processing on clusters of commodity servers; to our knowledge, MapReduce has not been used for simulated annealing yet. In this talk, we investigate the applicability of MapReduce to distributed simulated annealing in general, and to the TSP in particular. We (i) outline six algorithmic patterns of distributed simulated annealing with MapReduce, (ii) discuss the instantiation of such patterns into MR implementations to solve sample TSP problems, and (iii) evaluate solution quality and speedup of the implementations on a cloud computing platform, Amazon’s Elastic MapReduce. The talk can be beneficial for those interested in the potential of cloud-based MapReduce in computationally intensive methods in general and nature-inspired algorithms in particular.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/~jipsen/seminarposters/Radenski_20120315.pdf Poster]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 23, 2012 at 12 noon in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Roman Buniy, Faculty of Physics, [http://www.chapman.edu Chapman University]&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;New measures for entangled states&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We propose new measures that distinguish and classify entangled states. The measures are algebraic invariants of linear maps associated with the states. Considering qubits as well as higher spin systems, we obtained complete entanglement classifications for cases that were either unsolved or only conjectured in the literature.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/~jipsen/seminarposters/Buniy_20120223.pdf Poster]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, February 1, 2012 at 4:00 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Aleš Pultr, [http://www.cuni.cz/UKENG-1.html Charles University], Prague, Czech Republic&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Algebraic and Topological Aspects of the Coproduct of Frames&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The algebraic aspects concern the coproduct as the tensor product in a broader category.&lt;br /&gt;
This is the same phenomenon as the coproduct of commutative rings being&lt;br /&gt;
carried by the tensor product of the underlying abelian groups, and we will&lt;br /&gt;
consider how it is in a general setting.&lt;br /&gt;
&lt;br /&gt;
The topological aspects are related to confronting the coproduct $\Omega(X)\otimes\Omega(Y)$ with&lt;br /&gt;
the product $X\times Y$.&lt;br /&gt;
&lt;br /&gt;
The consequences of the discrepancy are generally pleasant, as can be seen in the behaviour of paracompact&lt;br /&gt;
frames, the closed subgroup theorem, and a pleasant situation in confronting cover and entourage uniformity.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== January 9 - January 19, 2012 in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;FOURTH ANNUAL CECAT WORKSHOP IN POINTFREE TOPOLOGY &amp;amp; ANALYSIS&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;table&amp;gt;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&#039;&#039;&#039;Monday 9th:&#039;&#039;&#039;&amp;lt;td&amp;gt;12pm-2pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Bernhard Banaschewski (McMaster University, Canada)&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;Pseudocompactness in Frames&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;2.30pm-3.30pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Drew Moshier (Chapman University)&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;D-frames&amp;quot;&lt;br /&gt;
		&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&#039;&#039;&#039;Tuesday 10th:&#039;&#039;&#039;&amp;lt;td&amp;gt;10am-12pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Drew Moshier&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;D-frames&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;12.30pm-2.30pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;Pseudocompactness in Frames&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&#039;&#039;&#039;Wednesday 11th:&#039;&#039;&#039;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;No scheduled talks&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&#039;&#039;&#039;Thursday 12th:&#039;&#039;&#039;&amp;lt;td&amp;gt;11am-1pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Drew Moshier&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;D-frames&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;1.30pm-3.30pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&#039;&#039;&#039;Friday 13th:&#039;&#039;&#039;&amp;lt;td&amp;gt;10.30am-noon&amp;lt;td&amp;gt;&#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;The rings of continuous functions on sigma frames&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;12.30pm-2pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Drew Moshier&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;A relational category of formal contexts&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&#039;&#039;&#039;Saturday 14th:&#039;&#039;&#039;&amp;lt;td&amp;gt;10.30am-noon&amp;lt;td&amp;gt;&#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;The rings of continuous functions on sigma frames&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;12.30-2pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Rick Ball (University of Denver, joint work with Tony Hager)&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;Truncated and diminished l-groups&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;2.30pm-4pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Garth Dales (University of Lancaster, UK)&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;The hyper-Stonean cover of a compact space&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&#039;&#039;&#039;Sunday 15th:&#039;&#039;&#039;&amp;lt;td&amp;gt;10.30am-noon&amp;lt;td&amp;gt;&#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;The rings of continuous functions on sigma frames&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;12.30-2pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Rick Ball (joint work with Tony Hager)&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;Truncated and diminished l-groups&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;4pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Cello Concert followed by informal reception&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&#039;&#039;&#039;Monday 16th:&#039;&#039;&#039;&amp;lt;td&amp;gt;10am&amp;lt;td&amp;gt;Coffee at Café Lucas&amp;lt;td&amp;gt;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;11am-1pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Rick Ball (joint work with Tony Hager)&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;Truncated and diminished l-groups&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;1.30pm-3pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Peter Jipsen (Chapman University)&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;On the duality between lattices and topological contexts&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&#039;&#039;&#039;Tuesday 17th:&#039;&#039;&#039;&amp;lt;td&amp;gt;10am-12pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;TBD&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;12:30pm-2pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Peter Jipsen&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;On the duality between lattices and topological contexts&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&#039;&#039;&#039;Wednesday 18th:&#039;&#039;&#039;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;No scheduled talks&lt;br /&gt;
&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&#039;&#039;&#039;Thursday 19th:&#039;&#039;&#039;&amp;lt;td&amp;gt;11am-2.30pm&amp;lt;td&amp;gt;&#039;&#039;&#039;Open session&#039;&#039;&#039;&lt;br /&gt;
&amp;lt;tr&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;lt;td&amp;gt;&amp;quot;D-frames&amp;quot;&lt;br /&gt;
&amp;lt;/table&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2013&amp;diff=11</id>
		<title>MathCS Seminar 2013</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2013&amp;diff=11"/>
		<updated>2021-02-22T18:33:59Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot; == Fall 2013 ==  === Thursday, Nov 21, 2013 from 2 pm to 4 pm in VN 116 ===  ==== Fifth [http://www.fullerton.edu Cal State University Fullerton] and [http://www.chapman.edu...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
== Fall 2013 ==&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Nov 21, 2013 from 2 pm to 4 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
==== Fifth [http://www.fullerton.edu Cal State University Fullerton] and [http://www.chapman.edu Chapman University] Joint Mathematics Colloquium ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Organizers:&#039;&#039; &#039;&#039;&#039;Bogdan Suceavă&#039;&#039;&#039; (CSUF) and &#039;&#039;&#039;Peter Jipsen&#039;&#039;&#039; (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Program&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
2:00 - 2:20 &#039;&#039;&#039;Fernando Quintino&#039;&#039;&#039; (Cal State Fullerton)&amp;lt;br&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;Interpolating Legendre Multiplier Sequences&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
2:20 - 2:40 &#039;&#039;&#039;Allie Smith and Louis Ehwerhemuepha&#039;&#039;&#039; (Chapman University)&amp;lt;br&amp;gt; &lt;br /&gt;
&#039;&#039;&#039;A Novel Exact Test for Association for Small Sample Case-Control Studies&lt;br /&gt;
&lt;br /&gt;
2:40 - 3:00 &#039;&#039;&#039;Nathan Robertson, Susan Deeb, Soeun Park, and Reina Galvez&#039;&#039;&#039; (Cal State Fullerton)&amp;lt;br&amp;gt; &lt;br /&gt;
&#039;&#039;&#039;A Comparative Analysis of Three Clustering Techniques  with an Application to K6-11 Mathematics Achievement Data&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
3:00 - 3:20 &#039;&#039;&#039;Kevin Gomez&#039;&#039;&#039; (Cal State Fullerton)&amp;lt;br&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;A Ladder of Curvatures for Hypersurfaces in the Euclidean Ambient Space&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
3:20 - 3:40 &#039;&#039;&#039;Melissa Riddle&#039;&#039;&#039; (Cal State Fullerton)&amp;lt;br&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;A Pinching Theorem for Three-Dimensional Hypersurfaces in Euclidean Ambient Space&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
3:40 - 4:00 &#039;&#039;&#039;Kyle Lee&#039;&#039;&#039; (Chapman University)&amp;lt;br&amp;gt;&lt;br /&gt;
&#039;&#039;&#039;Investigating Quantum Gravity through Causal Dynamical Triangulations&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[http://mathcs.chapman.edu/~jipsen/seminarposters/Joint_Colloquium_Chapman_CSUF5.pdf PDF file with abstracts]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&#039;&#039;&#039;Other seminar talks and events (subject to change):&#039;&#039;&#039;--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Nov 13, 2013 at 12 noon in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Daniele Struppa, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Propagation of superoscillations as solutions to the Cauchy problem for generalized Schrodinger equations&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Superoscillatory sequences have been introduced by Yakir Aharonov (and discussed in a series of seminars last year) as a byproduct of his theory of weak measurement. In this talk I will show that if we consider the Schrodinger equation (and some natural generalizations of it) , with superoscillatory initial conditions, the solution of the equation maintains superoscillatory behavior. The fundamental instruments necessary to prove such a result are the Fourier transform, and some results in the theory of convolution operators on spaces of rapidly growing entire functions (Berenstein and Struppa, Publ. RIMS Kyoto, 1988). The results that I will describe are the subject of three recent papers (coauthored with Aharonov, Colombo, Sabadini, and Tollaksen), the first of which has appeared in Journ. Math. Pures et Appliques, 2013.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Oct 23, 2013 at 12 noon in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Atanas Radenski&#039;&#039;&#039;, &#039;&#039;&#039;Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;MapReduce Streaming Algorithms for Laplace Relaxation on the Cloud&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will begin this presentation with a gentle introduction to MapReduce parallelism. No preliminary knowledge of MapReduce is expected (but this presentation will be an opportunity to gain some MapReduce understanding). Technically, I will describe relaxation algorithms for the Laplace equation in MR streaming, and evaluate empirically their performance on Elastic MR, the Amazon MR cloud. These results can be beneficial to others who would like to develop and optimize MR streaming algorithms for grid-based models, such as PDE and cellular automata.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Sept 18, 2013 at 12 noon in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Tadeusz Litak&#039;&#039;&#039;, &#039;&#039;&#039;Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Friends, Likes and Coalitions: Coalgebraic Predicate Logic in Action&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The talk is about a joint work with Dirk Pattinson, Katsuhiko Sano and Lutz Schröder.&lt;br /&gt;
It is about a generalization of first-order logic: a natural and generic language for non-relational structures which can be recast as Set-coalgebras.&lt;br /&gt;
However, I will assume no familiarity with coalgebras and coalgebraic logic. It is enough to know  that the framework&lt;br /&gt;
can cover such diverse structures as Kripke frames, neighbourhood frames, topological spaces, discrete Markov chains,&lt;br /&gt;
conditional frames, multigraphs or game frames for coaliton logic/alternating time logics. As a taster, we will develop&lt;br /&gt;
an apparatus to reason about activities and preferences in social networks. Then we will shortly discuss issues likes&lt;br /&gt;
completeness, model theory and proof theory.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2013 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, April 26, 2013 at 2 pm - 5 pm Cal State Fullerton ===&lt;br /&gt;
&lt;br /&gt;
==== Fourth [http://www.fullerton.edu Cal State University Fullerton] and [http://www.chapman.edu Chapman University] Joint Mathematics Colloquium ====&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Program&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Casey Coleman and Adrian Vajiac&#039;&#039;&#039; (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A New Perspective on Geometry: Polynomials and Curved Spaces&#039;&#039;&#039; (Research Adviser: Dr. Adrian Vajiac)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Robert Giza&#039;&#039;&#039; (Cal Poly Pomona)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Series associated with multifractal analysis&#039;&#039;&#039; (Research adviser: Dr. John Rock)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Duy D Ngo, Reina R Galvez, and Antouneo Kassab&#039;&#039;&#039; (Cal State Fullerton)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A Multivariate Statistical Inference for the Analysis of Neuronal Spiking Rates&#039;&#039;&#039; (Research adviser: Dr. Sam Behseta)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Nathan Lawless&#039;&#039;&#039; (Chapman University)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Generating all modular lattices of a given size&#039;&#039;&#039; (Research adviser: Dr. Peter Jipsen)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Yusuf Jabri&#039;&#039;&#039; (Cal Poly Pomona)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Genesis of the ubiquitous Fibonacci Word&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Jenny Chang&#039;&#039;&#039; (Cal State Fullerton)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Robust Statistical Modeling of Neuronal Intensity Rates&#039;&#039;&#039; (Research adviser: Dr. Sam Behseta)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Cody Gruebele&#039;&#039;&#039; (Cal State Fullerton)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Comparison of Two Models For Fat/Water Separation in Magnetic Resonance Imaging (MRI)&#039;&#039;&#039; (Research adviser: Dr. Angel Pineda)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[http://mathcs.chapman.edu/~jipsen/seminarposters/Joint_Colloquium_Chapman_CSUF.pdf PDF file with abstracts]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, April 24, 2013 at 2:30 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Cynthia Northrup&#039;&#039;&#039;, &#039;&#039;&#039;University of California, Irvine&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Using Forcing to Obtain a Model of the Continuum Hypothesis&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Forcing is a method used to extend a transitive model M by adjoining a new set G in&lt;br /&gt;
order to obtain a larger transitive model M[G]. Our choice of partial order, or notion of&lt;br /&gt;
forcing, determines what is true in M[G]. We will consider the forcing introduced by Paul&lt;br /&gt;
Cohen in proving the independence of the Continuum Hypothesis. The Diamond Principle,&lt;br /&gt;
introduced by Jensen in 1972, can be thought of as a strengthening of the Continuum&lt;br /&gt;
Hypothesis. From a diamond sequence of length k we can read off all of the subsets of k.&lt;br /&gt;
We are interested in using an iteration involving Radin forcing in order to obtain a model&lt;br /&gt;
of the failure of Diamond.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, April 23, 2013 at 1:15 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Papiya Bhattacharjee&#039;&#039;&#039;, &#039;&#039;&#039;Penn State Erie, The Behrend College&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Extensions in Algebraic Frames&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; A frame L is algebraic if every element of L is expressed as a supremum of compact elements. In case of algebraic frames L that also satisfy the Finite Intersection Property, we investigate the spaces of minimal prime elements of L, called Min(L), with respect to the Zariski topology and the Inverse topology. The first part of the talk will describe these spaces. Finally, given two algebraic frames L and M (L is a subframe of M), the speaker will describe various extensions such as Rigid extension, r-extension, etc. and their relationship with the spaces of Min(L). In particular, it turns out that if M is a rigid frame extension of L, then Min(L) is homeomorphic to Min(M) with respect to both the Zariski topology and the inverse topology.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, April 17, 2013 at 2:30 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Andres Forero Cuervo&#039;&#039;&#039;, &#039;&#039;&#039;University of California, Irvine&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Sets With No Length, Alternative Axioms and Infinite Games&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The length of a subset of the real line can be defined in mathematical terms. A set of real numbers is called &amp;quot;measurable&amp;quot; if a precise, definite length can be assigned to it, following certain desired natural properties. Surprisingly, from the axioms of Set Theory we can show the existence of sets that are not measurable, somewhat violating our physical intuition of the notion of length in space. A natural logical question&lt;br /&gt;
arises: can some axioms of Set Theory be replaced by different axioms that not only prohibit the existence of the pathological sets just mentioned, but guarantee that every set is measurable? In this talk we will explore this possibility, and in this process we will explain the connection between infinite-length games, sets of real numbers and infinite trees.&lt;br /&gt;
This talk is mostly self contained. Only some basic knowledge of Real Analysis will be assumed.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, April 12, 2013 at 2:30 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Ryan Lowenstein&#039;&#039;&#039;, &#039;&#039;&#039;Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;TuringPoint LearningJoint: A Technology Info Session &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Teaching undergraduates can often be a challenging process, especially if the course is not found to be very interesting by many students (as may be the case with some introductory mathematics courses).  Hence, many of us would like to add something to the classroom that could help us improve the engagement of our students (and make math fun again).  TurningPoint, a form of clicker technology, does exactly that.  This presentation focuses on its effectiveness and will also show you how to get started on your new TurningPoint classroom improvement project.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, April 3, 2013 at 2:30 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mustafa Said&#039;&#039;&#039;, &#039;&#039;&#039;University of California, Irvine&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Almost Commuting Matrices&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We investigate a variant of an old problem in linear algebra and operator theory&lt;br /&gt;
that was popularized by Paul Halmos: Must almost commuting matrices be nearly commuting? &lt;br /&gt;
To be more precise, we say that a pair of n-by-n complex valued matrices (A, B)&lt;br /&gt;
are “almost commuting” if AB − BA is small in some sense. In the same manner, we say&lt;br /&gt;
that a pair of n-by-n complex valued matrices (X, Y) are “nearly commuting” if X − A&lt;br /&gt;
and Y − B are small in some sense and AB = BA. Although we will be exploring deep&lt;br /&gt;
ideas in operator theory, only a basic understanding of undergraduate linear algebra and&lt;br /&gt;
real analysis will be assumed. We will briefly discuss history of the problem, discuss the&lt;br /&gt;
progress on the problem, and sketch the proof of a quantitative result which establishes that&lt;br /&gt;
“almost commuting” matrices are “nearly commuting” for different types of matrices.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, January 16 -- Wednesday, January 23 2013 ===&lt;br /&gt;
&lt;br /&gt;
==== 5th Annual CECAT Workshop in Pointfree Mathematics ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Hosted by the Center of Excellence in Computation, Algebra and Topology (CECAT)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Held at Chapman University, Von Neumann Hall (545 W. Palm Ave, Orange, CA 92866)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Program&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Wednesday 16th&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
noon-2pm: &#039;&#039;&#039;Open session&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Thursday 17th&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
12.30pm-2pm: &#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &amp;quot;Regular rings and the PIT&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday 18th&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
noon-1.30pm: &#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &amp;quot;On the minimal spectrum of a compact normal frame&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Monday 21st&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
noon-1.30pm: &#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &amp;quot;An example of a pointless countably compact completely regular frame&lt;br /&gt;
&lt;br /&gt;
2pm-3.30pm: &#039;&#039;&#039;Peter Jipsen&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &amp;quot;Implementing decision procedures for (generalized) Basic Logic&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Tuesday 22nd&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
11am-12.30pm: &#039;&#039;&#039;Ales Pultr&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &amp;quot;Techniques on taking quotients in frames, lattices, quantales etc &amp;quot;&lt;br /&gt;
&lt;br /&gt;
1pm-2pm &#039;&#039;&#039;Joanne Walters-Wayland&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &amp;quot;Some comments on Coz and quotients&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Wednesday 23rd&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
noon-1.30pm: &#039;&#039;&#039;Ales Pultr&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &amp;quot;Techniques on taking quotients in frames, lattices, quantales etc &amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Thursday 24th&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
11am-12.30pm: &#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &amp;quot;Aspects of Strong 0-dimensionality&amp;quot;&lt;br /&gt;
&lt;br /&gt;
1pm-2.30pm: Drew Moshier&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &amp;quot;An overview of Co-algebras on Compact Regular Spaces&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday 25th&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
noon-1.30pm: &#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &amp;quot;Aspects of Strong 0-dimensionality&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Saturday 26th&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
7pm: &#039;&#039;&#039;Cello Concert&#039;&#039;&#039; in Von Neumann Hall&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;[http://mathcs.chapman.edu/CECAT/workshops/CECATworkshop2013schedule.pdf PDF file of the program]&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, January 16, 2013 at 4:30 pm in VN ===&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;[http://www.dmu.ac.uk/about-dmu/academic-staff/technology/engineering/scott-linfoot.aspx Dr. Scott Linfoot] of the IEEE and De Montfort University&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Metadata: Making Molehills out of Mountains&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; This presentation will examine the two prominent media sectors, professional&lt;br /&gt;
and consumer, and show that in the near future, the amount of content created&lt;br /&gt;
from the consumer space will exceed that created in the professional space.&lt;br /&gt;
As a result, there is a vast amount of uncollated and disorganized media moving&lt;br /&gt;
around the internet unchecked.&lt;br /&gt;
&lt;br /&gt;
There is a huge drive at the moment to try to establish some order to what&lt;br /&gt;
appears to be a chaotic system. The problem is that using current methods, this&lt;br /&gt;
is an extremely time consuming and expensive process. As a result, automatic&lt;br /&gt;
metadata generation methods are needed to improve the process&lt;br /&gt;
while providing a business case for exploitation.&lt;br /&gt;
&lt;br /&gt;
This presentation will explore the metadata problem, looking&lt;br /&gt;
from the consumer and professional vantage points, and try to&lt;br /&gt;
open discussion on how this escalating problem might be averted.&lt;br /&gt;
&lt;br /&gt;
[http://mathcs.chapman.edu/~jipsen/seminarposters/ScottLinfoot.pdf Poster]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2014&amp;diff=10</id>
		<title>MathCS Seminar 2014</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2014&amp;diff=10"/>
		<updated>2021-02-22T18:33:09Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;== Fall 2014 ==   === Thursday, December 18th, 2014 at 4pm (tea and cookies at 3:30pm) ===  ==== &amp;#039;&amp;#039;Speaker:&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;Lander Cnudde, University of Ghent, Belgium&amp;#039;&amp;#039;&amp;#039; ====  &amp;#039;&amp;#039;Title:&amp;#039;...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;== Fall 2014 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 18th, 2014 at 4pm (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Lander Cnudde, University of Ghent, Belgium&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Fourier transforms in commutative and non-commutative multicomplex settings&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; This seminar addresses the generalization of the&lt;br /&gt;
classical Fourier transform to multicomplex settings. Inspired by a&lt;br /&gt;
successful case study on the slices of the non-commutative Clifford&lt;br /&gt;
algebra $Cl_{m+1}$, a more conceptual approach to the matter is&lt;br /&gt;
established. Using operator relations, we construct a general&lt;br /&gt;
background that allows to create Fourier analogues in more general&lt;br /&gt;
non-commutative as well as commutative settings. Finally we illustrate&lt;br /&gt;
this claim and the underlying line of thoughts by setting up a Fourier&lt;br /&gt;
transform for the bicomplex numbers which turns out to be in&lt;br /&gt;
accordance to our expectations. The framework uses concepts of both&lt;br /&gt;
analysis and algebra, with key roles for the Mehler formula and the&lt;br /&gt;
Hille-Hardy formula.&lt;br /&gt;
&lt;br /&gt;
=== Wednesday December 10th 2014 at 4PM (tea and cookies at 3.30PM) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Luke Smith, Graduate Student, Department of Mathematics, University of California, Irvine&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Polytope Bounds on Multivariate Value Sets&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Over finite fields, if the image of a polynomial map is&lt;br /&gt;
not the entire field, then its cardinality can be bounded above by a&lt;br /&gt;
significantly smaller value. Earlier results bound the cardinality of&lt;br /&gt;
the value set using the degree of the polynomial. However, these&lt;br /&gt;
bounds can be improved significantly if our bounds depend on the&lt;br /&gt;
powers of all monomials in a polynomial map, rather than just the one&lt;br /&gt;
with the highest degree. The Newton polytope of a polynomial map is&lt;br /&gt;
one such object constructed by each of these monomials, and its&lt;br /&gt;
geometry provides sharp upper bounds on the cardinality of the value&lt;br /&gt;
set. In this talk, we will explore the geometric properties of the&lt;br /&gt;
Newton polytope and show how allows for an improvement on the upper&lt;br /&gt;
bounds of the multivariate value set.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Bio:&#039;&#039; Luke Smith is a 6th year PhD student at UCI. His research&lt;br /&gt;
interests involves number theory, finite fields, value sets, and Witt&lt;br /&gt;
vectors. He also enjoys teaching and has recently been involved in&lt;br /&gt;
mathematics educational outreach with the UCI Math circle and MIND&lt;br /&gt;
Research Institute.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday October 24th 2014 at 12.30 (tea and cookies at noon) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Brendan Fahy, Postdoctoral Fellow, KEK High Energy Research Organization, Tsukuba, JapanTBA&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Linear combination interpolation, Cuntz relations and infinite products (joint work with I. Lewkowicz, P. Jorgensen and D. Volok)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Calculating observable quantities in QCD at low energies&lt;br /&gt;
requires a non-perturbative approach. Lattice QCD is a&lt;br /&gt;
non-perturbative solution which quantities can be estimates using&lt;br /&gt;
Monte Carlo methods. However many quantities such as multi-hadron&lt;br /&gt;
operators require large amounts of computational power to&lt;br /&gt;
compute. Using the stochastic LapH method the costly matrix inverses&lt;br /&gt;
required are estimated rather than computed exactly drastically&lt;br /&gt;
reducing the computational costs. These modern computation techniques&lt;br /&gt;
allow for the computation of a large number of operators including&lt;br /&gt;
multi-hadron operators. Results of the spectrum of energies for the&lt;br /&gt;
lowest 50 bound states in a finite box are presented for the rho-meson&lt;br /&gt;
channel.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday October 21st 2014 at 4pm (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Daniel Alpay, Ben-Gurion University of the Negev, Israel&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Linear combination interpolation, Cuntz relations and infinite products (joint work with I. Lewkowicz, P. Jorgensen and D. Volok)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We introduce the following linear combination&lt;br /&gt;
interpolation problem: Given $N$ distinct numbers $w_1,..., w_N$ and $N+1$&lt;br /&gt;
complex numbers $a_1,..., a_N $and $c$, find all functions f(z) analytic&lt;br /&gt;
in a simply connected set (depending on f) containing the points&lt;br /&gt;
$w_1,...,w_N$ such that $\sum_{u=1}^N a_u f(w_u)=c$. To this end we prove&lt;br /&gt;
a representation theorem for such functions f in terms of an&lt;br /&gt;
associated polynomial p(z). We first introduce the following two&lt;br /&gt;
operations, substitution of p, and multiplication by monomials $z^j$ ,&lt;br /&gt;
$0&amp;lt;= j &amp;lt; N$. Then let M be the module generated by these two operations,&lt;br /&gt;
acting on functions analytic near 0. We prove that every function f,&lt;br /&gt;
analytic in a neighborhood of the roots of p , is in M. In fact, this&lt;br /&gt;
representation of f is unique. To solve the above interpolation&lt;br /&gt;
problem, we employ an adapted systems theoretic realization, as well&lt;br /&gt;
as an associated representation of the Cuntz relations (from&lt;br /&gt;
multi-variable operator theory.) We study these operations in&lt;br /&gt;
reproducing kernel Hilbert space): We give necessary and sufficient&lt;br /&gt;
condition for existence of realizations of these representation of the&lt;br /&gt;
Cuntz relations by operators in certain reproducing kernel Hilbert&lt;br /&gt;
spaces, and offer infinite product factorizations of the corresponding&lt;br /&gt;
kernels.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== CECHA Workshop on Integral transforms, boundary values and generalized functions,  Fall 2014 ===&lt;br /&gt;
Schedule: October 17th - October 21st 2014&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
==== Friday October 17th 2014 ==== &lt;br /&gt;
Chairperson: Irene Sabadini&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 10:50am-11:05am Registration/ Welcome &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 11:05am-11:55am Michael Shapiro, Instituto Politecnico Nacional, Mexico &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Title: “On the Hilbert and Schwarz Formulas and Operators”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 11:55am-12:10pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 12:20pm-1:30pm Lunch, Athenaeum &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 2:00pm-2:50pm Mircea Martin, Baker University &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “Spin Operator Theory”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 2:50pm-3:10pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 3:10pm-4:00pm M. Elena Luna Elizarraras, Instituto Politecnico Nacional, Mexico &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “A Bicomplex Model of Lobachevsky Geometry”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 4:00pm-4:20pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
==== Saturday October 18th 2014 ====&lt;br /&gt;
&lt;br /&gt;
Chairperson: Paula Cerejeiras&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 10:00am-10:50am Matvei Libine, Indiana University Bloomington &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: &amp;quot;Geometric Properties of Conformal Transformations on $R^{p,q}$&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 10:50am-11:05am Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 11:05am-11:55am Ahmed Sebbar, Institut de Mathématiques de Bordeaux &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “Motions of Critical points of Green&#039;s functions”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 11:55pm-12:00pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 12:00pm-1:15pm Lunch, Sandhu &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 1:30pm-2:20pm Fabrizio Colombo, Politecnico di Milano, Italy &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “The Fueter-Sce Mapping and its Inverse”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 2:20pm-2:30pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 2:30pm-3:20pm Adrian Vajiac, Chapman University &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “Multicomplex Hyperfunctions”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 3:20pm-3:30pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
==== Sunday October 19th 2014 ====&lt;br /&gt;
&lt;br /&gt;
Chairperson: Mihaela Vajiac&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 10:00am-10:50am Irene Sabadini, Politecnico di Milano, Italy &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “Monogenic Hyperfunctions in One and Several Variables”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 10:50am-11:05am Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 11:05am-11:55am Uwe Kӓhler, University of Aveiro &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “Crystallographic structures: how to make an effective reconstruction by the spherical X-ray &lt;br /&gt;
transform?”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 11:55pm-12:00pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 12:00pm-1:15pm Lunch, Sandhu &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 1:30pm-2:20pm Paula Cerejeiras, University of Aveiro &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “Diffusive Wavelets for Nilpotent Groups”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 2:20pm-2:30pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 2:30pm-3:20pm Daniel Alpay, Ben-Gurion University of the Negev, Israel &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “Spaces of stochastic (commutative and non commutative) distributions and applications”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 3:20pm-3:30pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
==== Monday October 20th 2014 ====&lt;br /&gt;
&lt;br /&gt;
Chairperson: M. Elena Luna Elizarraras&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 10:00am-10:50am Craig Nolder, Florida State University &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “Conjugate Harmonic Components of Monogenic Functions and Symmetry”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 10:50am-11:05am Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 11:05am-11:55am Graziano Gentili, Università di Firenze &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “Spherical power expansion and a Mittag-Leffler theorem for semi-regular functions”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 11:55am-12:10am Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 12:20pm-1:30pm Lunch, Athenaeum &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 2:00pm-2:50pm Dana Clahane, Fullerton College &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “Complex, Bicomplex, and Quaternionic Gaussian Moat Problems”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 2:50pm-3:10pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 3:10pm-4:00pm Lander Cnudde, Universiteit Gent, Belgium &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
Title: “Slice Fourier transform: definition, properties and corresponding convolutions”&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 4:00pm-4:20pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 6:30-8:30pm Social Dinner &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
==== Tuesday October 21st 2014 ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 10:00am-12:10pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 12:20pm-1:30pm Lunch, Athenaeum &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039; 2:00pm-4:00pm Discussion Session &#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday October 9th 2014 at 4pm (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Ahmed Sebbar, Institut de Mathematiques de Bordeaux&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;On a Remarkable Power Series&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We consider the sequence, defined by&lt;br /&gt;
&lt;br /&gt;
$s_{2n} = s_{n}, n \geq 1; s_{2n+1} = (-1)^{n}, n \geq 0 $&lt;br /&gt;
&lt;br /&gt;
or equivalently&lt;br /&gt;
&lt;br /&gt;
$s_{n} = (-1)^{b} $ if $n=2^a(1+2b); a,b \in \mathbf{N}$&lt;br /&gt;
&lt;br /&gt;
We explain how it is related to paperfolding and we give a precise analysis at $x = 1$&lt;br /&gt;
of the power series&lt;br /&gt;
&lt;br /&gt;
$f(x) = \sum s_n x^n$&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 25th 2014, at 4pm (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Christopher Lyon, CalState Fullerton&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Two notions of mirror symmetry for certain K3 surfaces&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In the mid-1990s, the physicists Berglund and Hubsch&lt;br /&gt;
proposed a way to construct a ``mirror partner&#039;&#039; for certain kinds of&lt;br /&gt;
Calabi-Yau manifolds.  When the manifold has (complex) dimension 2,&lt;br /&gt;
these are examples of K3 surfaces.  Around the same time, Dolgachev&lt;br /&gt;
and others conceived of a version of mirror symmetry that applies to&lt;br /&gt;
more general families of K3 surfaces.  In this talk, we will introduce&lt;br /&gt;
these special kinds of K3 surfaces, which are defined as hypersurfaces&lt;br /&gt;
in weighted projective space.  Then we will discuss the issue of&lt;br /&gt;
compatibility between the aforementioned versions of mirror symmetry.&lt;br /&gt;
While the question is open in general, we will highlight a particular&lt;br /&gt;
collection of surfaces where the compatibility can be proved.  This is&lt;br /&gt;
joint work with Paola Comparin, Nathan Priddis, and Rachel Webb.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 11th 2014, 4pm (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Ahmed Sebbar, Institut de Mathematiques de Bordeaux&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Equivariant functions&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; An equivariant function is a special meromorphic&lt;br /&gt;
function on the Poincare upper half-plane.  A concrete non trivial&lt;br /&gt;
example was given by Don Zagier answering a question of the physicist&lt;br /&gt;
Werner Nahm.  We show how to construct all the equivariant functions&lt;br /&gt;
by using ideas from complex analysis, modular forms and projective&lt;br /&gt;
differential geometry.  The talk is based on a joint work with&lt;br /&gt;
Abdellah Sebbar from The university of Ottawa.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Upcoming Talks and Workshops ==&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Spring 2014 ==&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, May 14, 2014 from noon to 12:50 pm in VN 116 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Roman Buniy, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Generalized helicity and Beltrami fields&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We propose covariant and non-abelian generalizations of the magnetic helicity and Beltrami equation. The gauge invariance, variational principle, conserved current, energy-momentum tensor and choice of boundary conditions elucidate the subject. In particular, we prove that any extremal of the Yang-Mills action functional $\frac{1}{4}\int_\Omega{F_{\mu\nu}F^{\mu\nu}}\,d^4x$ subject to the&lt;br /&gt;
local constraint $\epsilon^{\mu\nu\alpha\beta}{F_{\mu\nu}F_{\alpha\beta}}=0$ satisfies&lt;br /&gt;
the covariant non-abelian Beltrami equation.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, May 8, 2014 from 4pm to 5pm in Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039;  Dr. Hendrik De Bie, Clifford Research Group, Ghent University, Belgium ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Convolutions for the quaternion Fourier transform with applications in image processing&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this lecture I will explain how a quaternion Fourier&lt;br /&gt;
transform may be defined, an how a suitable convolution product can be&lt;br /&gt;
associated with it.I will subsequently discuss an application in color image processing,&lt;br /&gt;
namely a color edge detector. If time allows, I will also show how some of these results may be&lt;br /&gt;
generalized to higher dimensions using Clifford algebras.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 24, 2014 from 4pm to 5pm in Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speakers:&#039;&#039; Ryan Burns, Isaac Lien, Scott Lien, David Tyler ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;GrandPAD: Finally technology so easy that it can be used by a people ages 75 to 105.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; GrandPAD is a technology startup that was born at Chapman that is focused on providing an easy way for seniors citizens over the age of 75 to stay connected with their friends and family.  &lt;br /&gt;
GrandPAD was founded by Isaac Lien (CIS Major Class of 2017) and Scott Lien (Father of Isaac and former executive with Intuit.) Other key members of the team include Ryan Burns (Computer Science Class of 2014) and David Tyler (Computer Science Class of 2014). &lt;br /&gt;
Come and learn about the technology we have used to build GrandPAD and see the product in action. &lt;br /&gt;
GrandPAD -- Simply Connected&lt;br /&gt;
&lt;br /&gt;
See more at: http://www.GrandPAD.net&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 17, 2014 from 4pm to 5pm in Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039;  Professor Andrew Moshier, Chapman University ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;String diagrams for categories of posets&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; String diagrams, e.g., for braiding and symmetric monoidal categories, have&lt;br /&gt;
proven useful in Physics and Theoretical Computer Science, thanks to coherence&lt;br /&gt;
theorems that tell us that diagrams equivalent under suitable topological invariants&lt;br /&gt;
denote equal morphisms. In this talk, we extend a similar courtesy to categories of&lt;br /&gt;
partially ordered sets by adding an order on diagrams and allowing for topologically&lt;br /&gt;
&amp;quot;lossy&amp;quot; diagram rewrites. As an application, we characterize the objects in such&lt;br /&gt;
categories that behave as semi-lattices, lattices and distributive lattices.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Moshier_PosStrings_20140417.pdf PDF copy] of the abstract containing a diagram.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 10, 2014 from 4pm to 5pm in Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039;  Dr. Ali Nayeri, Chapman University ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;String Gas Cosmology and the Blue Tilt of the Primordial Gravitational Waves&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The BICEP-2 team has reported the detection of primordial cosmic microwave background B-mode polarization, with hints of a suppression of power at large angular scales relative to smaller scales. Provided that the B-mode polarization is due to primordial gravitational waves, this might imply a blue tilt of the primordial gravitational wave spectrum. Such a tilt would be incompatible with standard inflationary models, although it was predicted some years ago in the context of a mechanism that thermally generates the primordial perturbations through a Hagedorn phase of string cosmology. It has recently been shown that a Hagedorn phase of string gas cosmology can provide a causal mechanism for generating a nearly scale-invariant spectrum of scalar metric fluctuations, without the need for an intervening period of de Sitter expansion.The purpose of this talk is to encourage greater scrutiny of the data with priors informed by a model that is immediately falsifiable, but which predicts features that might be favored by the data-- namely a blue tensor tilt with an induced and complimentary red tilt to the scalar spectrum, with a naturally large tensor to scalar ratio that relates to both.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, April 7, 2014 at noon in Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; Dr. Cary Deck, University of Arkansas ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Behavior in Interconnected Strategic Contests&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Many strategic situations can be described as a contest where agents make unrecoverable investments in the hope of claiming a prize.  This presentation discusses a series of projects where outcomes depend on a set of interconnected contests.  One looks at the benefit of alliance formation when there is an opportunistic challenger who can decide which contest to enter.  The other considers the case of payoff complementarities across sub-contests.  In both cases the comparative statics of the respective model hold in aggregate, however individual behavior systematically differs from what is predicted.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, March 5, 2014 at noon in Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; Professor Asen Dontchev, University of Michigan, Ann Arbor ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Inverse Function Theorems: Old and New&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The classical inverse/implicit function theorems revolves around solving an equation in terms of a parameter and tell us&lt;br /&gt;
when the solution mapping associated with this equation&lt;br /&gt;
is a differentiable function with respect to the parameter. In this talk we move into a much wider territory in replacing&lt;br /&gt;
equation-solving by problems involving nonsmooth equations, as well as&lt;br /&gt;
models of optimization, equilibrium, and control theory.&lt;br /&gt;
&lt;br /&gt;
It turns out that if we put aside differentiability and focus on Lipschitz continuity only,&lt;br /&gt;
or even more general metric regularity properties of mappings, we can cover a wider range of models and&lt;br /&gt;
get estimates of the solution changes resulting from approximations of the model. As illustrations we&lt;br /&gt;
will present implicit function theorems for inequalities and variational inequalities.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 27, 2014 from 4pm to 5pm in Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; Professor Michael Campbell from CSUF ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Phase Transitions in Economic Models: Hot and Cold Market Equilibria in Bounded-Rational Potential Games&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In economic “games” for which there exists a potential (Shapley &amp;amp; Monderer), a dynamical model for which each agent’s strategy adjustment follows the gradient of the potential (perfectly rational part that wants to maximize payoff) along with a normally distributed random perturbation (part that considers errors in judgment, miscalculations, emotional bias, etc), is shown to equilibrate to a Gibbs measure for a finite number of agents.  There is also a non-dynamical way (large deviation theory) to impose this “bounded rationality” using Shannon entropy of agents arbitraging information within the system, and the equilibrium measure is again the Gibbs measure just as in statistical mechanics. For an infinite number of agents, more than one equilibrium measure may occur, which is the analogy of a phase transition in statistical mechanics (similar to water changing to ice or steam).  Here, the fluctuation variable that allows us to adjust the influence of the “irrational” element of decisions is related to “temperature” in statistical mechanics. A simple discrete Cournot oligopoly with increased local competition among agents has a phase transition. This model has a rich phase diagram with an &amp;quot;antiferromagnetic&amp;quot; checkerboard state, striped states and maze-like states with varying widths, and finally a &amp;quot;paramagnetic&amp;quot; unordered state. Such phases have economic implications as to how agents compete given various restrictions on how goods are distributed. The standard Cournot model corresponds to a uniform distribution of goods, whereas the power-law variations correspond to goods for which the distribution is more localized.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, January 23 -- Tuesday, January 28, 2014 in Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== 6th Annual CECAT Workshop in Pointfree Mathematics ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Hosted by the Center of Excellence in Computation, Algebra and Topology (CECAT)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Held at Chapman University, Von Neumann Hall (545 W. Palm Ave, Orange, CA 92866)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Program&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Thursday 23rd&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
10.00am-11.30am &#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Further thoughts on Pointfree Function Rings&amp;quot;&lt;br /&gt;
&lt;br /&gt;
12.30pm-1.30pm &#039;&#039;&#039;Fred Dashiell&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;A Geometric description of the second dual of C(K)&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Friday 24th&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
11.30am-12.30pm &#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Further thoughts on Pointfree Function Rings&amp;quot; cont.&lt;br /&gt;
&lt;br /&gt;
1.00pm-2.00pm &#039;&#039;&#039;Peter Jipsen&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Planar (semi) modular lattices&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Saturday 25th&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
11.30am-1pm &#039;&#039;&#039;Mark Sioen&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Some remarks (and more questions) about the topology of uniform convergence on&lt;br /&gt;
preferred sublocales &amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Monday 27th&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
noon-1.30pm &#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Archimeadean Kernels and Function Rings&amp;quot;&lt;br /&gt;
&lt;br /&gt;
2pm-3.30pm &#039;&#039;&#039;Drew Moshier&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Gelfand Naimark Duality for Ordered Spaces&amp;quot;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Tuesday 28th&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
10am-11.30pm &#039;&#039;&#039;Bernhard Banaschewski&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Realcompact Alexandroff Frames&amp;quot;&lt;br /&gt;
&lt;br /&gt;
12.30pm-1.30pm &#039;&#039;&#039;Open session&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Monday, January 13, 2014 from 1pm to 2pm in Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== Speaker: Dr. Adrian Nistor, UIUC (now Chapman University) ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Detecting and Repairing Performance Bugs&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Software bugs and ineffective testing cost the US economy&lt;br /&gt;
tens of billions of dollars each year.  My research develops novel&lt;br /&gt;
software and hardware techniques for combating software bugs.  My&lt;br /&gt;
research so far focuses on performance and concurrency bugs.&lt;br /&gt;
&lt;br /&gt;
In this talk, I will present Toddler and Lullaby, two novel techniques&lt;br /&gt;
for automatically detecting and repairing performance&lt;br /&gt;
bugs---programming mistakes that slow down program execution.  Unlike&lt;br /&gt;
profilers, which identify code regions that take a long time to&lt;br /&gt;
execute, Toddler and Lullaby focus on execution and code patterns that&lt;br /&gt;
are highly indicative of programming mistakes.  Toddler and Lullaby&lt;br /&gt;
found over 150 new performance bugs in widely used Java and C/C++&lt;br /&gt;
applications, including Groovy, Lucene, Google Core Libraries, GCC,&lt;br /&gt;
MySQL, and Chromium.  Over 100 of these bugs have already been fixed&lt;br /&gt;
by developers.&lt;br /&gt;
&lt;br /&gt;
And 4pm to 5pm in Von Neumann Hall&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Detecting Concurrency Bugs&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Multi-core processors are ubiquitous.  To utilize the&lt;br /&gt;
processing power of these processors, developers need to write&lt;br /&gt;
concurrent code.  Unfortunately, writing concurrent code is&lt;br /&gt;
notoriously difficult and prone to subtle concurrency bugs.  In this&lt;br /&gt;
talk, we will review the challenges faced by developers writing&lt;br /&gt;
concurrent code and techniques to help developers cope with&lt;br /&gt;
concurrency bugs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2015&amp;diff=9</id>
		<title>MathCS Seminar 2015</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2015&amp;diff=9"/>
		<updated>2021-02-22T18:32:32Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot; == Fall 2015 ==  === Thursday, December 10th 2015 at 4pm  (tea and cookies at 3:30pm) ===  ==== &amp;#039;&amp;#039;Speaker:&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;Dr. Justin Dressel, Chapman University&amp;#039;&amp;#039;&amp;#039; ====  &amp;#039;&amp;#039;Title:&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
== Fall 2015 ==&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 10th 2015 at 4pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Justin Dressel, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Violating a Hybrid Bell-Leggett-Garg Inequality with Weak Quantum Measurements&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We discuss both the theoretical background and the&lt;br /&gt;
experimental violation of a hybrid Bell-Leggett-Garg inequality using&lt;br /&gt;
four superconducting Xmon qubits. The algorithm uses sequential weak&lt;br /&gt;
measurements of a Bell state in the form of high-fidelity partial&lt;br /&gt;
projections, realized by entangling an ancilla qubit to each data&lt;br /&gt;
qubit using a controlled-Z two-qubit gate. After calibration of the&lt;br /&gt;
ancilla readout, these partial projections indirectly measure qubit&lt;br /&gt;
expectation values with a tunable amount of state disturbance. For&lt;br /&gt;
sufficiently weak disturbance, the hybrid inequality can be violated&lt;br /&gt;
using all data prepared in a single experimental configuration, thus&lt;br /&gt;
avoiding both the fair sampling and the disjoint sampling loopholes&lt;br /&gt;
that often appear in traditional Bell inequality implementations.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, November 4th 2015 at 4pm in  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Joshua Sack, California State University Long Beach&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum Logic and Structure&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; This talk presents logics for reasoning about properties of&lt;br /&gt;
quantum systems and quantum algorithms.  One logic, developed by&lt;br /&gt;
Birkhoff and von Neumann, is used to reason about testable properties&lt;br /&gt;
of a quantum system; the formal setting is the Hilbert lattice (the&lt;br /&gt;
lattice of closed subspaces of a Hilbert space).  Another logic is the&lt;br /&gt;
logic of quantum actions, developed more recently to reason about the&lt;br /&gt;
dynamics of a quantum system; the formal setting here is a quantum&lt;br /&gt;
dynamic frame, a kind of labelled transition system often used in&lt;br /&gt;
computer science to reason about classical programs.  This talk also&lt;br /&gt;
explains how these settings are essentially the same via a categorical&lt;br /&gt;
duality between the lattices and the frames, and how a decidable&lt;br /&gt;
probabilistic extension of the logic of quantum actions can be used to&lt;br /&gt;
reason about quantum algorithms such as Grover&#039;s search algorithm.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 23rd 2015 at noon, Beckman Hall room 107 (no tea and cookies this time, we will be taking the speaker to lunch after) ===&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Glen van Brummelen, Quest University, Canada&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Mercurial Tale of Spherical Trigonometry&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The trigonometry we see in high school is merely a pale&lt;br /&gt;
reflection of the creative, exciting subject that students learned&lt;br /&gt;
only decades ago. Born of the desire to predict the motions of the&lt;br /&gt;
heavenly bodies, the trigonometry of ancient astronomers took place&lt;br /&gt;
not on a flat sheet of paper, but on the celestial sphere. This led to&lt;br /&gt;
a theory with some of the most beautiful results in all of&lt;br /&gt;
mathematics, and applications that led to the birth of major modern&lt;br /&gt;
developments like symbolic algebra and logarithms. Until the subject&lt;br /&gt;
dropped off radar screens after World War II, it continued to enjoy&lt;br /&gt;
vitality through applications in navigation and crystallography. The&lt;br /&gt;
mathematical path we now travel through high school and college,&lt;br /&gt;
heavily emphasizing calculus, unfortunately has deprived students of&lt;br /&gt;
other mathematical gems. In this talk, we shall polish some of the&lt;br /&gt;
tarnish off one of the brightest of those jewels.&lt;br /&gt;
----&lt;br /&gt;
=== Friday, October 9th 2015, 2pm (tea and cookies 1:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;George J. Herrmann, Ph.D. student at University of Denver, Website: http://cs.du.edu/~herrmann&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A tour of Noncommutative Metric Geometry&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; This talk will be an introduction to the area of&lt;br /&gt;
Noncommutative Metric Geometry.  We will start with discussing&lt;br /&gt;
deformation quantization: the history and observations that motivate&lt;br /&gt;
our continued interest.  We will then shift gears slightly and discuss&lt;br /&gt;
some results of Connes and Rieffel in Noncommutative Geometry that&lt;br /&gt;
lead to Quantum (Compact) Metric Spaces and quickly introduce a few&lt;br /&gt;
nontrivial objects in this category.  Then we will end with the work&lt;br /&gt;
of Latremoliere in establishing a metric on the category of Quantum&lt;br /&gt;
Compact Metric Spaces.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, September 30th, 2015, at 3-5pm  ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Professor Daniel Alpay, Earl Katz Chair in Algebraic System Theory, Department of Mathematics, at Ben-Gurion University of the Negev&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Lecture Series by Professor Daniel Alpay, Lectures 5 and 6&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Rational functions are quotient of polynomials, or&lt;br /&gt;
meromorphic functions on the Riemann sphere. Here we consider&lt;br /&gt;
matrix-valued rational functions. A number of new aspects (a point can&lt;br /&gt;
be at the same time a zero and a pole of the function) and new notions&lt;br /&gt;
and methods appear (in particular the state space method. A key role&lt;br /&gt;
is played by the realization of a matrix-valued rational function $M$,&lt;br /&gt;
say analytic at the origin, that is, its representation in the form&lt;br /&gt;
$M(z)=D+zC(I-zA)^{-1}B$, where $A,B,C,D$ are matrices of appropriate&lt;br /&gt;
sizes.&lt;br /&gt;
&lt;br /&gt;
We will discuss matrix-valued rational functions, and their&lt;br /&gt;
connections with topics such as complex analysis, interpolation theory&lt;br /&gt;
of analytic functions contractive in the open unit disk (Schur&lt;br /&gt;
functions), the theory of linear systems (signal processing) and&lt;br /&gt;
matrix theory.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Lecture 5, 3:00pm-4:00pm&lt;br /&gt;
&lt;br /&gt;
1) Wavelet filters.&lt;br /&gt;
&lt;br /&gt;
2) Convex invertible cones.&lt;br /&gt;
&lt;br /&gt;
3) A new kind of realization.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Lecture 6, 4:00pm-5:00pm&lt;br /&gt;
&lt;br /&gt;
1) Several complex variables.&lt;br /&gt;
&lt;br /&gt;
2) The non commutative case.&lt;br /&gt;
&lt;br /&gt;
3) Rational functions on a compact Riemann surface,  theta functions.&lt;br /&gt;
&lt;br /&gt;
4) Quaternionic setting.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, September 29th, 2015, at 3:30-5:30pm ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Professor Daniel Alpay, Earl Katz Chair in Algebraic System Theory, Department of Mathematics, at Ben-Gurion University of the Negev&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Lecture Series by Professor Daniel Alpay, Lectures 3 and 4&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Rational functions are quotient of polynomials, or&lt;br /&gt;
meromorphic functions on the Riemann sphere. Here we consider&lt;br /&gt;
matrix-valued rational functions. A number of new aspects (a point can&lt;br /&gt;
be at the same time a zero and a pole of the function) and new notions&lt;br /&gt;
and methods appear (in particular the state space method. A key role&lt;br /&gt;
is played by the realization of a matrix-valued rational function $M$,&lt;br /&gt;
say analytic at the origin, that is, its representation in the form&lt;br /&gt;
$M(z)=D+zC(I-zA)^{-1}B$, where $A,B,C,D$ are matrices of appropriate&lt;br /&gt;
sizes.&lt;br /&gt;
&lt;br /&gt;
We will discuss matrix-valued rational functions, and their&lt;br /&gt;
connections with topics such as complex analysis, interpolation theory&lt;br /&gt;
of analytic functions contractive in the open unit disk (Schur&lt;br /&gt;
functions), the theory of linear systems (signal processing) and&lt;br /&gt;
matrix theory.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Lecture 3, 3:30pm-4:30pm&lt;br /&gt;
&lt;br /&gt;
1) Realization and geometry: $J$-unitary rational functions.&lt;br /&gt;
&lt;br /&gt;
2) Applications to interpolation problems.&lt;br /&gt;
&lt;br /&gt;
3) Inverse scattering problem (Krein and Marchenko).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Lecture 4, 4:30pm-5:30pm&lt;br /&gt;
&lt;br /&gt;
1) First order degree systems.&lt;br /&gt;
&lt;br /&gt;
2) Smith-McMillan local form.&lt;br /&gt;
&lt;br /&gt;
3) Zero-pole structure.&lt;br /&gt;
&lt;br /&gt;
4)  Applications to inverse problems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, September 28th 2015 at 4:00pm (tea and cookies at 3:30pm)  ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Prof. Ahmed Sebbar, Bordeaux University, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Capacities and Jacobi Matrices&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Given a system of intervals of the real line, we&lt;br /&gt;
construct a Jacobi matrix (tridiagonal and periodic) whose spectrum is&lt;br /&gt;
this given system of intervals. We discuss the underlying conditions&lt;br /&gt;
and techniques, as well as possible applications.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, September 25th, 2015, at 1-3pm ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Professor Daniel Alpay, Earl Katz Chair in Algebraic System Theory, Department of Mathematics, at Ben-Gurion University of the Negev&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Lecture Series by Professor Daniel Alpay, Lectures 1 and 2&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Rational functions are quotient of polynomials, or&lt;br /&gt;
meromorphic functions on the Riemann sphere. Here we consider&lt;br /&gt;
matrix-valued rational functions. A number of new aspects (a point can&lt;br /&gt;
be at the same time a zero and a pole of the function) and new notions&lt;br /&gt;
and methods appear (in particular the state space method. A key role&lt;br /&gt;
is played by the realization of a matrix-valued rational function $M$,&lt;br /&gt;
say analytic at the origin, that is, its representation in the form&lt;br /&gt;
$M(z)=D+zC(I-zA)^{-1}B$, where $A,B,C,D$ are matrices of appropriate&lt;br /&gt;
sizes.&lt;br /&gt;
&lt;br /&gt;
We will discuss matrix-valued rational functions, and their&lt;br /&gt;
connections with topics such as complex analysis, interpolation theory&lt;br /&gt;
of analytic functions contractive in the open unit disk (Schur&lt;br /&gt;
functions), the theory of linear systems (signal processing) and&lt;br /&gt;
matrix theory.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Lecture 1, 1pm-2pm:&lt;br /&gt;
&lt;br /&gt;
1)Preliminaries on rational functions. Notion of realization.&lt;br /&gt;
&lt;br /&gt;
2) Transfer functions. Link with linear systems.&lt;br /&gt;
&lt;br /&gt;
3) Resolvent operators.&lt;br /&gt;
&lt;br /&gt;
4) Proof of the realization theorem: { The backward-shift realization}.&lt;br /&gt;
&lt;br /&gt;
5) Various characterizations of rational functions.&lt;br /&gt;
&lt;br /&gt;
6) The Wiener algebra.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
Lecture 2, 2pm-3pm:&lt;br /&gt;
&lt;br /&gt;
1) Main properties of the realization.&lt;br /&gt;
&lt;br /&gt;
2) Another proof of the realization theorem.&lt;br /&gt;
&lt;br /&gt;
3) Minimal realization.&lt;br /&gt;
&lt;br /&gt;
4) Minimal factorizations.&lt;br /&gt;
&lt;br /&gt;
5) Spectral factorizations.&lt;br /&gt;
&lt;br /&gt;
6) Reproducing kernel spaces.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 17th, 2015 at 3pm (tea and cookies at 2:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Ahmed Sebbar, Bordeaux University, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; The Frobenius determinant theorem and applications.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039;  In this first talk, we will discuss the celebrated determinant&lt;br /&gt;
Frobenius theorem and how it arised naturally in the study of a&lt;br /&gt;
hierarchy of hypersurfaces, of partial differential operators and&lt;br /&gt;
metrics.&lt;br /&gt;
&lt;br /&gt;
The first elements of this hierarchy are the cubic $x^3 + y ^3 + z^3 -&lt;br /&gt;
3xyz = 1$ (so called Jonas hexenhut) and the partial differential&lt;br /&gt;
operator $\Delta_3 = \frac{\delta^3}{\delta_{x^3}} +&lt;br /&gt;
\frac{\delta^3}{\delta_{y^3}} + \frac{\delta^3}{\delta_{z^3}} -3&lt;br /&gt;
\frac{\delta^3}{\delta_x \delta_y \delta_z}$, introduced by P.Humbert&lt;br /&gt;
in 1929 in another context. We explain why this operator is a good&lt;br /&gt;
extension to ${\rm I\!R}^3$ of the Laplacian in two dimensions&lt;br /&gt;
$\Delta_2 = \frac{\delta^2}{\delta_{x^2}} +&lt;br /&gt;
\frac{\delta^2}{\delta_{y^2}}$ We discuss its links with Spectral&lt;br /&gt;
theory, Elliptic functions, number theory and a sort of Finsler&lt;br /&gt;
geometry.&lt;br /&gt;
&lt;br /&gt;
This is a part of a large project conducted in collaboration with&lt;br /&gt;
Daniele Struppa, Adrian Vajiac and Mihaela Vajiac.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 3rd, 2015 at 4pm (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Yasushi Kondo, Kinki University, Osaka, Japan&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Composite Quantum Gates with  Aharanov–Anandan phases.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Unitary operations acting on a quantum system must be&lt;br /&gt;
robust against systematic errors in control parameters for reliable&lt;br /&gt;
quantum computing. Composite pulse technique in nuclear magnetic&lt;br /&gt;
resonance realizes such a robust operation by employing a sequence of&lt;br /&gt;
possibly poor-quality pulses. We show that composite pulses that&lt;br /&gt;
compensate for a pulse length error in a one-qubit system have a&lt;br /&gt;
vanishing dynamical phase and thereby can be seen as geometric quantum&lt;br /&gt;
gates with Aharanov-Anandan phases.&lt;br /&gt;
&lt;br /&gt;
== Spring 2015 ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, February 13th, 10:00 a.m. to noon ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Daniel Alpay, Earl Katz Chair in Algebraic System Theory, Department of Mathematics, at Ben-Gurion University of the Negev&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Fock spaces and non commutative stochastic distributions. The free setting. Free (non commutative) stochastic processes.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We present the non commutative counterpart of the&lt;br /&gt;
previous talk. We will review the main definitions of free analysis&lt;br /&gt;
required and then present, and build stationary increments non&lt;br /&gt;
commutative processes.  The values of their derivatives are now&lt;br /&gt;
continuous operators from the space of non commutative stochastic test&lt;br /&gt;
functions into the space of non commutative stochastic distributions.&lt;br /&gt;
&lt;br /&gt;
More details at:&lt;br /&gt;
&lt;br /&gt;
http://blogs.chapman.edu/scst/2015/02/02/daniel-alpay/&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 12th, 11:00 a.m. to 1:00 p.m. ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Daniel Alpay, Earl Katz Chair in Algebraic System Theory, Department of Mathematics, at Ben-Gurion University of the Negev&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Bochner and Bochner-Minlos theorem. Hida’s white noise space and Kondratiev’s spaces of stochastic distributions, Stationary increments stochastic processes. Linear stochastic systems.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We discuss the Bochner-Minlos theorem and build Hida’s&lt;br /&gt;
white noise space. We build stochastic processes in this space with&lt;br /&gt;
derivative in the Kondratiev space of stochastic distributions. This&lt;br /&gt;
space is an algebra with the Wick product, and its structure of&lt;br /&gt;
tallows to define stochastic integrals.&lt;br /&gt;
&lt;br /&gt;
More details at:&lt;br /&gt;
&lt;br /&gt;
http://blogs.chapman.edu/scst/2015/02/02/daniel-alpay/&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, February 10th, 10:00 a.m. to noon ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Daniel Alpay, Earl Katz Chair in Algebraic System Theory, Department of Mathematics, at Ben-Gurion University of the Negev&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Positive definite functions, Countably normed spaces, their duals and Gelfand triples&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We survey the notion of positive definite functions and&lt;br /&gt;
of the associated reproducing kernel Hilbert spaces. Examples are&lt;br /&gt;
given relevant to the sequel of the talks. We also define nuclear&lt;br /&gt;
spaces and Gelfand triples, and give as examples Schwartz functions&lt;br /&gt;
and tempered distributions.&lt;br /&gt;
&lt;br /&gt;
More details at:&lt;br /&gt;
&lt;br /&gt;
http://blogs.chapman.edu/scst/2015/02/02/daniel-alpay/&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, January 14th, 2015 at 3pm (tea and cookies at 2:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Richard N. Ball, University of Denver&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Pointfree Pointwise Suprema in Unital Archimedean L-Groups (joint work with Anthony W. Hager, Wesleyan University, and Joanne Walters-Wayland, Chapman University)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; When considering the suprema of real-valued functions,&lt;br /&gt;
it is often important to know whether this supremum coincides with the&lt;br /&gt;
function obtained by taking the supremum of the real values at each&lt;br /&gt;
point. It is therefore ironic, if not surprising, that the fundamental&lt;br /&gt;
importance of pointwise suprema emerges only when the ideas are placed&lt;br /&gt;
in the pointfree context.&lt;br /&gt;
&lt;br /&gt;
For in that context, namely in $\mathcal{R}L$, the archimedean&lt;br /&gt;
$\ell$-group of continuous real valued functions on a locale $L$, the&lt;br /&gt;
concept of pointfree supremum admits a direct and intuitive&lt;br /&gt;
formulation which makes no mention of points. The surprise is that&lt;br /&gt;
pointwise suprema can be characterized purely algebraically, without&lt;br /&gt;
reference to a representation in some $\mathcal{R}L$. For the&lt;br /&gt;
pointwise suprema are precisely those which are context-free, in the&lt;br /&gt;
sense of being preserved by every $W$-morphism out of $G$.&lt;br /&gt;
&lt;br /&gt;
(The algebraic setting is the category $W$ of archimedean&lt;br /&gt;
lattice-ordered groups (`$\ell$-groups) with designated weak order&lt;br /&gt;
unit, with morphisms which preserve the group and lattice operations&lt;br /&gt;
and take units to units. This is an appropriate context for this&lt;br /&gt;
investigation because every $W$-object can be canonically&lt;br /&gt;
represented as a subobject of some $\mathcal{R}L$.)&lt;br /&gt;
&lt;br /&gt;
Completeness properties of $\mathcal{C}X$ with respect to (various&lt;br /&gt;
types of) bounded suprema are equivalent to (various types of)&lt;br /&gt;
disconnectivity properties of $X$. These are the classical&lt;br /&gt;
Nakano-Stone theorems, and their pointfree analogs for $\mathcal{R}L$&lt;br /&gt;
are the work of Banaschewski and Hong. We show that every bounded&lt;br /&gt;
(countable) subset of $\mathcal{R}^+L$ has a join in $\mathcal{R}L$&lt;br /&gt;
iff $L$ is boolean (a $P$-frame).  More is true: every existing&lt;br /&gt;
bounded (countable) join of an arbitrary $W$-object $G$ is&lt;br /&gt;
pointwise iff the Madden frame $\mathcal{M}G$ is boolean (a&lt;br /&gt;
$P$-frame).&lt;br /&gt;
&lt;br /&gt;
Perhaps the most important attribute of pointwise suprema is that&lt;br /&gt;
density with respect to pointwise convergence detects epicity. We&lt;br /&gt;
elaborate. Of central importance to the theory of $W$ is&lt;br /&gt;
its smallest full monoreflective subcategory $\beta{}W$,&lt;br /&gt;
comprised of the objects having no proper epic extensions. That means&lt;br /&gt;
each $W$-object $G$ has a largest epic extension $G \to&lt;br /&gt;
\beta G$, and this extension is functorial. It turns out that a&lt;br /&gt;
$W$-extension $A \leq B$ is epic iff $A$ is pointwise dense&lt;br /&gt;
in $B$. Thus the epireflective hull $\beta G$ of an arbitrary&lt;br /&gt;
$W$-object $G$ can be constructed by means of pointwise&lt;br /&gt;
Cauchy filters.&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2016&amp;diff=8</id>
		<title>MathCS Seminar 2016</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2016&amp;diff=8"/>
		<updated>2021-02-22T18:31:48Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot; == Fall 2016 ==  The seminar talks are in Von Neumann Hall VN 116 (545 W Palm Ave corner of W Palm Ave and railroad, Orange, CA 92866).  See [http://www.chapman.edu/discover/...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
== Fall 2016 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are in Von Neumann Hall VN 116 (545 W Palm Ave&lt;br /&gt;
corner of W Palm Ave and railroad, Orange, CA 92866).&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/discover/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Von Neumann Hall is Building 38 on the&lt;br /&gt;
[http://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf&lt;br /&gt;
Campus Map]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&#039;&#039;&#039;Note:&#039;&#039;&#039; This semester we will (for now) start talks &#039;&#039;&#039;at 1:15&lt;br /&gt;
pm&#039;&#039;&#039;.  From 12:45 pm to 1:15 pm is time for refreshments and&lt;br /&gt;
interesting conversations with the speaker, so consider coming a bit&lt;br /&gt;
early.--&amp;gt;&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Upcoming Talks and Workshops ==&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 15th at 4:00pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alexander Kurz, University of Leicester&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Reasoning in Applied Logics&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  Reasoning is a fundamental challenge in many areas of Computer Science such as databases (query-answering), semantic web (ontologies), artifical ingelligence (planning), and software engineering (formal methods, verification). But reasoning in general purpose logics such as first-order predicate logic does not lend itself well to automatisation. Over the decades, this lead to the succesful development of a multitude of bespoke logics, each tailored to a specific application (time, knowledge, obligations, probabilities, dynamics, …).&lt;br /&gt;
With the growing success of these logics applications are getting more ambitious and require reasoning methods for combinations of such logics. In this talk, we present an approach that aims at designing good proof systems for a wide variety of logics based on so-called multi-type display calculi. We will also report on our work of building tools that support reasoning about and in such calculi.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 8th at 4:00pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Michael Campbell, CSUF&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Statistical Mechanics of Bounded-Rational Potential Games with Applications&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;   Frequently, real economic agents do not follow purely rational strategies.  These individual non-rational behaviors (due to errors in judgment, incomplete information, emotional bias, etc.) can result in some fascinating organized large-scale structures, which depend on the degree of non-rational behavior.&lt;br /&gt;
&lt;br /&gt;
We look at two such models for Potential Games [Shapley and Monderer]: a dynamical drift-diffusion model, and a static large deviation theory model based on Shannon information entropy and arbitrage.  The equilibrium measure in both cases is the Gibbs measure found in statistical mechanics.  We show that the variables that gauge non-rational behavior in both models are related to “temperature” by a fluctuation-dissipation relation.&lt;br /&gt;
&lt;br /&gt;
A type of localized discrete Cournot oligopoly has a rich phase diagram with an &amp;quot;antiferromagnetic&amp;quot; checkerboard state, striped states and maze-like states with varying widths, and finally a &amp;quot;paramagnetic&amp;quot; unordered state. Such phases have economic implications as to how agents compete given various restrictions on how goods are distributed. &lt;br /&gt;
&lt;br /&gt;
The theory is also applied to a Speculative and Hedging Model in Oil and U.S. Dollar Markets [Carfi and Musolino] for a single multinational “airline” and many “bank” players.  Based on results for the Nash equilibrium (zero temperature) and preliminary results, there is a phase transition for which a single equilibrium exists at higher non-rational behavior (high temperature), and two equilibria at lower non-rational behavior (low temperature), when the “airline” makes no purchase of oil.  The low temperature phase is in the spirit of the Sonnenschein–Mantel–Debreu theorem, with the extra insight of symmetry-breaking to explain multiple equilibria.  Likewise, Huw Dixon’s result on the “inevitability of collusion” is shown to hold for a Cournot oligopoly with a Veblen good.  Purely rational neoclassical theory (i.e., Nash equilibrium analysis) alone does not predict this, even though it is observed to occur in more general cases.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, December 6th at 4:00pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Alain Yger, IMB, Universit ́e de Bordeaux, Talence, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An arithmetic elimination theorem and bounds for multivariate residues&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  I will present an elimination theorem inspired by a classical theorem of Oskar Perron, combined with the approach proposed in 2005 by Zbigniew Jelonek towards the sharp geometric effectiveness of Hilbert’s Nullstellensatz. I will show next how it can be used in order to get precise estimates (in terms of the geometric and arithmetic complexity of all the data, fitting with both geometric and arithmetic B ́ezout theorems) for total sums of multivariate residues related to polynomials maps defined over Q over an algebraic variety also defined over Q. Methods start with revisiting Euclid’s algorithm, together with Bergman-Weil developments. This is very recent joint work with Mart ́ın Sombra (ICREA and University of Barcelona). &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 1st at 4:00pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Herbert W. Hamber, University of California at Irvine&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Problem with Quantum Gravitation&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  Of the four fundamental forces, Gravity is the one that has been studied the longest. Besides being an immediate fact of everyday life, it still presents us today with some of the deepest challenges in contemporary physics. Einstein’s (classical) relativistic Gravity is unique, in the sense that it influences both the very largest and the very smallest length scales. These include black holes, pulsars, quasars, the Big Bang, and the Universe as a whole, at one end of the spectrum, and the microscopic structure of space-time and unified theories at the other end. Moreover, one of its most basic predictions (gravitational waves) has recently been detected on earth.&lt;br /&gt;
Recent attempts at a quantum theory of Gravity have tried to combine, in a consistent framework, what some have regarded as the two greatest achievements of 20-th century physics: General Relativity and Quantum Mechanics. A major challenge has been to develop specific predictions that might be tested by observation. The aim of my talk will be to give a very broad brush (and hopefully elementary) survey of our understanding of Gravity and its Quantum extension.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 17th at 4:15pm  (tea and cookies at 3:45pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Daniel Alpay, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Linear stochastic systems, commutative and non commutative: a white noise space approach&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  The Gelfand triple consisting of the Schwartz functions the Lebesgue space and tempered distributions play a key role in analysis, and in particular in the theory of partial differential equations.  We describe related triples, where the Lebesgue space is replaced by the symmetric (resp. full) Fock space associated to the Lebesgue space.  The term &amp;quot;white noise space&amp;quot; in the title refers to Hida&#039;s white noise space, which is a construction of the symmetric Fock space associated to the Lebesgue space using the  Bochner-Minlos theorem. The tempered distributions are now replaced by spaces of stochastic distributions. These are instances of a new family of topological algebras, which generalizes the notion of Banach algebra.&lt;br /&gt;
As applications we study stationary increments stochastic processes and their derivatives, stochastic calculus, and  linear stochastic systems, where randomness is also in the parameters of the system.&lt;br /&gt;
&lt;br /&gt;
The talk is based on joint works with Haim Attia, Palle Jorgensen, Alon Kipnis,  David Levanony, Ariel Pinhas, and Guy Salomon. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 10th at 4:15pm  (tea and cookies at 3:45pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Matthew Leifer, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Plausibility Measures on Test Spaces&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  Plausibility measures are structures for reasoning in the face of uncertainty that generalize probabilities, unifying them with weaker structures like possibility measures and comparative probability relations.  So far, the theory of plausibility measures has only been developed for classical sample spaces, but there are various reasons for&lt;br /&gt;
wanting to apply them to quantum theory, as I shall explain. In this talk, I will generalize the theory to test spaces, so that plausibility&lt;br /&gt;
measures can be applied to general operational theories, and to quantum theory in particular. Our main results are on when a plausibility&lt;br /&gt;
measure agrees with a probability measure, i.e. when its comparative relations coincide with those of a probability measure. For strictly&lt;br /&gt;
finite test spaces we obtain a precise analogue of the classical result that the Archimedean condition is necessary and sufficient for agreement&lt;br /&gt;
between a plausibility and a probability measure. In the locally finite case, the Archimedean condition implies the weaker condition of almost&lt;br /&gt;
agreement, and one needs a stronger version of the Archimedean condition to get agreement.  This is the same as the condition needed in the&lt;br /&gt;
classical measure-theoretic case, even though we are only dealing with tests with a finite number of outcomes.&lt;br /&gt;
&lt;br /&gt;
This talk is based on joint work with Tobias Fritz (preprint available at: https://arxiv.org/abs/1505.01151 )&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== CECHA Conference: Friday to Monday, November 4th to November 7th in Sandhu Conference Center ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;CECHA: Celebrating Daniel Alpay’s 60th birthday&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;International Conference on Complex Analysis and Operator Theory&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  For directions, schedule, and book of abstracts, see CECHA Webpage: [http://www.chapman.edu/scst/research/centers-of-excellence/cecha/index.aspx CECHA Webpage],&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 27th at 4pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Roman Buniy, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Geometric invariants associated with linear transformations&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  Invariant operators associated with linear transformations naturally lead to invariant differential forms and related geometric invariants.&lt;br /&gt;
Complex analytic properties of transformations provide an efficient way to generate and compute the invariants.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 20th at 4pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christopher Cantwell, USC&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum Chess, Making Quantum Phenomena Accessible&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  Quantum phenomena have remained largely inaccessible to the general public.  There tends to be a scare factor associated with the word “Quantum”, with the usual responses being along the lines of “too complicated for me.”  This is in large part due to the alien nature of phenomena such as superposition and entanglement.  However, Quantum Computing is a very active area of research and one day we will have games that run on those quantum computers.  Quantum phenomena such as superposition and entanglement will seem as normal as gravity.  Is it possible to create such games today?  Can we make games that are built on top of a realistic quantum simulation and introduce players of any background to quantum concepts in a fun and mentally stimulating way?&lt;br /&gt;
&lt;br /&gt;
On of the difficulties with any quantum simulation run on a classical computer is that the Hilbert space grows exponentially, making simulations of an appreciable size physically impossible due largely to memory restrictions.  Here we will discuss the conception and development of Quantum Chess, and how to overcome some of the difficulties faced.  We can then ask the question, “What’s next?”  What are some of the difficulties Quantum Chess still faces, and what is the future of quantum games?&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 13th at 4pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;N.D. Hari Dass, Tata Centre for Interdisciplinary Sciences, Tata Inst. for Fundamental Research (TIFR-TCIS), Hyderabad, India&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Three results on weak measurements&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  I shall present three important results on weak measurements.&lt;br /&gt;
They are: &lt;br /&gt;
i) repeated weak measurements on a single copy can not provide any information on it and further that in the limit of very large such mea- surements, weak measurements have exactly the same characterstics as strong measurements.However, a number of interesting results can be obtained for joint probabilities for the random walks in the quantum state space under such repeated weak measurements, &lt;br /&gt;
ii) the apparent non-invasiveness of weak measurements is no more advantageous than strong measurements in the spe- cific context of Leggett-Garg measurements when errors are properly taken into account and finally, iii) weak value measurements are optimal, in the precise sense of Wootters and Fields, when the post-selected states are mu- tually unbiased with respect to the eigenstates of the observable whose weak values are being measured. Furthermore, notion of weak value coordinates for state spaces are introduced and elaborated. &lt;br /&gt;
It is shown that the metric on the state space in these coordinates is conformal.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 6th at 4pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Ahmed Sebbar, Bordeaux University &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Differentially algebraic functions &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  We call an analytic function f(z), defined on some open subset  Differentially Algebraic (DA) if it satisfies some differential equation of the form Q(z, f(z), f&#039;(z),\cdots, f^{(n)}(z)) = 0 for all z in its domain, where Q is a nonzero polynomial of n+2 variables, with complex coefficients.The four functions: The exponential functions e^z, the Euler Gamma function Gamma(z),  the Riemann Zeta function zeta(s) and the Jacobi theta function theta(tau) are all related by Mellin transformations.&lt;br /&gt;
&lt;br /&gt;
We explain briefly why Gamma  and zeta are not DA but the function theta verifies a nonlinear differential equation of the third order. We give various reasons (Geometry, Arithmetics, Dynamical Systems… ) as to why this equation must exist.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 22nd at 4pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Josh Mutus from Google, Santa Barbara &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;What we do at the Google Quantum Hardware team&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  We’re trying to build a quantum computer capable of serving Google’s billions of users worldwide. I’ll introduce why Google wants to build a quantum computer and outline our two major thrusts: quantum annealing and error-corrected universal quantum computation. I’ll describe how we’re building our quantum computer from the ground up, starting with the microfabrication techniques used to engineer our superconducting qubits. Also, I’ll share overview of our new Quantum Hardware lab, including specialized high-capacilty cryostats, custom built high-frequency electronics and a our stack of open-source experimental control software.&lt;br /&gt;
&lt;br /&gt;
Josh works with the team of Dr. John Martinis, who heads a cutting-edge experimental program for realizing a quantum computer with superconducting quantum bits. You can read about some of their recent accomplishments here: http://web.physics.ucsb.edu/~martinisgroup/&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 15th at 4pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Ali Nayeri, Chapman University &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Truly quantum Gibbs: Thermal state of a system whose charges don’t commute &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  I present a detailed analysis for the classical stability of $4$&lt;br /&gt;
dimensional Anti-de Sitter spacetime (AdS$_4$) by decomposing the&lt;br /&gt;
first-order perturbations of a spherical symmetric gravitational&lt;br /&gt;
field into so called tensor harmonics which transform as&lt;br /&gt;
irreducible representative of the rotation group (Regge-Wheeler&lt;br /&gt;
decomposition). It is shown that there is no nontrivial&lt;br /&gt;
stationary perturbation for the angular momentum $l &amp;lt; 2$. The&lt;br /&gt;
stability analysis forces the frequency of the gravitational modes&lt;br /&gt;
to be constrained in a way that the frequency of scalar modes are&lt;br /&gt;
constrained.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== CECHA Workshop: Monday to Monday, August 22nd to August 29th at 9am  (tea and cookies at 8:30am) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Takashi Aoki, Kindai University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Operators of infinite order and exact WKB analysis&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Contents and Description:&lt;br /&gt;
Part I  Differential operators, microdifferential operators and pseudodifferential operators of infinite order&lt;br /&gt;
1. Introduction&lt;br /&gt;
2. Algebraic definitions of pseudodifferential operators in complex analytic category&lt;br /&gt;
3. Kernel functions&lt;br /&gt;
4. Symbols of pseudodifferential operators and symbolic calculus&lt;br /&gt;
5. Exponential calculus&lt;br /&gt;
6. Applications&lt;br /&gt;
&lt;br /&gt;
Part II Exact WKB analysis&lt;br /&gt;
1. Introduction&lt;br /&gt;
2. WKB solutions of ODE of second order with a large parameter&lt;br /&gt;
3. Borel sums of WKB solutions and connection formulas&lt;br /&gt;
4. WKB solutions and microdifferential operators&lt;br /&gt;
5. Higher-order equations and infinite-order equations&lt;br /&gt;
6. Applications to special functions&lt;br /&gt;
&lt;br /&gt;
Prerequisites for this lecture are complex function theory and ordinary differential equations in the complex domain.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, August 26th at 11am  (tea and cookies at 10:30am) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Nicole Yunger Halpern (Institute for Quantum Information and Matter, California &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Truly quantum Gibbs: Thermal state of a system whose charges don’t commute &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; The grand canonical ensemble lies at the core of statistical mechanics. A small system thermalizes to this state while exchanging heat and particles with a bath. A quantum system may exchange quantities, or “charges,” represented by operators that fail to commute. Whether such a system thermalizes, and what form the thermal state has, concerns truly quantum thermodynamics. I characterize this state in three ways: First, I generalize the system-and-bath microcanonical ensemble. Tracing out the bath yields the system’s thermal state. Second, this thermal state is expected to be the fixed point of typical dynamics. Finally, the thermal state is completely passive (unable to output thermodynamic work) in a resource-theory model for thermodynamics. This study opens new avenues into equilibrium in the presence of quantum noncommutation. &lt;br /&gt;
References:&lt;br /&gt;
Yunger Halpern et al. Nature Communications 7, 12051 (2016). Yunger Halpern arXiv:1409.7845 (2014). &lt;br /&gt;
This work was conducted with Philippe Faist, Jonathan Oppenheim, and Andreas Winter. &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, August 23rd at 11am  (tea and cookies at 10:30am) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Howard Wiseman of Griffith University, and the Centre for Quantum Computation and Communication Technology&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum State Smoothing - what does an open quantum system do when it is only partly observed? (by Howard Wiseman and Ivonne Guevara)&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Under noisy observations, estimation theory allows one to infer the state of the measured system, if its a priori statistics are given. In the continuous time situation, three different types of estimation can be distinguished: filtering, which is estimating of the state at time t from earlier records; retro-filtering, which is estimating the state at time t from later records; and smoothing, which is estimating the state at time t from both earlier and later records. Of the three, smoothing allows the greatest precision. This theory has been well developed in classical systems, but its application to quantum systems has only recently begun to be explored. Previous works have used the term “quantum smoothing” to mean estimating classical parameters, [Tsang, Phys. Rev. Lett. 102, 250403 (2009)], which is essentially classical smoothing in which the noisy observation of the classical parameters is mediated by a quantum system. Here we introduce quantum state smoothing, where the state of a partially observed open quantum system itself is smoothed [Guevara and Wiseman,  Phys. Rev. Lett. 115, 180407 (2015).]. We achieve this by applying classical smoothing to a hypothetical unobserved noisy measurement record correlated with the stochastic dynamics (&amp;quot;quantum trajectories&amp;quot;) of the system, induced by that hypothetical measurement. Using the formalism of linear quantum trajectories, we simulate quantum state smoothing for a qubit, and quantify how well the unobserved results can be estimated. Our investigations shed new light on the nature of the quantum state. &lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, August 18th at 4:00pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Fabrizio Colombo, Politecnico di Milano&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quaternionic spectral theory&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk we give an overview of the quaternionic spectral theory based on the notion of S-spectrum. We present the state of the art of the quaternionic version of the various functional calculi associated with slice hyperholomorphic functions. Moreover we discuss the spectral theorem for quaternionic (unbounded) normal operators using the notion of S-spectrum. The proof consists of first establishing a spectral theorem for quaternionic bounded normal operators and then using a transformation which maps a quaternionic unbounded normal operator to a quaternionic bounded normal operator. With the spectral theorem we complete the foundation  of spectral analysis of  quaternionic operators. An important  motivation for studying the spectral theorem for quaternionic unbounded normal operators is given by the subclass of unbounded anti-self adjoint quaternionic operators which plays a crucial role in the quaternionic quantum mechanics.&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2016 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are in Von Neumann Hall VN 116 (545 W Palm Ave&lt;br /&gt;
corner of W Palm Ave and railroad, Orange, CA 92866).&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/discover/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Von Neumann Hall is Building 38 on the&lt;br /&gt;
[http://www.chapman.edu/discover/_files/CU_CampusMap2012-13-2.pdf&lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&#039;&#039;&#039;Note:&#039;&#039;&#039; This semester we will (for now) start talks &#039;&#039;&#039;at 1:15&lt;br /&gt;
pm&#039;&#039;&#039;.  From 12:45 pm to 1:15 pm is time for refreshments and&lt;br /&gt;
interesting conversations with the speaker, so consider coming a bit&lt;br /&gt;
early.--&amp;gt;&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Upcoming Talks and Workshops ==&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, May 19th at 4pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Marco Panza, Professor of Philosophy at Universite Paris 1 (Sorbonne)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Platonisms (in Philosophy of Mathematics) &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
Abstract: Platonism is a very often mentioned option in the discussion about the foundation and methodology of mathematics, but it encompasses quite different conceptions. In my talk, I will try to present an overview of different platonist views in contemporary (and less contemporary) philosophy of mathematics.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, April 27th at 12noon  (tea and cookies at 11:30am) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alessandra Palmigiano, TU Delft, The Netherlands&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Algorithmic correspondence and canonicity for non-distributive logics&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Since the 1970s, correspondence theory has been one of the most important items in the toolkit of modal logicians. Unified correspondence [6] is a very recent approach, which has imported techniques from duality, algebra and formal topology [10] and exported the state of the art of correspondence theory well beyond normal modal logic, to a wide range of logics including, among others, intuitionistic and distributive lattice-based (normal modal) logics [8], non-normal (regular) modal logics [17], substructural logics [9, 7, 5], hybrid logics [13], and mu-calculus [2, 4, 3].&lt;br /&gt;
&lt;br /&gt;
The breadth of this work has stimulated many and varied applications. Some are closely related to the core concerns of the theory itself, such as the understanding of the relationship between different methodologies for obtaining canonicity results [16, 7], or of the phenomenon of pseudo-correspondence [11]. Other, possibly surprising applications include the dual characterizations of classes of finite lattices [14], the identification of the syntactic shape of axioms which can be translated into analytic rules of a proper display calculus [15], and the design of display-type calculi for the logics of capabilities and resources, and their applications to the logical modelling of business organizations [1]. Finally, the insights of unified correspondence theory have made it possible to determine the extent to which the Sahlqvist theory of classes of normal DLEs can be reduced to the Sahlqvist theory of normal Boolean expansions, by means of Gödel-type translations [12]. It is interesting to observe that, through the development of applications such as [16, 15, 11], the algorithm ALBA acquires novel conceptual significance, which cannot be reduced exclusively to its original purpose as a computational tool for correspondence theory.&lt;br /&gt;
&lt;br /&gt;
The most important technical tools in unified correspondence are: (a) a very general syntactic definition of the class of Sahlqvist formulas, which applies uniformly to each logical signature and is given purely in terms of the order-theoretic properties of the algebraic interpretations of the logical connectives; (b) the algorithm ALBA, which effectively computes first-order correspondents of input term-inequalities, and is guaranteed to succeed on a wide class of inequalities (the so-called inductive inequalities) which, like the Sahlqvist class, can be defined uniformly in each mentioned signature, and which properly and significantly extends the Sahlqvist class.&lt;br /&gt;
&lt;br /&gt;
In this talk, these technical tools will be illustrated in the setting of normal lattice expansions [9]. Time permitting, constructive canonicity will be also discussed [7, 3], as well as the epistemic interpretation of modalities on RS-frames [5].&lt;br /&gt;
 &lt;br /&gt;
References&lt;br /&gt;
&lt;br /&gt;
[1]  M. Bilkova, G. Greco, A. Palmigiano, A. Tzimoulis, and N. Wijnberg. The logic of resources and capabilities. In preparation, 2016.&lt;br /&gt;
&lt;br /&gt;
[2]  W. Conradie and A. Craig. Canonicity results for mu-calculi: an algorithmic approach. Journal of Logic and Computation, forthcoming. ArXiv preprint 1408.6367.&lt;br /&gt;
&lt;br /&gt;
[3]  W. Conradie, A. Craig, A. Palmigiano, and Z. Zhao. Constructive canonicity for lattice- based fixed point logics. Submitted. ArXiv preprint 1603.06547.&lt;br /&gt;
&lt;br /&gt;
[4]  W. Conradie, Y. Fomatati, A. Palmigiano, and S. Sourabh. Algorithmic correspondence for intuitionistic modal mu-calculus. Theoretical Computer Science, 564:30–62, 2015.&lt;br /&gt;
&lt;br /&gt;
[5]  W. Conradie, S. Frittella, A. Palmigiano, M. Piazzai, A. Tzimoulis, and N. Wijnberg. Categories: How I Learned to Stop Worrying and Love Two Sorts. Submitted. ArXiv preprint 1604.00777.&lt;br /&gt;
&lt;br /&gt;
[6]  W. Conradie, S. Ghilardi, and A. Palmigiano. Unified Correspondence. In A. Baltag and S. Smets, editors, Johan van Benthem on Logic and Information Dynamics, volume 5 of Outstanding Contributions to Logic, pages 933–975. Springer International Publishing, 2014.&lt;br /&gt;
&lt;br /&gt;
[7]  W. Conradie and A. Palmigiano. Constructive canonicity of inductive inequalities. Submitted. ArXiv preprint 1603.08341.&lt;br /&gt;
&lt;br /&gt;
[8]  W. Conradie and A. Palmigiano. Algorithmic correspondence and canonicity for distributive modal logic. Annals of Pure and Applied Logic, 163(3):338 – 376, 2012.&lt;br /&gt;
&lt;br /&gt;
[9]  W. Conradie and A. Palmigiano. Algorithmic correspondence and canonicity for non- distributive logics. Journal of Logic and Computation, forthcoming. ArXiv preprint 1603.08515.&lt;br /&gt;
&lt;br /&gt;
[10]  W. Conradie, A. Palmigiano, and S. Sourabh. Algebraic modal correspondence: Sahlqvist and beyond. Submitted.&lt;br /&gt;
&lt;br /&gt;
[11]  W. Conradie, A. Palmigiano, S. Sourabh, and Z. Zhao. Canonicity and relativized canonicity via pseudo-correspondence: an application of ALBA. Submitted. Arxiv preprint 1511.04271.&lt;br /&gt;
&lt;br /&gt;
[12]  W. Conradie, A. Palmigiano, and Z. Zhao. Sahlqvist via translation. Submitted. ArXiv preprint 1603.08220.&lt;br /&gt;
&lt;br /&gt;
[13]  W. Conradie and C. Robinson. On Sahlqvist theory for hybrid logic. Journal of Logic and Computation, DOI: 10.1093/logcom/exv045.&lt;br /&gt;
&lt;br /&gt;
[14]  S. Frittella, A. Palmigiano, and L. Santocanale. Dual characterizations for finite lattices via correspondence theory for monotone modal logic. Journal of Logic and Computation, forthcoming. ArXiv preprint 1408.1843.&lt;br /&gt;
&lt;br /&gt;
[15] G. Greco, M. Ma, A. Palmigiano, A. Tzimoulis, and Z. Zhao. Unified correspondence as a proof-theoretic tool. Journal of Logic and Computation, forthcoming. ArXiv preprint 1603.08204.&lt;br /&gt;
&lt;br /&gt;
[16] A. Palmigiano, S. Sourabh, and Z. Zhao. J ́onsson-style canonicity for ALBA-inequalities. Journal of Logic and Computation, DOI:10.1093/logcom/exv041.&lt;br /&gt;
&lt;br /&gt;
[17] A. Palmigiano, S. Sourabh, and Z. Zhao. Sahlqvist theory for impossible worlds. Journal of Logic and Computation, forthcoming. ArXiv preprint 1603.08202.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, April 18th at 2:30pm  (tea and cookies at 2:00pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Isabel M. Serrano (CSUF)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Geometry in the Dark Ages&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Isidore&#039;s Etymologies enjoyed a wide audience during the&lt;br /&gt;
medieval period. We examine the structure of mathematics, as it is&lt;br /&gt;
described in the Etymologies, and we discuss the sources on which&lt;br /&gt;
Isidore relied when he collected his etymological definitions. We&lt;br /&gt;
remark that for Isidore, mathematics is described as ``the science of&lt;br /&gt;
learning&#039;&#039;, and among his sources there have been the classical Greek&lt;br /&gt;
authors, most likely available in Boethius&#039; and Cassiodorus&#039; Latin&lt;br /&gt;
translations performed in the early 6th century. These translations&lt;br /&gt;
are today lost. That&#039;s why the authors writing in the middle ages had&lt;br /&gt;
to start from scratch in many of their investigations. We will&lt;br /&gt;
illustrate this idea with one example, namely the discovery of&lt;br /&gt;
curvature.  In a paper published in 1952, J. L. Coolidge points out&lt;br /&gt;
that ``the first writer to give a hint of the definition of curvature&lt;br /&gt;
was the fourteenth century writer Nicolas Oresme&amp;quot;. Coolidge writes&lt;br /&gt;
further: ``Oresme conceived the curvature of a circle as inversely&lt;br /&gt;
proportional to the radius; how did he find this out?&amp;quot;  Tractatus de&lt;br /&gt;
configurationibus qualitatum et motuum, written by Orseme sometime&lt;br /&gt;
between 1351 and 1355, contains the key.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, April 13th at 4pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Matt Pusey (Perimeter Institute)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;From the Kochen-Specker theorem to robust noncontextuality inequalities&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Published in 1967, the Kochen-Specker theorem shows that quantum&lt;br /&gt;
measurements do not simply reveal pre-existing values (satisfying a&lt;br /&gt;
natural requirement). A different result along these lines, Bell&#039;s&lt;br /&gt;
theorem, has had a much larger impact on quantum information. I will&lt;br /&gt;
argue that this is because Bell&#039;s theorem has a clear operational&lt;br /&gt;
meaning, independent of the quantum formalism and directly relevant to&lt;br /&gt;
experiment. This is the motivation for various attempts to&lt;br /&gt;
&amp;quot;operationalize&amp;quot; the Kochen-Specker theorem, and I will describe the&lt;br /&gt;
approach to this I find most compelling. To the extent that this&lt;br /&gt;
operationalization has succeeded, the audience should not require any&lt;br /&gt;
knowledge of quantum theory to understand it!&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, April 13th at 11am  (tea and cookies at 10:30am) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Luca Spada, University of Salerno, Italy&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A general algebraic approach to dualities&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk I will show how several dualities in mathematics e.g., the ones of Gelfand, Pontryagin, Stone, etc. can be seen as the manifestation of a general framework in which one develops the algebraic geometry of structures different from fields. This is a joint work with O. Caramello (University Paris Diderot) and V. Marra (University of Milan).&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, February 15th at 4:00pm (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mircea Pitici, Ph.D. in Mathematics Education, Cornell University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Interpreting Mathematics, Counterfactuals, and the Paradox of Reward&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will describe how he uses the vast literature on mathematics in my Writing in Mathematics seminar, how it relates to The Best Writing on Mathematics series I edit for Princeton, and how it matters to my teaching of mathematics and worldview.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Saturday, February 6th, 2016 in Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== 8th Annual CECAT Workshop in Pointfree Mathematics ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Hosted by the Center of Excellence in Computation, Algebra and Topology (CECAT)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Held at Chapman University, Von Neumann Hall (545 W. Palm Ave, Orange, CA 92866)&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Program&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
10.00am-10.50am &#039;&#039;&#039;Andrew Moshier (Chapman University)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Contexts that determine locales&amp;quot;&lt;br /&gt;
	&lt;br /&gt;
11:00 - 11:50am	&#039;&#039;&#039;Ales Pultr (Charles University, Prague)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;An aspect of scatteredness in frames&amp;quot;&lt;br /&gt;
	&lt;br /&gt;
12:00 - 12:50pm	&#039;&#039;&#039;Papiya Bhattacharjee (Pennsylvania State University, Erie)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Complemented frames&amp;quot;&lt;br /&gt;
	&lt;br /&gt;
2:00 - 2:50pm &#039;&#039;&#039;Peter Jipsen (Chapman University)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Duality for (residuated) lattices and correspondence theory&amp;quot;&lt;br /&gt;
	&lt;br /&gt;
3:00 - 3:50pm &#039;&#039;&#039;Joanne Walters-Wayland (CECAT)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&amp;quot;Smallest dense C and C*-quotients&amp;quot; &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, January 8th at 10:00am (tea and cookies at 9:30am) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Paula Cerejeiras, Departamento de Matematica,  Universidade de Aveiro, Portugal&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Applications of the monogenic signal processing to radiological images&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Medical ultrasonography imaging for nodule detection is a&lt;br /&gt;
non-invasive diagnostic test, which combines low cost, short&lt;br /&gt;
acquisition time, and sensitivity to the number and size of abnormal&lt;br /&gt;
nodules. However, a chief problem is that ultrasound images have low&lt;br /&gt;
contrast, making it hard for the experts to interpret and classify the&lt;br /&gt;
nodules detected. In this talk we discuss techniques based on the&lt;br /&gt;
concepts of monogenic signal which aims to enhance the edges of&lt;br /&gt;
abnormalities. Hereby, we use a combination of Riesz transforms and&lt;br /&gt;
monogenic curvelets in order to determine the phase and phase angle of&lt;br /&gt;
a given image. Riesz transforms have remarkable properties: they are&lt;br /&gt;
shift- and scale-invariant, preserve $L^2$ inner-product, and are&lt;br /&gt;
steerable. Based on this approach, one is able to determine size and&lt;br /&gt;
position of abnormalities present in images.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, January 7th at 4pm (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Uwe Kahler, Departamento de Matematica, Universidade de Aveiro, Portugal&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Compressed sensing for quaternionic representation of color images&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In the last decade a new paradigm has taken hold in&lt;br /&gt;
signal and image processing: compressed sensing. The possibility of&lt;br /&gt;
reconstructing a signal by only a few measurements under the condition&lt;br /&gt;
that the representation in a given basis or frame is sparse has&lt;br /&gt;
allowed to look at new methods and algorithms. Although sparsity&lt;br /&gt;
constraints are directly connected only with non-convex optimization&lt;br /&gt;
the uniqueness property shown by Candes, Rhomberg, and Tao allows the&lt;br /&gt;
application of simple convex algorithms, such as linear&lt;br /&gt;
programming. In parallel, during the last 15 years quaternion-valued&lt;br /&gt;
functions have been used to represent color images, in particular RGB&lt;br /&gt;
images. Hereby, representations using the discrete and continuous&lt;br /&gt;
quaternionic Fourier transforms play a particular important role. In&lt;br /&gt;
this talk we will show that it is possible to combine both approaches,&lt;br /&gt;
i.e. to use sparse sampling methods in the quaternionic representation&lt;br /&gt;
of color images. This is a priori not so evident due to the&lt;br /&gt;
non-commutative structure of the quaternions. For instance, it is not&lt;br /&gt;
clear that quaternionic sampling matrices will fulfil the RIP&lt;br /&gt;
condition as the traditional condition for compressed&lt;br /&gt;
sensing. Therefore, we intend to go back to the origins of compressed&lt;br /&gt;
sensing and follow the original approach by Rauhut to show that&lt;br /&gt;
quaternionic color images allow sparse reconstruction by means of an&lt;br /&gt;
$l_1$-minimization with high probability.&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2017&amp;diff=7</id>
		<title>MathCS Seminar 2017</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MathCS_Seminar_2017&amp;diff=7"/>
		<updated>2021-02-22T18:30:37Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot; == Fall 2017 ==  The seminar talks are in Von Neumann Hall VN 116 (545 W Palm Ave corner of W Palm Ave and railroad, Orange, CA 92866). Sometimes there will be a change of ve...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
== Fall 2017 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are in Von Neumann Hall VN 116 (545 W Palm Ave&lt;br /&gt;
corner of W Palm Ave and railroad, Orange, CA 92866).&lt;br /&gt;
Sometimes there will be a change of venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/discover/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Von Neumann Hall is Building 48 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, December 15th at 4:00pm  (Argyros Forum 212) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Andrew Jordan from University of Rochester, and Kater Murch from Washington University in St. Louis &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; The arrow of time in quantum mechanics&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; The question of why we perceive time moving from past to future is perplexing, especially in light of the fact that microscopic laws of motion are the same running forward or backwards in time. Some have thought that the answer to this puzzle may lay in quantum wavefunction collapse. We will discuss how recent experiments have shown that quantum measurement may not be as irreversible as commonly thought, and discuss deep questions relating to the flow of time and quantum physics. We will approach the topic from three points of view, that of the experimentalist, the quantum theorist, and the philosopher.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 14th at 4:00pm  (Argyros Forum 212) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Kater Murch from Washington University in St. Louis &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Measurement and control in superconducting qubits: from the quantum Zeno effect to quantum enhanced metrology &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; The quantum Zeno effect is a feature of measurement-driven quantum evolution where frequent measurement inhibits the decay of a quantum state. We will explore how the opposite effect; the anti-Zeno effect - where frequent measurement accelerates decay - can also emerge from frequent measurement. The emergence of one effect or the other elucidates the nature of quantum measurement and the role measurement plays in controlling quantum evolution. In a second experiment, we investigate how control over a single qubit can be used achieve a quantum speedup in the precision of frequency measurements, demonstrating a frequency sensitivity that improves as 1/T^2, where T is the duration of the experiment.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 14th at 1:00pm  (Argyros Forum 212) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Alyssa Ney from UC Davis&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Physics and Fundamentality &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; What justifies the allocation of funding to research in physics when many would argue research in the life and social sciences may have more immediate impact in transforming our world for the better? Many of the best justifications for such spending depend on the claim that physics enjoys a kind of special status vis-a-vis the other sciences, that physics or at least some branches of physics exhibit a form of fundamentality. The goal of this paper is to articulate a conception of fundamentality that can support such justifications. I argue that traditional conceptions of fundamentality in terms of dynamical or ontic completeness rest on mistaken assumptions about the nature and scope of physical explanations.&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, December 11th at 3:00pm  (tea and cookies at 2:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Gabriel Uzquiano (USC)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Cantorian arguments and the limits of thought &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Cantor’s theorem has often been thought to play a central role in Kaplan’s paradox for possible worlds semantics for intensional logic. Though we argue that Cantorian reasoning doesn&#039;t ultimately reach at the root of the problem, we suggest that some versions of the theorem may in fact be used as a heuristic for arriving at more informative results in the vicinity of Kaplan’s observation.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, December 1st at 3:00pm  (tea and cookies at 2:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Sarah Alexander and Nadiya Upegui, under the supervision of Prof. Peter Jipsen, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Partial Algebras and their Applications in Generalizations of Effect Algebras &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; A partial algebra is an algebra where at least one of its operations is partial. Like total algebras, partial algebras have their own concepts of homomorphisms, subalgebras, products, and congruences that account for partiality. An effect algebra is a partial algebra with a partial binary operation + that satisfies associativity and commutativity and induces a natural partial order with a bottom element 0 and a top element 1. It also contains a total unary operation ’, behaving in such a way that for all x there exists an x’ such that x+x’=1. Effect algebras can be generalized or specialized by adding or removing axioms to change their structure.  A much more general class related to effect algebras is the class of generalized pseudo-effect algebras (GPEAs).  GPEAs maintain associativity but are no longer commutative and need not have a unary operation ’ nor a single maximum element. It can be proven that the existence of the unary operation ’ in effect algebras in conjunction with some of the other axioms implies that + is cancellative and that 0 acts as an identity for +. These results cannot be deduced when working with GPEAs, so these properties are adopted in the GPEA axiomitization. This class of algebras also assumes a weaker notion of commutativity called conjugation. Taking a maximal element and adding it to or removing it from a GPEA creates another GPEA, and this result is the basis for a more efficient version of a Python program used to generate and enumerate these structures. Moreover, studying how  changes can be made to the structure of these classes of algebras makes them easier to understand and work with. We describe two such processes, unitization and totalization, which produce involutive residuated partially ordered monoids as the resulting structures.&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Conference: Tuesday to Sunday, November 14th to November 19th in Sandhu Conference Center ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mathematics, Signal Processing and Linear Systems:&lt;br /&gt;
New Problems and Directions&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Mathematics, Signal Processing and Linear Systems:&lt;br /&gt;
New Problems and Directions&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  For directions, schedule, and book of abstracts, see CECHA Webpage: [http://www.chapman.edu/scst/research/centers-of-excellence/cecha/index.aspx CECHA Webpage], or the Conference Webpage: [http://www1.chapman.edu/~mbvajiac/conferences/2017Conference.html Conference Webpage]&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== CECHA Workshop: Monday to Friday, November 6th to November 10th in VN Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor David Walnut, GMU&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Overview of Wavelet Theory,&lt;br /&gt;
With an eye on Superoscillations&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  For a schedule, see CECHA Webpage: [http://www.chapman.edu/scst/research/centers-of-excellence/cecha/index.aspx CECHA Webpage], or the Workshop Webpage: [http://www1.chapman.edu/~mbvajiac/conferences/2017Wavelet.html Wavelet Workhsop]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, November 3rd at 3:00pm  (tea and cookies at 2:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Marcy Robertson, Lecturer, School of Mathematics and Statistics, University of Melbourne&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; TBA&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; TBA&lt;br /&gt;
&lt;br /&gt;
Dr. Robertson&#039;s Webpage: [http://www.marcyrobertson.com Dr. Marcy Robertson]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 2nd at 4:00pm  (tea and cookies at 3:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Alain Yger (University of Bordeaux)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Transposing (p,q) - Calculus from the Complex to the Real setting, Applications&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  I will discuss in this talk the various presentations of the so-called theory of super (p,q) currents in the real setting (initiated by A. Lagerberg), together the relations it induces between the Fourier and Legendre-Fenchel dualities. Some applications towards number theory will be also discussed. It seems also that such ideas could be explored in other settings than the complex versus real one (for example quaternionic versus complex). I will in particular speak about the work of my student Robert Gualdi about getting closed formulaes for the logarithmic arithmetic height of an algebraic hypersurface in a toric variety; I will, if time permits,  present a certain number of tools that could be necessary in order to extend the codimension one result to the higher codimension case.&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 27th at 3:00pm  (tea and cookies at 2:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Ahmed Sebbar, University of Bordeaux &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Harmonic series, Harmonic sums and the Riemann Hypothesis&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; The harmonic series &lt;br /&gt;
$$1+\frac{1}{2}+ \frac{1}{3}+\frac{1}{4}+\cdots $$ is one the most known series. It diverges. &lt;br /&gt;
We comment on why the  series&lt;br /&gt;
$  \sum \frac{1}{p} $&lt;br /&gt;
(the sum is over all the primes) also diverges, however the sum $ \sum^{&#039;} \frac{1}{n} $ where the sum is over all the integers whose decimal expansion has no nines converges.&lt;br /&gt;
&lt;br /&gt;
In the second part of the talk we comment on a beautiful result of G. Robin (Limoges University) and J. Lagarias (University of Michigan) concerning the harmonic numbers&lt;br /&gt;
$\displaystyle H_n=  1+\frac{1}{2}+ \frac{1}{3}+\frac{1}{4}+\cdots+ \frac{1}{n} $&lt;br /&gt;
saying that if $\displaystyle \sigma_1(n)   $ is the sum of the divisors of $n$ and if&lt;br /&gt;
$\displaystyle  \sigma_1(n) \leq e^{H_n} \log H_n +H_n$&lt;br /&gt;
then the Riemann hypothesis is true. This is a very elementary formulation of a Millennium Problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, October 25th at 2:30pm  (Argyros Forum 208) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; George Csicsery, Visiting Documentary Filmmaker&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Finding the hook &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Filmmaker George Csicsery will discuss how he presents mathematics and mathematicians to lay audiences in a society with attention deficit disorder. Excepts from his films “N is a Number: A Portrait of Paul Erdös” (1993), “Julia Robinson and Hilbert’s Tenth Problem” (2008,” “Hard Problems” (2008), “Counting from Infinity” (2015), and “Navajo Math Circles” (2016), will be used to illustrate his main theme: that scientific ideas and math can be smuggled into a story when there is suspense, drama or genuine human interest at the foundation.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Saturday, October 21st at 3:00pm  (tea and cookies at 2:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mathematical Association of America Meeting&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; MAA Fall 2017 SoCal-Nevada Section Meeting &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; See the MAA Webpage: [http://sections.maa.org/socalnv/ SoCal-Nevada MAA Webpage]&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 20th at 3:00pm  (tea and cookies at 2:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Guillaume Jeremie Massas (UCI)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Constructive representations of Heyting algebras and semantics for Intuitionistic Predicate Logic&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Model Theory and the theory of Boolean algebras are two fruitful tools for investigating classical logic. Gödel’s completeness theorem and Stone’s representation theorem are regarded as cornerstones of each field respectively. The celebrated Rasiowa-Sikorski lemma allows one to construct term models out of ultrafilters on Boolean algebras, thus bridging the gap between the two: Rasiowa and Sikorski’s original proof relied on Stone’s representation theorem, and their lemma was used to give a purely algebraic proof of Gödel&#039;s completeness theorem. However the general methods behind this approach, because of their appeal to ultrafilters, are highly non-constructive.&lt;br /&gt;
Over the years, various generalizations of Stone’s theorem, of Gödel’s theorem, and of the Rasiowa-Sikorski lemma have taken either of the two orthogonal directions:&lt;br /&gt;
&lt;br /&gt;
generalizing the results to wider classes of logics and algebras (in particular to intuitionistic logic and Heyting algebras);&lt;br /&gt;
working under restricted forms of the axiom of choice and providing more constructive proofs.&lt;br /&gt;
In this talk, I will present how to combine the two programs. I will first provide more constructive versions of the Rasiowa-Sikorski Lemma and constructive representation theorems for distributive lattices and Heyting algebras. I will then combine those two results to define a constructive semantics for intuitionistic predicate logic, and show how it generalizes existing semantics.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 6th at 3:00pm  (tea and cookies at 2:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; David Wallace (USC)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;What is orthodox quantum mechanics?&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; What is called ``orthodox&#039;&#039; quantum mechanics, as presented in standard foundational discussions, relies on two substantive assumptions --- the projection postulate and the eigenvalue-eigenvector link --- that do not in fact play any part in practical applications of quantum mechanics. I argue for this conclusion on a number of grounds, but primarily on the grounds that the projection postulate fails correctly to account for repeated, continuous and unsharp measurements (all of which are standard in contemporary physics) and that the eigenvalue-eigenvector link implies that virtually all interesting properties are maximally indefinite pretty much always. I present an alternative way of conceptualising quantum mechanics that does a better job of representing quantum mechanics as it is actually used, and in particular that eliminates use of either the projection postulate or the eigenvalue-eigenvector link, and I reformulate the measurement problem within this new presentation of orthodoxy.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, September 29th at 3:00pm  (tea and cookies at 2:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Justin Dressel, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Watching a quantum system: How to continuously measure a superconducting qubit&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; It has recently become experimentally possible to monitor the energy levels of a superconducting transmon qubit continuously in time using microwave fields. Such measurements weakly perturb the qubit per unit time, lead to a competition between unitary Hamiltonian dynamics and non-unitary collapse dynamics. I review several subtleties about modeling this measurement process, and discuss several recent achievements made in collaboration with the Siddiqi laboratory at UC Berkeley. Topics include simultaneous measurements of multiple non-commuting observables, the active use of the quantum Zeno effect with a moving measurement basis for qubit control, and subtle aspects about the information content contained in the collected stochastic readout.&lt;br /&gt;
&lt;br /&gt;
Bio: &lt;br /&gt;
Justin Dressel received his Ph.D. in quantum physics from U Rochester in 2013, was a visiting researcher at RIKEN Wako-shi in Saitama, Japan in 2013, and was a postdoctoral scholar at UC Riverside between 2013-2015, after which he started as an Assistant Professor in Physics and Computational Science at Chapman University. He researches quantum information, computing, and foundations, which is a natural intersection point between physics, mathematics, and computer science. His recent research has focused on algebraic approaches to generalized quantum measurements, quantum computation with superconducting transmon quantum bits using circuit quantum electrodynamics, and Clifford algebraic approaches to relativistic field theory. Though the bulk of his work is theoretical in nature, he works closely with experimental teams whenever possible.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, September 22nd at 2:00pm  (tea and cookies at 1:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Ahmed Sebbar, University of Bordeaux&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Algebraic methods in analytic questions Second Example&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;The talk concerns some arithmetic and algebraic questions behind the paperfolding. One of its main objectives is to study the power series&lt;br /&gt;
\begin{equation}\label{new} \xi(z)= \sum_{n\geq 1} s_n z^n,\; \; |z|&amp;lt;1 &lt;br /&gt;
	 \end{equation}&lt;br /&gt;
	 where  $(s_n)$    is the paperfolding sequence defined by&lt;br /&gt;
	\[s_{2n}= s_n,\quad s_{2n+1}= (-1)^n, \quad n\in \mathbb{Z}_+  .\]&lt;br /&gt;
	 &lt;br /&gt;
This sequence arises as follows: A sheet of paper can be  folded once right half over left or left half over right. During the talk we explore the dynamics of a continued fraction related to $  \xi(z) $, and also a relation of the problem with the modularity theorem(formerly the Taniyama-Shimura-Weil conjecture). &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 14th at 4:15pm  (tea and cookies at 3:45pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Ahmed Sebbar, University of Bordeaux&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Algebraic methods in analytic questions First Example&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; For a fixed $x$,  we consider the two functions in $h$, analytic near the origin:&lt;br /&gt;
\[\phi(h)= \log\left(1+3hx-h^3\right)†= \sum_{n=0}^{\infty} P_n(x) h^n†\]&lt;br /&gt;
and&lt;br /&gt;
\[\psi(h)= \log\left(1+3h^2x-h^3\right)†= \sum_{n=0}^{\infty} Q_n(x) h^n†\]&lt;br /&gt;
with polynomials in $x$, $P_n(x)$ and $Q_n(x)$.  We wonder whether there is a relationship between $P_n(x)$ and $Q_n(x)$. The positive answer to this question depends on the peculiarities of the two quadratic extensions $\mathbb{Q}(i)   $ and $\mathbb{Q}(\rho), \rho= \frac{-1+i\sqrt{3}}{2}  $ and their relation with theory of complex multiplication for elliptic curves (Lemniscatomic and anharmonic cases). We give a brief history of Class Field Theory, Clausen hypergeometric function and the answer to the question. We show  that the polynomials $P_n(x)$ and $Q_n(x)$ have some divisibillity propriety, similar to the one for Lucas sequences.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 7th at 4:15pm  (tea and cookies at 3:45pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Imanol Mozo Carollo, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;On subspaces of pointfree bitopological spaces and their smallest dense subspace&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; With the purpose of finding a Stone duality for bitopological spaces, A. Jung and A. Moshier introduced in the category of d-frames in which objects are structures that comprise two frames, thought of as lattices of open sets, and two relations that connect both frames, as abstractions of the covering and disjointness relation. The aim of this talk is to explore an approach to the notion of parts of a space in this pointfree bitopological setting.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, September 1st at 5:00pm  (tea and cookies at 4:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Razieh Mohseninia, Sharif University of Technology&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Topological quantum computation and the stability of topological memories&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Quantum computers are necessary to simulate quantum systems. The fragility of qubits in presence of decoherence and external noise is the biggest obstacle in realizing a quantum computer. To overcome such problems, topological quantum computation has been introduced by Kitaev that combines the main quantum feature of the quantum world, namely, superposition of states, with the robustness of classical bits which is the result of a macroscopic number of very small entities, comprising each bit. In this way, topological features which are robust against local perturbations are used for storing information. It is well-known that the $Z_3$ Kitaev model can be used to perform universal quantum computation. Due to unwanted interactions in the system, perturbations may be added to a possible realization of the system. In the first part of my talk, stability of the $Z_3$ Kitaev model in the presence of external perturbations in the form of Potts interaction is studied. Our study relies on two high-order series expansions based on continuous unitary transformations in the limits of small and large Potts couplings as well as mean-field approximation. Our analysis reveals that the topological phase of the $Z_3$ Kitaev model breaks down to the Potts model through a first-order phase transition. Another example of topological memories is the Topological Color Code, which in 2 dimensions can be used for implementing the Clifford group in a fully topological and transversal manner. In the second part of my talk, I study thermal stability of this model in presence of a thermal bath. The auto-correlation functions of the observables are used as a figure of merit for the thermal stability. I show that all of the observables auto-correlation functions decay exponentially in time. By finding a lower bound on the decay rate, which is a constant independent of the system size, I show that the Topological Color Code is unstable against thermal fluctuations from the bath at finite temperature, even though it is stable at $T=0$ against local quantum perturbations.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Summer 2017 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are in Von Neumann Hall VN 116 (545 W Palm Ave&lt;br /&gt;
corner of W Palm Ave and railroad, Orange, CA 92866).&lt;br /&gt;
Sometimes there will be a change of venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/discover/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Von Neumann Hall is Building 38 on the&lt;br /&gt;
[http://www.chapman.edu/discover/_files/CU_CampusMap2012-13-2.pdf&lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, July 26th at 4:00pm  (tea and cookies at 3:30pm, in VN) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Angelyn R. Lao, Department of Mathematics, De La Salle University, Philippines&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Systems Approaches in Making Sense of Data and Providing Meaning to Biological Models&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  Systems biology is an interdisciplinary approach that aims at understanding the dynamic interactions between components of biological system. It is also an approach by which biological questions are addressed through integrating experiments in iterative cycles with computational modelling, simulation and theory. This approach is best applied when there is synergistic usage of the models and data. As such that the models established are meaningful and make sense to the collected data. Depending on the types, quality, and amount of data and the purpose of the model, the kind of modeling approaches will also vary. Modelling is not the final goal, but is a tool to increase understanding of the system, to develop more directed experiments and finally allow predictions.&lt;br /&gt;
Why model? By modeling, we aim to guide data collection, discover new questions, formulate hypotheses, and reveal simplicity in complexity. There are different ways of modeling. One of the most popular approaches is the use of ordinary differential equations (ODE) to model the interactome among the components of a system. Other modeling approaches include stochastic modeling, Boolean modeling, agent-based modeling and etc.&lt;br /&gt;
Systems biology is a cross talk between different disciplines. It requires interdisciplinary collaboration between fields like biology, physics, computer science and engineering, with the goal of having a deeper insight of the functional bases of life. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2017 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are in Von Neumann Hall VN 116 (545 W Palm Ave&lt;br /&gt;
corner of W Palm Ave and railroad, Orange, CA 92866).&lt;br /&gt;
Sometimes there will be a change of venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/discover/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Von Neumann Hall is Building 38 on the&lt;br /&gt;
[http://www.chapman.edu/discover/_files/CU_CampusMap2012-13-2.pdf&lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!--&#039;&#039;&#039;Note:&#039;&#039;&#039; This semester we will (for now) start talks &#039;&#039;&#039;at 1:15&lt;br /&gt;
pm&#039;&#039;&#039;.  From 12:45 pm to 1:15 pm is time for refreshments and&lt;br /&gt;
interesting conversations with the speaker, so consider coming a bit&lt;br /&gt;
early.--&amp;gt;&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Upcoming Talks and Workshops ==&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, May 26th at 2:00pm  (tea and cookies at 1:30pm, in AF 212) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Eleanor Rieffel, Quantum Artificial Intelligence Laboratory, NASA Ames Research Center&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A NASA Perspective on Quantum Computing: Opportunities and Challenges&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  The success of the abstract model of computation, in terms of bits, logical operations, algorithms, and programming language constructs makes it easy to forget that computation is a physical process. Our cherished notions of computation and information are grounded in classical mechanics, but the physics of our universe is quantum. A natural question to ask is how computation would change if we adopted a quantum mechanical, instead of a classical mechanical, model of computation.&lt;br /&gt;
In the early 80s, Richard Feynman, Yuri Manin, and others recognized that certain quantum effect could not be simulated efficiently on conventional computers. This observation led researchers to speculate that perhaps such quantum effect could be used to speed up computation more generally. Slowly, a new picture of computation arose, one that gave rise to a variety of faster algorithms, novel cryptographic mechanisms, and alternative methods of communication. &lt;br /&gt;
&lt;br /&gt;
For most computational problems, however, it is currently unknown whether quantum algorithms can provide an advantage, and if so by how much, or how to design quantum algorithms that realize such advantages. Many of the most challenging computational problems arising in the practical world are tackled today by heuristic algorithms that have not been mathematically proven to outperform other approaches but have been shown to be effective empirically. While quantum heuristic algorithms have been proposed, empirical testing becomes possible only as quantum computation hardware is built. The next decade promises to be exciting emerging hardware makes  empirical testing of quantum heuristic algorithms more and more feasible.&lt;br /&gt;
&lt;br /&gt;
In the first part of the talk, I will introduce key concepts underlying quantum computing and correct common misconceptions. In the second half of the talk, I will discuss applications of quantum computing, known advantages and limitations, including work at NASA on quantum heuristics. I will briefly touch on the current state-of-the-art in building quantum computers, quantum error correction and fault tolerance, and the many open research questions that remain.  &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Bio: Eleanor G. Rieffel leads the Quantum Artificial Intelligence Laboratory&lt;br /&gt;
at the NASA Ames Research Center. She joined NASA Ames Research Center in 2012 to work on their expanding quantum computing effort, after working at FXPAL where she performed research in diverse fields including quantum computation, applied cryptography, image-based geometric reconstruction of 3D scenes, bioinformatics, video surveillance, and automated control code generation for modular robotics.&lt;br /&gt;
Her research interests include quantum heuristics, evaluation and utilization of near-term quantum hardware, fundamental resources for quantum computation, quantum error suppression, and applications for quantum computing. She received her Ph.D. in mathematics from the University of California, Los Angeles. She is best known for her 2011 book Quantum Computing: A Gentle Introduction with coauthor Wolfgang Polak and published by MIT press.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, May 19th at 2:00pm  (tea and cookies at 1:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Miguel Navascues, IQOQI Vienna&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Random variables, entanglement and nonlocality in infinite translation-invariant systems&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  We consider the problem of certifying entanglement and nonlocality in one-dimensional translation-invariant (TI) infinite systems when just averaged near-neighbor correlators are available. Exploiting the triviality of the marginal problem for 1D TI distributions, we arrive at a practical characterization of the near-neighbor density matrices of multi-separable TI quantum states. This allows us, e.g., to identify a family of separable two-qubit states which only admit entangled TI extensions. For nonlocality detection, we show that, when viewed as a vector in R^n, the set of boxes admitting an infinite TI classical extension forms a polytope, i.e., a convex set defined by a finite number of linear inequalities. Using DMRG, we prove that some of these inequalities can be violated by distant parties conducting identical measurements on an infinite TI quantum state. Both our entanglement witnesses and our Bell inequalities can be used to certifyentanglement and nonlocality in large spin chains (namely, finite, and not TI chains) via neutron scattering. &lt;br /&gt;
&lt;br /&gt;
Our attempts at generalizing our results to TI systems in 2D and 3D lead us to the virtually unexplored problem of characterizing the marginal distributions of infinite TI systems in higher dimensions. In this regard, we show that, for random variables which can only take a small number of possible values (namely, bits and trits), the set of nearest (and next-to-nearest) neighbor distributions admitting a 2D TI infinite extension forms a polytope. This allows us to compute exactly the ground state energy per site of any classical nearest-neighbor Ising-type TI Hamiltonian in the infinite square or triangular lattice. Remarkably, some of these results also hold in 3D. In contrast, when the cardinality of the set of possible values grows (but remaining finite), we show that the marginal nearest-neighbor distributions of 2D TI systems are not described by a polytope or even a semi-algebraic set. Moreover, the problem of computing the exact ground state energy per site of arbitrary 2D TI Hamiltonians is undecidable.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, May 17th at 2:30pm  (tea and cookies at 2:00pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Daniel Alpay, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Non-commutative Brownian Motion and a New Class of Topological Algebras&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  We study a family of free stochastic processes whose covariance kernels K may be derived as a transform of a tempered measure σ. These processes arise, for example, in consideration non-commutative analysis involving free probability. Hence our use of semi-circle distributions, as opposed to Gaussians. In this setting we find an orthonormal bases in the corresponding non-commutative L2 of sample-space. We define a stochastic integral for our family of free processes.  &lt;br /&gt;
&lt;br /&gt;
Joint work with Palle Jorgensen and Guy Salomon&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, May 12th at 2:00pm  (tea and cookies at 1:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Abhijit Banerjee, Krishnath College, Berhampore, Calcutta&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Mathematical Formulations of PT Symmetric Bicomplex Quantum Mechanics&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  With a view to obtaining further insight into the nature of eigenvalues and eigenfunctions of a stationary state one-dimensional Schrodinger equation corresponding to a PT-symmetric  bicomplex Hamiltonian H we present the mathematical formulations of an analogous version of the Schrodinger equation. Since in such a setting three different types of conjugates of bicomplex numbers appear, each is found to define, in a natural way, a separate class of time reversal operator. However, the induced parity (P)-time (T)-symmetric models turn out to be mutually incompatible, except for two of them which could be chosen uniquely. The later models are then explored by working within an extended phase space. Applications to the problems of harmonic oscillator and isotonic oscillator are considered and many new interesting properties are uncovered for the new types of PT symmetries.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, May 10th at 1:00pm  (tea and cookies at 2:00pm, after the seminar) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Purbita Jana, Department of Pure Mathematics, University of Calcutta, India &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Graded Frame and related Mathematical structures&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  In this talk the main focus will be the notion of graded frame and its connection with graded fuzzy topological system, fuzzy topological&lt;br /&gt;
space with graded inclusion and fuzzy geometric logic with graded consequence. As a ground work we will first discuss the topic of Topology&lt;br /&gt;
via Logic&amp;quot; written by S. Vickers, where the notion of topological system and its usefulness in duality theory as well as study of topological&lt;br /&gt;
space via logic is mentioned. Generalizing Vickers&#039;s work step by step we will reach to the concept of graded frame, related structures and&lt;br /&gt;
their utilities.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, May 5th at 2:00pm  (tea and cookies at 1:30pm) in collaboration with the Philosophy Department===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Alberto Naibo, Sorbonne&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Harmony, Stability, and Identity: An intensional account in proof-theoretic semantics&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  Proof-theoretic semantics are usually conceived in opposition to truth-theoretic semantics. In truth-theoretic semantics, truth is considered as a primitive (non-analyzed) notion, and meaning is then explained in terms of it. On the other hand, in proof-theoretic semantics, meaning is explained in terms of (our) inferential abilities, and truth is then explained in terms of proofs. In order to avoid any possible trivialization of proof-theoretic semantics — boiling it down to truth-theoretic semantics — an intensional, rather than an extensional approach, should be adopted. In particular, the semantic value of a sentence A should not be defined in terms of the simple existence of a proof of A, but in terms of the way in which A is proved, i.e. in terms of the inferential structure of proof of A. In order to specify this structure some properties are asked to be satisfied. The most known of them is the property of harmony, which corresponds to the reduction of local complexity peaks (detours) in a proof. However, as Dummett claims, this property is “an excessively modest demand”, and it should be complemented by another property, that of stability. It will be shown that this property can be captured by a more fundamental operation, that of expansion, allowing one to generate local complexity riffs within a proof. Even if this operation could seem very natural to add, it will be shown in fact how it is destructive for the intensional account proper to proof-theoretic semantics. In particular, when this operation of expansion is used in presence of negation and identity, it leads to the collapse of the set of proofs of negative and identity sentences, respectively. Finally, the case of identity is analyzed in details in the framework of Martin-Löf’s type theory. It is shown, in particular, that a possible way of avoiding the collapse between identity proofs can be found in the works of M. Hoffman and T. Streicher, where the operation of expansion is lifted from the level of proof-objects to the level of the sentences which speak about these proof-objects.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, May 5th at 12:00pm  (tea and cookies at 1:30pm) in collaboration with the Philosophy Department===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Pierre Wagner, Sorbonne&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The normative character of logic and pluralism&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  Logic is traditionally regarded as normative and the justification of such a view has often been that the laws of logic do not have any descriptive content: they do not describe how we do think but provide prescriptions about how we ought to think. This presupposes that logic is about thought or at least that it has something to do with reasoning. A philosophical contemporary debate about the normativity of logic questions the exact nature of the connection between logic and thought, and tries to assess the reasons for regarding logic as having a normative character. In this talk, we shall discuss this point and its essential connection with pluralism in logic.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, April 21st at 2:00pm  (tea and cookies at 1:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor H. Turgay Kaptanoglu, Department of Mathematics, Bilkent University, Ankara&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Precise Inclusion Relations Among Bergman-Besov and Bloch-Lipschitz Spaces and H^\infty on the Unit Ball of C^n&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  We describe exactly and fully which of the spaces of holomorphic functions in the title are included in which others.  We provide either new results or new proofs.  More importantly, we construct explicit functions in each space that show our relations are strict and best possible.&lt;br /&gt;
&lt;br /&gt;
Joint work with A. Ersin Ureyen of Anadolu University, Eskisehir, Turkey&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, April 11th at 1:00pm  (tea and cookies at 12:30pm), please note the change in date/time ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor David Shoikhet, Holon Institute of Technology, The Technion Institute of Technology of Israel&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Old and New in Complex Dynamical Systems&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  Historically, complex dynamics and geometrical function theory have been intensively developed from the beginning of the twentieth century. They provide the foundations for broad areas of mathematics. In the last fifty years the theory of holomorphic mappings on complex spaces has been studied by many mathematicians with many applications to nonlinear analysis, functional analysis, differential equations, classical and quantum mechanics. The laws of dynamics are usually presented as equations of motion which are written in the abstract form of a dynamical system: ((dx)/(dt))+f(x)=0, where x is a variable describing the state of the system under study, and f is a vector-function of x. The study of such systems when f is a monotone or an accretive (generally nonlinear) operator on the underlying space has recently been the subject of much research by analysts working on quite a variety of interesting topics, including boundary value problems, integral equations and evolution problems.&lt;br /&gt;
In this talk we give a brief description of the classical statements which combine the celebrated Julia Theorem of 1920, Carathéodory&#039;s contribution in 1929 and Wolff&#039;s boundary version of the Schwarz Lemma of 1926 with their modern interpretations for discrete and continuous semigroups of hyperbolically non-expansive mappings in Hilbert spaces. We also present flow-invariance conditions for holomorphic and hyperbolically monotone mappings.&lt;br /&gt;
Finally, we study the asymptotic behavior of one-parameter continuous semigroups (flows) of holomorphic mappings. We present angular characteristics of the flows trajectories at their Denjoy-Wolff points, as well as at their regular repelling points (whenever they exist). This enables us by using linearization models in the spirit of functional Schroeder&#039;s and Abel&#039;s equations and eigen-value problems for composition operators to establish new rigidity properties of holomorphic generators which cover the famous Burns-Krantz Theorem and to solve a Nevanlinna-Pick type boundary interpolation problem for generators.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, April 7th at 2:00pm  (tea and cookies at 1:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Imanol Mozo, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The unit circle in pointfree topology&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  Pointfree topology is an lattice-theoretic approach to topology that takes abstract lattices of open sets as the primitive notion. This approach is motivated by the fact that the lattice of open sets of a topological space contain almost all the information. Indeed, some lattices, namely, frames, are sufficiently similar to lattices of open sets of topological spaces in order to be considered as generalized spaces [5].&lt;br /&gt;
One of the main differences between pointfree topology and classical topology is that the category of frames is algebraic, while the dual of the category of topological spaces is not. Consequently, we can present its objects by generators and relations, as in an algebraic fashion. This is a very useful tool that was used by Joyal in order to introduce the pointfree counterpart of the real line [3], which was later studied by Banaschewski in [1]. Besides, this procedure offers a natural way to introduce variants by modifying the set of generators or the defining relations. For instance, one has the frame of extended reals and the lattice of extended real functions studied in [2], and the frame of partial reals and the lattice of continuous partial real functions introduced in [4] which arose naturally in the construction of the Dedekind completion of the lattice of continuous real functions on a frame.&lt;br /&gt;
In this talk, after a brief introduction to pointfree topology, we will discuss how the topology of the unit circle fits in this family of frames.&lt;br /&gt;
&lt;br /&gt;
[1] B. Banaschewski, The real numbers in pointfree topology, Textos de Matemática vol. 12, Departamento de Matemática da Universidade de Coimbra (1997).&lt;br /&gt;
[2] B. Banaschewski, J. Gutiérrez García, J. Picado, Extended real functions in pointfree topology, J. Pure Appl. Algebra 216 (2012), 905–922.&lt;br /&gt;
[3] A. Joyal, Nouveaux fondaments de l’analyse. Lectures Montréal 1973 and 1974 (unpublished).971), 161–167.&lt;br /&gt;
[4] I. Mozo Carollo, J. Gutiérrez García and J. Picado, On the Dedekind completion of function rings, Forum Math. 27 (2015), 2551 -2585.&lt;br /&gt;
[5] J. Picado and A. Pultr, Frames and locales: Topology without points, Frontiers in Mathematics, vol. 28, Springer, Basel (2012).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, March 31st at 2:00pm  (tea and cookies at 1:30pm) join with the Philosophy Department===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor John Mumma, CalState San Bernardino&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Lewis&#039;s infinite regress, mathematical proof, and the act of diagramming  &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  In &#039;What the Tortoise Said to Achilles.&#039;  Carroll shows how an infinite regress can be generated from the demand that all premises in a deductive inference be made explicit.  In my talk I discuss the connection of the regress to the question of how mathematical proofs are accepted as proofs.  A mathematical proof does not succeed unless it can be seen how acceptance of its premises force acceptance of its conclusion.  Carroll&#039;s piece can be understood, I argue, as illuminating the difficulties in providing a satisfactory account of this seeing.  I then focus on a restricted class of elementary geometric inferences, and explore whether the act of diagramming them resolves (for this restricted class) the general difficulties Carroll&#039;s piece raises.        &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, March 24th at 2:00pm  (tea and cookies at 1:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Dan Volok, Kansas State University, Department of Mathematics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Non-stationary point evaluation in the multiscale setting&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  It was demonstrated by D. Alpay, P. Dewilde and H. Dym that the Hilbert space of triangular Hilbert-Schmidt operators can be equipped with a reproducing kernel structure quite similar to that of the classical Hardy space of the unit disk. This fact has many applications in the theory of non-stationary dissipative systems. It turns out that a multivariate generalization of Alpay-Dewilde-Dym reproducing kernel Hilbert space arises naturally in the setting of linear systems indexed by homogeneous trees, as introduced by A. Benveniste, R. Nikoukhah and A. Willsky. &lt;br /&gt;
&lt;br /&gt;
This talk is based on joint work with D. Alpay and A. Dijksma.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, March 17th at 2:00pm  (tea and cookies at 1:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Palle Jorgensen, University of Iowa, Department of Mathematics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Markov processes, endomorphisms, and measurable dynamics&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  The structures of positive operators, endomorphisms, transfer operators, measurable partitions, and Markov processes arise in both pure and applied mathematics. The talk offers unified setting, as well as new applications. The general setting is that of dynamics in Borel measure spaces and Markov fields. Hence the corresponding linear structures to be studied are infinite-dimensional. Nonetheless, we prove a number of analogues of the more familiar finite-dimensional settings, for example, the Perron-Frobenius theorem in the case of positive matrices, and the corresponding Markov chains.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, March 10th at 2:00pm  (tea and cookies at 1:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Howard Wiseman, Griffith University, and the Centre for Quantum Computation and Communication Technology&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;What is Quantum Markovianity?&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  Markovianity versus non-Markovianity is a well-established distinction for classical systems. The same cannot be said for quantum systems. Different communities and individuals use “quantum Markovianity” to mean very different things. We argue that, to avoid confusion, it is best to avoid attributing that term any definite meaning at this stage. However, that does not mean that there is nothing to say about Markovianity for open quantum systens. We discuss a large number of concepts that have been, or could logically be, used to define quantum (non-)Markovianity, and prove hierarchical relations between them. Some are existing concepts, including “factorisation”, “quantum regression formula”, “divisibility”, and “Lindblad”. Others we introduce, including “past-future independence”, and “composability”. We also prove relations between these and other properties of interest for open quantum systems, such as the applicability of dynamical decoupling to preserve quantum information, the existence of (quantum) information backflow from the environment, and the physical reality of stochastic pure-state trajectories.  Finally, we discuss in which concept the closest analogue of classical Markovianity lies.&lt;br /&gt;
&lt;br /&gt;
Joint work with: Li (Kenny) Li, and Michael Hall&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, March 7th at 5:30pm  (tea and cookies at 5:00pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Giuseppe Longo, CNRS, CREA, École Polytechnique, et CIRPHLES, ENS, Paris&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Structuralist Roots of Mathematical Understanding Reconsidered: Poincaré’s heritage&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  The theological origin of the physicomathematical spaces; the geometrization of time&lt;br /&gt;
Abstract: There is no mathematical plane nor space in Euclid&#039;s geometry. Lines are traced, extended, intersected on a plane, an “apeiron” (it has no boundary), which is “practiced” but not mathematized. These lines have no thickness, they intersect in a point, that is a sign (“semeion”); they are objects of a mythical, ideal realm. Infinity is only potential: lines in the plane or endless sequences of numbers can be extended with no limit. Actual infinity will be fully conceptualized much later, in the theological debate of late middle age, as an attribute of God. How actual infinity relates to or how can it be represented in the finite? The Renaissance Italian painters will show that this is possible: the projective limit of the newly invented linear perspective, first used in XIV century paintings of the Annonciation, shows the infinite in the finite and joins the infinity of God to the bodily, three dimensional presence of a human being, the Madonna. We will critically analyze paintings from Giotto to Piero della Francesca that show this joint invention of actual infinity and of mathematical spaces, which allows as well the expression of a new, corporeal humanity. Later, this theological invention will become the mathematics of Descartes&#039; and Desargues&#039; spaces, the science of Newton&#039;s infinities. In the XIX century, physics will extend this mystical creation of infinite space and time to the mathematical “phase space” of its new scientific rigor, based on an increasing mathematical unity of space and time.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, February 17th at 2pm  (tea and cookies at 1:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Andrew Jordan, University of Rochester&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Postselection, Superconductors, and Quantum Information in Black Holes&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  This talk will demonstrate how the quantum information entering black holes is analogous to quantum information entering a superconductor.  The correspondence maps the interior of a black hole to a superconductor, and the exterior of the black hole to a normal metal.  We show that the metal-superconductor interface can be thought of as an event horizon: The proximity effect in superconductor-metal interfaces (where Cooper pairs tend to form in the normal metal) is analogous to electron-positron creation at the event horizon in black-holes, which gives rise to Hawking radiation.  Existing popular ideas of preserving quantum information entering black holes – the Preskill informational mirror, and the Horowitz-Maldacena mechanism for black-hole evaporation (which necessitates a unique final state for the black-hole), can be exactly incarnated as quantum information swapping or transfer using Andreev reflection processes.  I will present mesoscopic physics analogs to wormholes and time loops using postselection on the superconducting ground state of a condensed gas of Cooper pairs – and conjecture that the BCS ground state also describes the final quantum state of a black hole.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, February 15th at noon  (tea and cookies at 11:30am) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Gerhard Heinzmann, Université de Lorraine/CNRS &amp;amp; Archives Henri-Poincaré (UMR 7117), Nancy, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Structuralist Roots of Mathematical Understanding Reconsidered: Poincaré’s heritage&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  This paper proposes a reconsideration of mathematical structuralism. It adopts the &amp;quot;practical turn&amp;quot; that owes much to Henri Poincare. By reconsstructing his group theoretic approach of geometry, it seems possible to explain the main difficulty of modern structuralism, inaugurated by the French collective Bourbaki around the middle of the XXth century: the unclear ontological status of ‘structures’ and ‘places’. &lt;br /&gt;
For Poincaré, the formation of the group concept - a &#039;universal&#039; - is suggested by a specific system of stipulated sensations and, read as a relational set, the general group concept constitutes a model of the group axioms, which are exemplified (in the Goodmanien sense) by the sensation system. In other words, the shape created in the mind leads to a particular type of platonistic universals, which is a model (in the model theoretical sens) of the mathematical axiom system of the displacement group. The elements of the displacement group are independent and complet entities with respect to the axiom system of the group. But, by analysing the subgroups of the displacement group (common to geometries with constant curvature) one transformes the variables of the axiom system in ‘places’ whose ‘objects’ lack any ontological commitment except with respect to the specified axioms. &lt;br /&gt;
In general, a structure R is interpreted as a second order relation which is exemplified by (axiomatic) systems according to the pragmatic maxim of Charles Sanders Peirce.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, February 10th at 2pm  (tea and cookies at 1:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Natalie Paquette, Burke Fellow, Walter Burke Institute of Theoretical Physics at CalTech&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Moonshine: Old and New&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  The whimsically-named Monstrous Moonshine is a mathematical story born in the late 1970&#039;s, which provided startling connections between two fundamental objects in mathematics. It eventually found an explanatory framework in the physics of an exotic solution of string theory. Starting in 2010, moonshine phenomena reemerged in the context of a more conceptually and physically central corner of string theory. In this talk, I will survey both old and new developments in moonshine with an emphasis on their physical meanings, and highlight the as-yet mysterious connections between the many beautiful mathematical and physical objects at play. I will summarize recent work clarifying these moonshine structures in string theory.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, February 6th to Saturday, February 11 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;9th ANNUAL CECAT WORKSHOP IN POINTFREE MATHEMATICS&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;9th ANNUAL CECAT WORKSHOP IN POINTFREE MATHEMATICS&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Talks in Von Neumann Hall throughout the week.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, February 3rd at 4pm  (tea and cookies at 3:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Alberto Fernandez-Nieves, Professor of soft condensed matter physics at Georgia Tech&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Active nematics on tori&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; We will discuss our recent results with active nematics on toroidal surfaces. We will first&lt;br /&gt;
briefly describe how we generate and stabilize an otherwise unstable toroidal drop. We&lt;br /&gt;
use these droplets to study the interplay between nematic order, geometry and&lt;br /&gt;
topology. We find defect unbinding and defect-curvature coupling, consistent with&lt;br /&gt;
theoretical expectations for inactive ordered materials arranged on the surface a torus.&lt;br /&gt;
In our experiments, however, the number of defects is far larger than what one would&lt;br /&gt;
expect for inactive nematics. This brings about interesting analogies with what we could&lt;br /&gt;
call the high-temperature limit of inactive nematic liquid crystals.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, January 9th at 4pm  (tea and cookies at 2:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Uwe Kahler, Universidade de Aveiro, Portugal&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Riemann-Hilbert problems in Clifford analysis&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  One of the classic topics in Complex Analysis is the question of boundary value problems for holomorphic functions, so-called Riemann-Hilbert problems. This is not only for pure inner mathematical reasons, but also for its many applications, ranging from Materials with Memory, Inverse Scattering problems, to Statistical Physics. Due to its easy applicability since the beginning the question of Riemann-Hilbert problems in higher dimensions has caught the interest of many mathematicians. But there are essential differences between the two-dimensional case and the higher-dimensional case. In this talk we will present the general framework and highlight the difference between the two cases. Several open problems in the framework of hypercomplex analysis are being discussed.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, January 9th at 3pm  (tea and cookies at 2:30pm) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Professor Paula Cerejeiras, Universidade de Aveiro, Portugal&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Applications of Monogenic Wavelets to Image Processing &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  We present an overview of applications of Clifford analysis to problems in image processing. As Clifford analysis techniques are strongly linked to the geometry of the underlying space it has generate an increasing interest in its applications to analytic signals in the last decade. Motivated by the problem of edge detection we introduce the concept of monogenic signal and discuss appropriate wavelet frames for it. We will finalize with a discussion on the group theoretical approach.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar_2018&amp;diff=6</id>
		<title>MPC Seminar 2018</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar_2018&amp;diff=6"/>
		<updated>2021-02-22T18:29:50Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot; == Fall 2018 ==  Seminar organizer: Mihaela Vajiac  The seminar talks are held in Keck Center for Science and Engineering, KC 171 (Center St. Orange, CA 92866, intersection o...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
== Fall 2018 ==&lt;br /&gt;
&lt;br /&gt;
Seminar organizer: Mihaela Vajiac&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in Keck Center for Science and Engineering, KC 171 (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.).&lt;br /&gt;
Sometimes there will be a change of venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/discover/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, December 6th 2018 at 4:15pm, in Keck 171, tea and cookies at 3:45pm in Keck 370===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Bogdan Suceava, CSUF &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Strictly Convex Hypersurfaces Satisfying Weingarten-Type Inequalities &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Linear Weingarten surfaces in three-dimensional ambient space satisfy a relation between mean curvature and Gaussian&lt;br /&gt;
curvature: aH^2+bK=c. We investigate whether for hypersurfaces invariant to inversions of dimensions 3, 4, and 5, there are&lt;br /&gt;
curvature inequalities similar to the classical Weingarten condition. We also consider the globalization of these pointwise&lt;br /&gt;
inequalities. This question is suggested by the investigations of Bang-Yen Chen’s fundamental inequalities, as we reflect&lt;br /&gt;
on the geometric interpretations of these relations.Additionally, we plan to discuss other related inequalities, investigated in recent&lt;br /&gt;
works written with Mihaela Vajiac, Nicholas Brubaker, and Leonard Giugiuc, respectively.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, November 30th 2018 at 2:00pm, in Keck 171, tea and cookies at 1:30pm in Keck 370===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Apostolos Tzimoulis, Chapman University postdoc &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Proof theory and algebraic semantics for predicate logics &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; I will start with recasting classical first-order logic in an algebraic and proof-theoretic framework based on Lawvere&#039;s theory of hyperdoctrines. Then I will discuss the problem of obtaining general semantics for predicate non-classical logics, provide some examples, and argue that algebraic and proof-theoretic insight can help us understand better and solve this problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 29th 2018 at 4:15pm, in Keck 171, tea and cookies at 3:45pm in Keck 370===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Sabine Hossenfelder (Frankfurt Institute for Advanced Studies)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Do women get fewer citations than men? &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; I will talk about the results of a citation analysis on&lt;br /&gt;
publication data from the arXiv and inspire in which we explored gender&lt;br /&gt;
differences. I will further explain how we can use bibliometric analysis&lt;br /&gt;
to improve the efficiency of knowledge discovery.&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
There is also a public talk at 7pm, See [https://www.facebook.com/events/2293901217497764/ Public Talk, Argyros Forum, 7pm]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Conference: Monday to Friday, November 12th to November 16th in Sandhu Conference Center ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Advances in operator theory with applications to mathematical physics &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;CONFERENCE:&#039;&#039; &#039;&#039;&#039; Advances in operator theory with applications to mathematical physics &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039;  For a complete schedule, and a list of abstracts, see: [http://www1.chapman.edu/~alpay/conf2018/conf2018.html Conference Webpage].&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, November 5th 2018 at 4:15pm, in Keck 171, tea and cookies at 3:45pm in Keck 370===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Uwe Kahler, Universidade de Aveiro, &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;  Curvature detection using Taylorlets  &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; The problem in detection of nodules in medical images consists of two parts: the detection of edges and the detection of curvature. For the detection of edges as elements of the wavefront set of an image shearlets appeared in the last decade as the principal approach based on approximation. But elements of the wavefront set have a problem in the sense that they are singularities with prescribed direction, but not prescribed curvature. To overcome this problem higher order shearlets, so-called Taylorlets were introduced. While we will discuss them in this talk we will also point out and discuss a principal mathematical problem arising in their application: the problem of construction of a Schwartz function with infinitely many generalized vanishing moments. We will show that Meyer’s frequency-based approach does not fit this case and provide a space-based method for its generation.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, November 1st 2018 at 4:15pm, in Keck 171, tea and cookies at 3:45pm in Keck 370===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Roman Buniy, Chapman University &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Tripartite entanglement of qudits &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; We provide an in-depth study of tripartite entanglement of qudits. We start with a short review of tripartite entanglement invariants, prove a theorem about the complete list of all allowed values of three (out of&lt;br /&gt;
the total of four) such invariants, and give several bounds on the&lt;br /&gt;
allowed values of the fourth invariant. After introducing several&lt;br /&gt;
operations on entangled states (that allow us to build new states from&lt;br /&gt;
old states) and deriving general properties pertaining to their&lt;br /&gt;
invariants, we arrive at the decomposition theorem as one of our main&lt;br /&gt;
results. The theorem relates the algebraic invariants of any&lt;br /&gt;
entanglement class with the invariants of its corresponding components&lt;br /&gt;
in each of its direct sum decompositions. This naturally leads to the&lt;br /&gt;
definition of reducible and irreducible entanglement classes. We&lt;br /&gt;
explicitly compute algebraic invariants for several families of&lt;br /&gt;
irreducible classes and show how the decomposition theorem allows&lt;br /&gt;
computations of invariants for compounded classes to be carried out&lt;br /&gt;
efficiently. This theorem allows us to compute the invariants for the&lt;br /&gt;
infinite number of entanglement classes constructed from irreducible&lt;br /&gt;
components. We proceed with the complete list of the entanglement&lt;br /&gt;
classes for three qutrits with decompositions of each class into&lt;br /&gt;
irreducible components, and provide a visual guide to interrelations of&lt;br /&gt;
these decompositions. We conclude with numerous examples of building&lt;br /&gt;
classes for higher spin qudits.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 26th at 3:00pm, in Keck 171, tea and cookies at 2:30pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Askery Canabarro, Federal University of Alagoas - BRAZIL &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Statistical and Machine Learning for physicists, but not just Physics (part 2) &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Machine Learning has become one of the most exciting areas of modern research and application. In these talks we provide an introduction to the core concepts and tools of machine learning in a way easily understood and intuitive to physicists. The review begins by covering fundamental concepts in ML and modern statistics such as overfitting, regularization, and generalization before moving on to more advanced topics in both supervised and unsupervised learning, for instance: ensemble deep learning, auto ML and so on. We illustrate the ideas with problems we are currently involved in. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Part 2 of a series of 2 talks.&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 25th at 4:15pm, in Keck 171, tea and cookies at 3:45pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Askery Canabarro, Federal University of Alagoas - BRAZIL &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Statistical and Machine Learning for physicists (part 1)  &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Machine Learning has become one of the most exciting areas of modern research and application. In these talks we provide an introduction to the core concepts and tools of machine learning in a way easily understood and intuitive to physicists. The review begins by covering fundamental concepts in ML and modern statistics such as overfitting, regularization, and generalization before moving on to more advanced topics in both supervised and unsupervised learning, for instance: ensemble deep learning, auto ML and so on. We illustrate the ideas with problems we are currently involved in. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Part 1 of a series of 2 talks.&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 19th at 1:00pm, in Keck 171, tea and cookies at 2:00pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Erik Linstead, Chapman University &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; A Convoluted Talk &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Convolutional neural networks (CNNs) represent the current state-of-the-art in machine learning for computer vision. In this talk we will discuss some interesting applications of CNNs to non-traditional domains, as well as explore what happens to CNNs when we ignore computational efficiency to more closely align with neural physiology.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
=== Thursday, October 18th at 4:15pm, in Keck 171, tea and cookies at 3:45pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Sandu Popescu, IQS, Chapman University &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Dynamical quantum non-locality &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; During the 50 years since its discovery, the Aharonov–Bohm effect has had a significant impact on the development of physics. Its arguably deepest implication, however, has been virtually ignored.&lt;br /&gt;
&lt;br /&gt;
Next year will be the 60th anniversary of the discovery of the Aharonov–Bohm (AB) effect, one of the most surprising and quintessential effects in quantum mechanics. Since its discovery in 1959, the AB effect has made a significant impact on the development of physics. It has been generalized in a variety of directions — from a rather straightforward dual effect such as the Aharonov–Casher effect, to the celebrated Berry phase, to non-Abelian gauge theories, to Wilson loops, to anyons. During these past 60 years the impact of the AB effect has been significant indeed.&lt;br /&gt;
&lt;br /&gt;
And during all these past 60 years, what I believe to be by far the deepest implication of the AB effect (discovered by Yakir Aharonov and described in his Tel Aviv University lecture notes and elsewhere) has been virtually ignored. It is an implication that transcends the specific context from which it originates, and goes directly to the very core of quantum physics: the quantum equations of motion are non-local. Without appreciating this fact, it is safe to say that no real understanding of the nature of quantum mechanics is possible.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, October 4th at 4:15pm, in Keck 171, tea and cookies at 3:45pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Justin Dressel, Chapman University &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Strengthening weak measurements for qubit tomography and multitime correlators &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; We re-examine the measurement strength needed to perform two recent quantum information tasks with qubits: state tomography using weak values, and determining multitime correlators. Traditionally these protocols have required weak measurements that are minimally disturbing, meaning that the coupling between an investigated quantum system and a measurement device has no appreciable influence on the evolution of the system. We show that the weakness of the interaction is not in fact necessary when measuring qubits. For the case of state tomography, we report an experiment performed with neutron matter-waves that extends the notion of generalized eigenvalues for the neutron&#039;s path system to allow the exact determination of weak values using both strong and weak interactions. Experimental evidence is given that strong interactions outperform weak ones both for precision and accuracy. For the case of obtaining multitime correlators, we show a method that uses sequential generalized measurements. Specifically, if a correlator can be expressed as an average of nested (anti)commutators of operators that square to the identity, then that correlator can be determined exactly from the average of a measurement sequence of arbitrary strength. We show that both two-point and four-point (out-of-time-ordered) correlators belong to this useful class of qubit correlators.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 27th at 4:15pm, in Keck 171, tea and cookies at 3:45pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Matthew Leifer, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Fine Tunings and the Nature of Quantum Reality &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Despite many years of research, there is still no universally agreed upon realist interpretation of quantum theory. In this talk, I argue that the main problem is to deal with the fine-tunings implied by no-go theorems about realist approaches to quantum theory, such as Bell’s theorem. We should seek to either eliminate these fine tunings or explain them as emergent. I will give an overview of the various fine-tunings that exist in quantum theory, due to nonlocality, contextuality, lack of time-symmetry, and results on the reality of the quantum state. I will explain how we can quantify each fine tuning, and exploit them in quantum information processing tasks.  If time permits, I will outline two approaches to solve the fine-tuning problem based on block universe models with retrocausality and many-worlds.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, September 18th at 4:15pm in Keck 171, tea and cookies at 3:45pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Professor H. Turgay Kaptanoglu, Department of Mathematics, Bilkent University, Ankara &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Singular Integral Operators With Bergman-Besov Kernels on the ball &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Although the boundedness of the Bergman-Besov projection operators from Lebesgue classes onto Bergman-Besov spaces has been studied for several decades, the study of the boundedness of the same operators as singular integral operators between different Lebesgue classes are rather new. Some initial work has recently been done by Cheng, Fang, Wang, Yu for the weighted Bergman operator on the unit disc and by Cheng, Hou, Liu for the Drury-Arveson operator. Also Zhao has investigated certain sub-cases of the same problem as Bergman projections. The methods they employ are sporadic and specific to the particular cases they are interested in.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
===  The 4th SYSMICS Workshop: Friday-Monday, September 14-17, in Sandhu Conference Center D1 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; The 4th SYSMICS Workshop  &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Topic of the workshop: &amp;quot;Duality in Algebra and Logic” &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Workshop Webpage: http://math.chapman.edu/~jipsen/sysmics/&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, August 31st at 3:30pm, in Beckman 404 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Philip Mannheim, Professor of Physics, University of Connecticut  &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; The Crisis  in Fundamental  Physics &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Cosmology deals with the the astrophysical macroscopic universe on large&lt;br /&gt;
scales while fundamental  physics  deals with the particle physics&lt;br /&gt;
microscopic universe on small ones. Recently it has become apparent that&lt;br /&gt;
large and small scale physics  are actually intertwined leading to an&lt;br /&gt;
astro-particle picture of the universe. At the present time this picture&lt;br /&gt;
has achieved great success, but at the same time it has led to many open&lt;br /&gt;
questions and challenges, challenges which threaten to potentially&lt;br /&gt;
undermine the entire picture. These challenges include dark matter, dark&lt;br /&gt;
energy, the cosmological constant problem, quantum gravity, the status of&lt;br /&gt;
supersymmetry, the multiverse picture, extra space-time dimensions, and the nature of the Higgs boson. In this talk we review these issues and suggest that their resolution would require a paradigm shift in our view of the universe.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, August 31st at 1:00pm, Keck 171, lunch with the speaker in the Faculty Club at noon ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Philip Mannheim, Professor of Physics, University of Connecticut  &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Why physicists are interested in differential geometry &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Ever since Einstein&#039;s development of gravity theory, general relativity and differential geometry have been central components of physics research and of our understanding of the universe. Of special interest is how gravity can interface with the other fundamental forces, the nuclear force, the weak force, and especially the electromagnetic force. In this talk we describe some of the motivation and central achievements for general relativity, and discuss some proposed generalizations of it such as torsion and Weyl geometry that might lead to a purely geometric unification of the fundamental forces.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, August 30th at 4:00pm, Keck 171, tea and cookies at 3:30pm in Keck 370===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Philip Mannheim, Professor of Physics, University of Connecticut  &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Quantum Conformal Gravity &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Conformal symmetry is a natural symmetry in physics since it is the full symmetry of the light cone. If all particles are to get their masses by symmetry breaking then conformal symmetry is the symmetry of the unbroken Lagrangian. Like Yang-Mills theories conformal symmetry has a local extension, namely conformal gravity, a pure metric-based candidate alternative to the non-conformal invariant standard Newton-Einstein theory of gravity. With its dimensionless coupling constant quantum conformal gravity is power counting renormalizable. Since its equations of motion are fourth-order derivative equations conformal gravity has long been thought to possess unacceptable ghost states of negative norm that would violate unitarity. However on constructing the quantum Hilbert space Bender and Mannheim found that this not to be the case. Conformal gravity is thus offered as a completely consistent and unitary quantum theory of gravity, one that requires neither the extra dimensions nor the supersymmetry of string theory. As formulated via local conformal invariance there is no intrinsic classical gravity, with gravity instead being intrinsically quantum-mechanical, with the observed classical gravity being output rather than input. The contribution of the graviton loops of conformal gravity enables conformal gravity to solve the cosmological constant problem. Like Yang-Mills the potential of conformal gravity contains both a Newtonian term and a linear potential. Together with a quadratic potential that the theory also contains conformal gravity is able to explain the systematics of galactic rotation curves  without any need for galactic dark matter. Since all mass is to be dynamical there cannot be a fundamental double-well Higgs potential in the theory. Instead, the Higgs boson is generated dynamically, with the hierarchy problem then being solved.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, August 23rd at 4:00pm, Keck 171, tea and cookies at 3:30pm in Keck 370===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Gunduz Caginalp, Professor of Mathematics, University of Pittsburgh&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Volatility Maxima as a Forecaster of Trading Price Extrema &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; This is joint work with Carey Caginalp. The relationship between price volatility and a market extremum is examined using a fundamental economics model of supply and demand. By examining randomness through a microeconomic setting, we obtain the implications of randomness in the supply and demand, rather than assuming that price has randomness on an empirical basis. Within a very general setting the volatility has a maximum that precedes the extremum of the price. A key issue is that randomness arises from the supply and demand, and the variance in the stochastic differential equation governing the logarithm of price must reflect this. Analogous results are obtained by further assuming that the supply and demand are dependent on the deviation from fundamental value of the asset.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Spring 2018 ==&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
The seminar talks are in Von Neumann Hall VN 116 (545 W Palm Ave&lt;br /&gt;
corner of W Palm Ave and railroad, Orange, CA 92866).&lt;br /&gt;
Sometimes there will be a change of venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/discover/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Von Neumann Hall is Building 48 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, May 11th at 3:00pm, Von Neumann Hall, tea and cookies at 2:30pm ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Nadia Ahmed, Saddleback&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Consumer-centric Residential Demand Side Management &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Energy Management Systems (EMS) are mainly price driven with minimal consumer interaction. To improve the effectiveness of EMS in the context of demand response, an alternative EMS control framework driven by resident behavior patterns is developed. Using hidden Markov modeling techniques, the EMS detects consumer behavior from real-time aggregate consumption and a pre-built dictionary of reference models. These models capture variations in consumer habits as a function of daily living activity sequence. Following a training period, the system identifies the best fit model which is used to estimate the current state of the resident. When a request to activate a time-shiftable appliance is made, the control agent compares grid signals, user convenience constraints, and the current consumer state estimate to predict the likelihood that the future aggregate load exceeds a consumption threshold during the operating cycle of the requested device. Based on the outcome, the control agent initiates or defers the activation request. In an extension of this work, a battery health conscious stochastic dynamic programming control framework is introduced as part of a greater cyber physical system which incorporates the harvesting unit, the storage unit, the residential load profile, the weather, the weather forecast, the utility, and consumer preferences into a unified Markov decision process.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== IQS Live Podcast, Monday, April 16th at 6:00pm, 1888 Center, 115 North Orange Street ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Adam Becker&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; What Is Real?  The Unfinished Quest for the Meaning of Quantum Physics&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; IQS Live podcast recording and book signing with Adam Becker, author of:&lt;br /&gt;
&lt;br /&gt;
&amp;quot;What Is Real?  The Unfinished Quest for the Meaning of Quantum Physics”&lt;br /&gt;
&lt;br /&gt;
Monday April 16&lt;br /&gt;
6pm-8pm&lt;br /&gt;
1888 Center, 115 North Orange Street, Orange, CA 92866&lt;br /&gt;
&lt;br /&gt;
Produced in partnership with the Institute for Quantum Studies, Chapman University&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Organized by IQS. Free admission, but seating is limited so you have to RSVP at the following link: &lt;br /&gt;
[https://bit.ly/AdamBecker Event Registration]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, April 13th at 3:30pm, Von Neumann Hall, tea and cookies at 3:00pm ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Jose Raul Gonzalez Alonso, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Quantum Chaos, Information Scrambling, and Out-of-time-ordered Correlators &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Out-of-time-ordered-correlators (OTOCs) have emerged as a useful tool to study quantum chaos and the scrambling and delocalization of information in many-body systems. While challenging, their experimental measurement has been achieved in NMR, trapped ion, and superconducting systems. In this talk, I will review the different open problems at the intersection of quantum chaos, information scrambling, and OTOCs and the recent progress in solving them.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, April 6th Sixth annual Computational and Data Sciences Graduate Conference  ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Chapman University Graduate Students, 9:15am - 4:30pm, Argyros Forum 209ABC&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;  Sixth annual Computational and Data Sciences Graduate Conference&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Various&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, March 30th at 3:00pm, Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Kai-Wen Tu, Chapman University&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Fourier Transform and Signal Processing Application with a SAR Imaging Example&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; In solving heat-flow problems Fourier found that a periodic function can be represented by an infinite series of sinusoidal functions. Generalization from Fourier Series to Fourier Transform and its discrete form, the Discrete Fourier Transform (DFT) will be discussed briefly. Development of a computationally efficient algorithm FFT (Fast Fourier Transform) for computing DFT will be described with MATLAB illustration.&lt;br /&gt;
The second part of the talk will focus on a specific signal processing application using FFT. An overview of imaging radar systems with conventional aperture as well as with synthetic aperture (SAR) will be given. Image resolution will be shown to be related to pulse compression and synthetic array processing as the antenna beam creates a footprint with the continuing illumination of a designated spot. Image formation of the Spotlight imaging mode encompassing signal data collection, motion compensation, data sampling, range dechirp, azimuth compression, polar interpolation, 2-D FFT, phase correction, and pixel magnitude encoding will be presented.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, March 20th at 3:00pm, Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Mic Detlefsen, University of Notre Dame &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Some Elements of Hilbert’s Formalism &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; The aim of this talk is to describe and consider the significance of a certain element of Hilbert¹s formalist viewpoint that I call its descriptive or observational element.  This element played an important role in shaping Hilbert¹s distinctive approach to the consistency problem for arithmetic (and to other consistency problems).  It seems not to have been generally well recognized and appreciated. &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, March 16th at 3:00pm, Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Lorenzo Catani, UCL &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Csirelson’s bounds as a refinement of Landauer’s principle &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; I will present a simple single qudit protocol that computes a non-linear function. It consists of a system in a fixed state, two gates controlled by classical dits (d-level systems) and a fixed measurement. The goal is to choose gates to optimise the average probability over all input combinations of dits to obtain the target non-linear function as output. &lt;br /&gt;
&lt;br /&gt;
I will show that any strategy in the single-qudit protocol can be mapped to a strategy in a two qudits CHSH game, thus obtaining the known classical Bell bounds for the strategies that only involve classical reversible computation or quantum stabiliser computation, and Csirelson’s bounds for general quantum strategies. Since the single qudit protocol restricts the degrees of freedom to gates only, we analyse the bounds obtained in light of Landauer’s principle, showing that there is a trade-off in entropic cost versus increased success probability. The single qubit computation can perform better than the reversible bit computation, but it cannot achieve the performance of the irreversible computation. In this sense the protocol acts as an irreversibility witness. In the case of systems of dimension two (bits and qubits) these results have a clear geometric interpretation in the corresponding state spaces. &lt;br /&gt;
&lt;br /&gt;
I will briefly discuss how our scheme also acts as a dimensional witness and I will conclude with some comments on the sources of non-classicality present in the current protocol since non-locality and contextuality (in its standard notions) are not present.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, March 9th at 3:00pm, Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Carey Caginalp, University of Pittsburgh &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Supply, Demand, Volatility and Fat Tails &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; The classical equations of mathematical finance involve basic assumptions that are convenient mathematically and are essentially a particular limit of the underlying market phenomena. The assumptions involve infinite capital for arbitrage and independent Gaussian increments in relative price change. Among the consequences are an exponential decay in large deviations of relative price and volatility that is essentially constant in time. We use a basic supply/demand model to explain the fat tails phenomena based on endogenous reasons. The bubble in cryptocurrencies can also be explained in terms of this approach in which the liquidity price, namely, cash available for investing in a particular asset divided by the number of units available. Current work is focused on demonstrating that the extrema in price are accompanied by extrema in volatility.&lt;br /&gt;
(Research in collaboration with Dr. Carey Caginalp) &lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== IQS Workshop: Saturday, March 3rd, Argyros Forum 212 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Quantum Simulation and Quantum Walks Workshop &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Quantum Simulation and Quantum Walks Workshop &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Organized by IQS. For registration to this event please follow the link: [https://events.chapman.edu/43566 Event Registration].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== IQS Workshop: Thursday-Friday, March 1st and 2nd, Beckman Hall 404 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; AAV Anniversary Conference - Celebrating 30 Years of Weak Values &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; AAV Anniversary Conference - Celebrating 30 Years of Weak Values &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Organized by IQS. For registration to this event please follow the link: [https://events.chapman.edu/44046 Event Registration].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, February 23rd at 3:00pm, Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Ken Wharton, San Jose State &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Spacetime-Based Retrocausal Models &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Ordinary quantum states grow exponentially with particle number, and cannot exist as a function on ordinary spacetime.   But when retrocausal models are considered, the reason for this exponential growth disappears, raising the exciting prospect of some ontic description of quantum phenomena that does exist in spacetime.  (In such models the spacetime-based ontic parameters need only work for the actual future measurement setting, not all possible counterfactual settings.)  I will give a detailed example of such a model, which can properly account for all maximally-entangled two-qubit states.  The key is an &amp;quot;all at once&amp;quot; analysis of the histories, rather than a dynamical evolution of instantaneous states.   Intriguingly, the model naturally supplies a novel alternate interpretation of Weak Values.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 22nd at 4:00pm, Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Adam Becker, Science Writer &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Myths about the history of the de Broglie-Bohm interpretation: setting the record straight &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Misconceptions about the de Broglie-Bohm interpretation of quantum mechanics appeared immediately at its first public presentation by de Broglie at Solvay in 1927. It took many years for those misconceptions to fall away. Today, we finally have a good understanding of the theory (or at least a better understanding), but there are still many common misconceptions about its history. What were the nature of the objections to de Broglie&#039;s version of the interpretation at Solvay? Why did de Broglie abandon it? What prompted Bohm to look for a new interpretation 25 years later? How were Bohm&#039;s ideas received by his contemporaries? And why did Bohm himself ultimately abandon his own ideas for another quarter of a century? There are &amp;quot;standard&amp;quot; answers to these questions, most of which are simply myths. For example, Pauli did not stump de Broglie at Solvay, Oppenheimer was generally kind to Bohm during his time on the blacklist, and Bohm&#039;s ideas were not simply ignored or dismissed out of hand by his contemporaries. In my talk, I will discuss the origins of these myths, and the far more complicated and surprising historical truths that they obscure.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, February 16th at 3:00pm, Von Neumann Hall ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Eli Levenson-Falk, USC &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Fleas on Schrödinger&#039;s Cat: Quasiparticles in Superconducting Quantum Circuits &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Superconducting electrical circuits can be used for quantum computing, quantum simulation, ultra-low-noise amplification, and precision sensing. However, quasiparticles--electron-like single-particle excitations of the superconducting condensate--can cause loss and noise, limiting the performance of these devices. The generation mechanisms, behavior, and annihilation channels of these quasiparticles are still poorly understood, hindering efforts to eliminate them from circuits. I will review the evidence for different quasiparticle models, show measurements using Andreev bound states as quasiparticle traps, and discuss future experiments that will determine the best ways to mitigate the harmful effects of quasiparticles.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, February 9th at 4:00pm, Beckman Hall 105 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. J.H. Eberly, Department of Physics and Astronomy, Center for Coherence and Quantum Optics, University of Rochester &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Hidden Coherences and Complementarity &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Interference, duality, polarization, coherence and entanglement are a partial list of notions that belong to both quantum physics and classical optics. It has been our recent goal to bring quantum-classical links into wider view and to indicate directions in which forthcoming and future work may be able to promote discussion and lead to a more unified understanding. A starting point has often been Niels Bohr&#039;s pronouncements and explanations of complementarity, as a way to come to grips with de Broglie&#039;s duality. Related debates have engaged and challenged philosophers as well as physicists for almost a century. Complemenn-classical world&#039;s mysterious quantum features. Disputed analyses and unresolved conflicts are still debated. It seems to have escaped notice that a key element in Bohr&#039;s own defining summary has never been captured in assessments to date. We will report what we believe to be the first description of complementarity that is quantitatively complete, along with experimental evidence of completeness.&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, February 9th, at 2:00pm in Hashinger 150 (Irvine Lecture Hall) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Cumrun Vafa, Harvard University &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Fundamental Lessons From String Theory &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; String theory has been developed for more than 40 years&lt;br /&gt;
now but it seems that we are still far from its final formulation.&lt;br /&gt;
Nevertheless, I explain some of the highlights of what we have learned&lt;br /&gt;
from string theory and how it revolutionizes many of the fundamental&lt;br /&gt;
principles of physics.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, February 8th, at 7:00pm in Beckman Hall 404 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Cumrun Vafa, Harvard University &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Physics and Geometry &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; This talk reviews the deep historical connections between geometry&lt;br /&gt;
and physics.   In modern times, the extra dimensions of string theory has provided a new&lt;br /&gt;
opportunity for enhancing this interplay which will be illustrated by concrete examples.&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, February 5th at 4:00pm, Von Neumann Hall  ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Dr. Ales Pultr, Charles University, Prague &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Point-free topology and some of its merits &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; Point-free thinking, example. Points vs. (realistic) places.&lt;br /&gt;
A glimpse of history: Synthetic and analytic geometry; classical topology as a generalized geometry is the analytic version of such a generalization. De- velopment starting in late 30ties and 40ties, how the point-free ideas connect with the classical ones (Hausdorff, Kuratowski, Caratheodory, Freudenthal). The break in the late fifties.&lt;br /&gt;
Definition of a locale (frame). Basic concepts and how one works with them.&lt;br /&gt;
One obtains a broader range of spaces and every generalization calls for justification. This will be done by discussing the following legitimate ques- tions.&lt;br /&gt;
(1) Is the broader range of spaces desirable? Do we get in some sense a better theory and when?&lt;br /&gt;
(2) Is the algebraic technique appropriate, does it not obscure the geomet- ric content?&lt;br /&gt;
(3) Do we not lose to much information when abolishing points?&lt;br /&gt;
We will start by briefly answering question (3) and then go to (1) and (2) presenting examples of results that are nicer, or cannot hold in the classical context at all. In particular we will emphasize the constructive aspects (facts working without choice principles, such as compactification, completion, or Stone duality - the last is so simple that it can serve also as an example of the advantage of the algebraic techniques).&lt;br /&gt;
Note of the role of point-free topology in logic and theoretical computer science.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, January 29th at 3:00pm, Von Neumann Hall, third session of the OCIE-HPML seminar  ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Jamie Tappenden (USC) &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; Frege, Carl Snell and Romanticism; Fruitful Concepts and the &#039;Organic/Mechanical&#039; Distinction &#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; A surprisingly neglected figure in Frege scholarship is the man Frege describes (with praise that is very rare for Frege) as his &amp;quot;revered teacher&amp;quot;, the Jena physics and mathematics professor Carl Snell.  It turns out that there is more of interest to say about Snell than can fit into one talk, so I&#039;ll restrict attention here to just this aspect of his thought: the role of the concept of &amp;quot;organic&amp;quot;, and a contrast with &amp;quot;mechanical&amp;quot;. Snell turns out to have been a philosophical Romantic, influenced by Schelling and Goethe, and Kant&#039;s Critique of Judgement.  In Frege&#039;s environment, the &amp;quot;organic/mechanical&amp;quot; contrast, understood in a distinctively Romantic fashion, had reached the status of &amp;quot;accepted, recognized cliché&amp;quot;. More generally, Frege&#039;s environment was more saturated with what we now call ``Continental philosophy&amp;quot; than we might expect. This context-setting has a payoff for our reading of Frege&#039;s texts: many expressions and turns of phrase in Frege that have been regarded as vague, throwaway metaphors turn out to be literal references to ideas that would have been salient among the people in Frege spent time with day-to-day. In particular, this is true of Frege&#039;s account of &amp;quot;extending knowledge&amp;quot; via &amp;quot;fruitful concepts&amp;quot; and his rejection of the idea that logic and mathematics can be done &amp;quot;mechanically&amp;quot; (as with Jevons&#039; logic machines, or Fischer&#039;s &amp;quot;aggregative mechanical thought&amp;quot;). When Frege appealed to &amp;quot;organic connection&amp;quot; and speaks of fruitful concepts as containing conclusions &amp;quot;like a plant in its seeds&amp;quot;, he would have expected his apparent metaphors to have been understood in a very specific way, as alluding to a recognized contrast between &amp;quot;organic&amp;quot; and &amp;quot;mechanical&amp;quot; connection that was applied by Snell and those close to him not only to distinctions between biological and physical reasoning but also to distinctions of types of reasoning in arithmetic and geometry. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, January 29th at 4:00pm  (Beckman Hall 404) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039; Peter Coffee, Vice President for Strategic Research at salesforce.com &#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039; The Future That&#039;s Already Happened: Fundamental Forces of Change&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract: &#039;&#039; There are two ways to talk about &amp;quot;the future.&amp;quot; One involves making predictions of what might happen. The other, much less speculative, solves present-day equations for a future value of time. Today, the second approach can make use of observable facts about connection, collaboration, acceleration, and introduction of machine intelligence (&amp;quot;Ex Machination&amp;quot;) into devices and processes -- to give us a crisp and compelling picture of what otherwise might seem wild-eyed visions. &lt;br /&gt;
&lt;br /&gt;
For registration to this event please follow the link: [https://events.chapman.edu/45114 Event Registration].&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar_2019&amp;diff=5</id>
		<title>MPC Seminar 2019</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar_2019&amp;diff=5"/>
		<updated>2021-02-22T18:28:52Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot; == Spring 2019 ==  The seminar talks are held in &amp;#039;&amp;#039;&amp;#039;Keck Center for Science and Engineering, KC 171&amp;#039;&amp;#039;&amp;#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore S...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
== Spring 2019 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 171&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, May 16, 2019 at 3 pm, in Keck 370, tea and cookies at 2:40pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Purbita Jana, The Institute of Mathematical Sciences, Chennai, India&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Intuitionistic topological systems and their connections with Heyting algebra and Gödel algebra&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; (joint work with Antonio Di Nola and Revaz Grigolia) This talk will suggest a new approach of representation of a Heyting algebra as an I-topological system. I-topological systems will be introduced following the notion of topological system introduced by S. Vickers which is a triple (X, |=, A) consisting of a non-empty set X, a frame A and a relation between X and A satisfying logic of finite observations or geometric logic. It is well known that frame is the Lindenbaum algebra of geometric logic where as the Lindenbaum algebra of intuitionistic logic is a Heyting algebra. Hence to define I-topological systems, intuitionistic logic plays a crucial role. Moreover, we will focus on the categorical relationships between the I-topological system, Esakia space and Heyting algebra (and its particular case of Gödel algebra).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, April 16, 2019 at 5 pm, in Keck 370, tea and cookies at 3:40pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Michele Piazzai, University of Amsterdam, Netherlands&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Ecology of Ideas: Computational Evidence of Self-Organization&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Concepts are cognitive structures that people use to categorize objects and organize their knowledge of the world. Common examples include food and furniture, but also rock&#039;n&#039;roll, quantum physics, and blockchain. For individuals, concepts are the main tools of learning and inference; for groups of individuals (i.e., social systems), they are indispensable instruments of coordination and exchange. But how can the idiosyncratic knowledge of individuals in a social system converge on shared concepts, so as to allow coordination? Conventional wisdom in social science suggests that designated mediators, such as music critics, facilitate this convergence by endorsing the learning and usage of particular concepts. By contrast, I will argue that rational decisions embedded in everyday social interaction provide the necessary and sufficient conditions for concepts&#039; convergence. No mediators are needed for the agents to develop a shared conceptual structure: as commonly occurs in complex adaptive systems, design emerges in the absence of centralized designers. Simulation results are presented that illustrate this point.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, April 11, 2019 at 4 pm, in Keck 370, tea and cookies at 3:40pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Michele Piazzai, University of Amsterdam, Netherlands&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Ecology of Ideas: Empirical Evidence of Evolutionary Pressure&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Building on the notion that the collective cognition of agents engaged in social interaction constitutes a complex adaptive system, I present a theoretical framework to describe agents&#039; shared conceptual structure as a self-replicating network of objects, ideas, and decisions. Finite cognitive resources at the agents&#039; disposal create a competitive environment where concepts vie to be assigned to objects in categorization decisions, so as to survive in the agents&#039; memory. This struggle for survival gives the socio-cognitive system traits characteristic of an ecology. I identify two sources of ecological interdependence among concepts, including horizontal relations between concepts located at the same level of abstraction and vertical relations between concepts located at different levels. An empirical model is developed to test whether these relations affect the selection of concepts in agents&#039; decisions and the evolution of their shared conceptual structure. To test this model, I analyze one decade&#039;s worth of categorization decisions made by users of a crowd-sourced music encyclopedia whose objective is sorting records into genres and sub-genres.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, March 28, 2019 at 5 pm, in Keck 171, tea and cookies at 4:40pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Giovanni Sambin, University of Padova, Italy&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Half way to Grothendieck&#039;s aim (embedding of pointwise topology into pointfree topology)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; For a mathematician, the most interesting motivation for a different foundation is when it offers a new perspective or even a solution to an old problem. Developing topology over a very &amp;quot;weak&amp;quot; foundation offers a precise mathematical expression and proof to the expectation, which is well present since the time of Grothendieck, of a notion of space generalising that of topological space.&lt;br /&gt;
The well-known link between pointfree and standard topology (with points) is a categorical adjunction between topological spaces Top and locales Loc. Using a &amp;quot;weak&amp;quot; foundation to develop topology, one is compelled to preserve more information than usual, and thus replace topological spaces with &amp;quot;concrete spaces&amp;quot;, and locales with &amp;quot;positive topologies&amp;quot;. Contrary to a common expectation, it is precisely this &amp;quot;useless&amp;quot; information what offers a solution to Grothendieck&#039;s aim. That is,  the above adjunction becomes a categorical embedding of concrete spaces into positive topologies.&lt;br /&gt;
This embedding does not look possible without exploiting the presence of the new (intrinsically existential) notion of positivity relation.&lt;br /&gt;
Half way because this leaves the problem open of finding a suitable notion of positivity (formal closed subsets) in the framework of arbitrary Grothendieck topologies.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, March 13, 2019 at 4 pm, in Keck 171, tea and cookies at 3:45pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Dr. Matt Pusey, University of Oxford&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Anomalous weak values and contextuality: robustness and imaginary&lt;br /&gt;
parts&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will discuss extensions to my previous work linking anomalous weak&lt;br /&gt;
values with contextuality. In particular, I will show that using&lt;br /&gt;
transformation noncontextuality obviates the experimentally&lt;br /&gt;
problematic requirement that the post-selection is projective. I will&lt;br /&gt;
also discuss the status of the imaginary part of weak values. My talk&lt;br /&gt;
will be based on joint work with Ravi Kunjwal and Matteo Lostaglio:&lt;br /&gt;
https://arxiv.org/abs/1812.06940&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, February 27, 2019 at 4 pm, in Keck 171, tea and cookies at 3:45pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Christos Tzounis, California State Polytechnic University, Pomona&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Metric of an Evaporating Black Hole&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We present an approximate time-dependent metric in ingoing Eddington-Finkelstein coordinates for an evaporating nonrotating black hole as a first-order perturbation of the Schwarzschild metric, using the linearized back reaction from a realistic approximation to the stress-energy tensor for the Hawking radiation in the Unruh quantum state.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, February 13, 2019 at 4 pm, in Keck 171, tea and cookies at 3:45pm in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Peter Rakitzis, Institute of Electronic Structure and Laser, Heraklion, Greece&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Ultrahigh-Density Spin-Polarized H and D Atoms Observed via Magnetization Quantum Beats&#039;&#039;&#039;&lt;br /&gt;
 &lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We measure nuclear and electron spin-polarized H and D densities of at least $10^{20}$ cm$^{−3}$ and $10^{19}$ cm$^{−3}$, i.e., at pressures of 5 bar and 0.5 bar, respectively, with ∼10-50 ns lifetimes, from the photodissociation of HBr and DI with circularly polarized UV light pulses. We observe the hyperfine quantum beating of the H and D magnetization with a pickup coil, i.e., the respective 0.7 and 3 ns periodic transfer of polarization from the electrons to the nuclei and back. These pulsed densities are ∼7 orders of magnitude higher than that produced by conventional continuous-production methods, and are sufficient for three novel applications: (a) laser-driven ion acceleration of spin-polarized electrons, protons, or deuterons, (b) the preparation of nuclear-spin-polarized molecules, and (c) the demonstration of spin-polarized D-T or D$^{-3}$He laser fusion at large laser facilities such as NIF, for which a reactivity enhancement of ∼50% is expected.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, February 5 -- Saturday, February 9, 2019  in Keck 370 ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;&#039;11th Annual Chapman University CECAT Workshop on Pointfree Mathematics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
TUESDAY, February 5th:&lt;br /&gt;
&lt;br /&gt;
1:00 - 2:00pm &#039;&#039;&#039;M. Andrew Moshier&#039;&#039;&#039;, &#039;&#039;Chapman University&#039;&#039;, Weakening relations&lt;br /&gt;
&lt;br /&gt;
THURSDAY, February 7th:&lt;br /&gt;
&lt;br /&gt;
10:30 - 11:30am: &#039;&#039;&#039;Peter Jipsen&#039;&#039;&#039;, &#039;&#039;Chapman University&#039;&#039;, Involutive residuated lattices and relation algebras&lt;br /&gt;
&lt;br /&gt;
11:30 - 12:30pm: &#039;&#039;&#039;Sara Vannucci&#039;&#039;&#039;, &#039;&#039;University of Salerno&#039;&#039;, Semiring and Semimodule Issues in Residuated Lattices&lt;br /&gt;
&lt;br /&gt;
1:00 - 2:15pm: &#039;&#039;&#039;Rick Ball&#039;&#039;&#039;, &#039;&#039;University of Denver&#039;&#039;, Pointfree Integration&lt;br /&gt;
&lt;br /&gt;
2:15 - 3:15pm:	&#039;&#039;&#039;Anna Laura Suarez&#039;&#039;&#039;, &#039;&#039;University of Birmingham&#039;&#039;, D-frames and frame coproducts&lt;br /&gt;
&lt;br /&gt;
3:30 - 4.30pm: &#039;&#039;&#039;Alex Kurz&#039;&#039;&#039;, &#039;&#039;Chapman University&#039;&#039;, On the duality theory of weakening relations&lt;br /&gt;
&lt;br /&gt;
FRIDAY, February 8th&lt;br /&gt;
&lt;br /&gt;
10:30 - 11:30am: &#039;&#039;&#039;Ales Pultr&#039;&#039;&#039;, &#039;&#039;Charles University&#039;&#039;, Strong Hausdorff properties of frames&lt;br /&gt;
&lt;br /&gt;
11:30 - 12:30pm: &#039;&#039;&#039;Diego Valota&#039;&#039;&#039;, &#039;&#039;University of Milan&#039;&#039;, [http://math.chapman.edu/~jipsen/cecat/11th-Pointfree-Mathematics-Workshop/DiegoValota2019.pdf Computing Spectra via Dualities in the MTL hierarchy]&lt;br /&gt;
&lt;br /&gt;
2:00 - 3:00pm: &#039;&#039;&#039;Olim Tuyt&#039;&#039;&#039;, &#039;&#039;University of Bern&#039;&#039;, Algebraic finite model property of a modal Gödel logic&lt;br /&gt;
&lt;br /&gt;
3:00 - 4:15pm: &#039;&#039;&#039;Rick Ball&#039;&#039;&#039;, &#039;&#039;University of Denver&#039;&#039;, Pointfree Integration, continued&lt;br /&gt;
&lt;br /&gt;
SATURDAY, February 9th&lt;br /&gt;
&lt;br /&gt;
1:00 - 5:00pm: Discussion session&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=4</id>
		<title>MPC Seminar</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=MPC_Seminar&amp;diff=4"/>
		<updated>2021-02-22T18:27:57Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: Created page with &amp;quot;This is the homepage of the Chapman University &amp;#039;&amp;#039;&amp;#039;Mathematics, Physics, and Computation Seminars&amp;#039;&amp;#039;&amp;#039; (MPC Seminar)  &amp;#039;&amp;#039;Seminar Organizers:&amp;#039;&amp;#039; Roman Buniy and Peter Jipsen   =...&amp;quot;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;This is the homepage of the Chapman University &#039;&#039;&#039;Mathematics, Physics, and Computation Seminars&#039;&#039;&#039;&lt;br /&gt;
([[MPC Seminar]])&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Seminar Organizers:&#039;&#039; Roman Buniy and Peter Jipsen&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Spring 2021 ==&lt;br /&gt;
&lt;br /&gt;
The MPC seminar is held via Zoom for now. The Zoom address will be sent in the email announcements.&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Jan 21st, 2021, 4 - 5 pm on Zoom ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Mike Campbell, Eureka (SAP), joint work with Vernon Smith (Chapman University)&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;An Elementary Humanomics Approach to Boundedly Rational Quadratic Models&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Video of talk:&#039;&#039; [https://youtu.be/F74RlCAjC_A YouTube] &#039;&#039;Slides:&#039;&#039; [http://math.chapman.edu/~jipsen/seminarposters/MikeCampbell2021HumanomicsApproachBRQuadratic.pdf pdf]&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We take a refreshing new look at boundedly rational quadratic models in economics using some elementary modeling of the principles put forward in the book Humanomics by Vernon L. Smith and Bart J. Wilson.  A simple model is introduced built on the fundamental Humanomics principles of gratitude/resentment felt and the corresponding action responses of reward/punishment in the form of higher/lower payoff transfers.  There are two timescales: one for strictly self-interested action, as in economic equilibrium, and another governed by feelings of gratitude/resentment.  One of three timescale scenarios is investigated: one where gratitude/resentment changes much more slowly than economic equilibrium (&amp;quot;quenched model&amp;quot;).  Another model, in which economic equilibrium occurs over a much slower time than gratitude/resent evolution (&amp;quot;annealed model&amp;quot;) is set up, but not investigated.  The quenched model with homogeneous interactions turns out to be a non-frustrated spin-glass model.  A two-agent quenched model with heterogeneous aligning (ferromagnetic) interactions is analyzed and yields new insights into the critical quenched probability p (1-p) that represents the empirical frequency of opportunity for agent i to take action for the benefit (hurt) of other that invokes mutual gratitude (resentment).  A critical quenched probability p*i, i=1,2, exists for each agent.   When p &amp;lt; p*i, agent i will choose action in their self-interest.  When p &amp;gt; p*i, agent i will take action sensitive to their interpersonal feelings of gratitude/resentment and thus reward/punish the initiating benefit/hurt.  We find that the p*i are greater than one-half, which implies agents are averse to resentful behavior and punishment.  This was not built into the model, but is a result of its properties, and consistent with Axiom 4 in Humanomics about the asymmetry of gratitude and resentment.  Furthermore, the agent who receives less payoff is more averse to resentful behavior; i.e., has a higher critical quenched probability.  For this particular model, the Nash equilibrium has no predictive power of Humanomics properties since the rewards are the same for self-interested behavior, resentful behavior, and gratitude behavior.  Accordingly, we see that the boundedly rational Gibbs equilibrium does indeed lead to richer properties.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Link to paper:&#039;&#039; [https://digitalcommons.chapman.edu/cgi/viewcontent.cgi?article=1330&amp;amp;context=esi_working_papers Chapman Digital Commons]&lt;br /&gt;
&lt;br /&gt;
== Spring 2020 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Friday, Feb 21st, 2020, noon - 1 pm in Keck 370, refreshments at 11:45 am (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Christian Williams, University of California at Riverside&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Predicate Calculus for Algebraic Theories&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; There is a notion of predicate for algebraic theories, which admits a calculus of both logical and algebraic operations. We thereby extend equational logic by first-order logic, and provide a natural type theory for algebraic structures.&lt;br /&gt;
&lt;br /&gt;
We demonstrate the idea with the theory of monoids, and derive the example predicate &amp;quot;prime&amp;quot;. This and many algebraic examples are only useful when they are mapped from a theory into actual models. There is much to be done in this direction. However, the driving motivation of this work is the application to programming languages: we focus on applying the idea to a more general notion of theory with variable binding.&lt;br /&gt;
&lt;br /&gt;
The construction is given in the topos of presheaves on a theory T: a &amp;quot;predicate&amp;quot; is a sieve on an object t of T, which corresponds to a subfunctor of the representable T(-,t). For each type t, these predicates form a Heyting algebra, providing the constructors of intuitionistic logic. The operations of T can be lifted to act on predicates, and we construct a model Pred(T): T --&amp;gt;HeyAlg. The correspondence between the operations of T and those in the image of Pred(T) gives that the former are &amp;quot;polymorphic&amp;quot; with respect to the types of the latter. This process can be understood as providing the theory T with a polymorphic type system.&lt;br /&gt;
&lt;br /&gt;
The original motivation of this work is a logic for concurrency known as Namespace Logic. This applies to the reflective higher-order pi calculus, which is the language of the distributed computing platform RChain. We demonstrate the above framework by constructing namespace logic. This gives a glimpse into a large field of potential application.&lt;br /&gt;
&lt;br /&gt;
[http://math.chapman.edu/~jipsen/seminarposters/Christian_Williams_pcat_2020-02-21.pdf Slides from the talk]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 19th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Simon Cho, University of Michigan&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A categorical perspective on persistent and magnitude homology&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; We define and explain both persistent homology and magnitude homology, and their respective roles in applications (in both pure and applied settings). We will exhibit how both arise as a &amp;quot;singular complex&amp;quot; of a metric space in essentially the same way, but for different values of a parameter.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Feb 12th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Stephon Alexander, Brown University, Rhode Island&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The Quantum Cosmological Constant&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The mysteries surrounding the Cosmological Constant presides at the interface of quantum mechanics and gravity.  In this seminar,&lt;br /&gt;
I will provide a pedagogical discussion of the many faces of the cosmological constant problem and discuss some current research that&lt;br /&gt;
paves new directions that invites us to rethink the quantum nature of vacuum energy.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Tuesday, Jan 14th, 2020, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Pedram Roushan, Google Inc., Santa Barbara, CA&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum supremacy using a programmable superconducting processor&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm. If time permits, I will present some of our more recent measurements. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
== Fall 2019 ==&lt;br /&gt;
&lt;br /&gt;
The seminar talks are held in &#039;&#039;&#039;Keck Center for Science and Engineering, KC 370&#039;&#039;&#039; (Center St. Orange, CA 92866, intersection of Center St. And Sycamore St.), &#039;&#039;&#039;usually on Wednesday at 4 pm&#039;&#039;&#039;.&lt;br /&gt;
Sometimes there will be a change of time or venue and the announcement will reflect this change.&lt;br /&gt;
&lt;br /&gt;
See [http://www.chapman.edu/about/maps-directions/index.aspx Maps&lt;br /&gt;
and directions], Keck Center is Building 28 on the Campus Map [https://www.chapman.edu/about/_files/maps-and-directions/current-maps/campus-map.pdf &lt;br /&gt;
Campus map]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Dec 12th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alí Guzmán Adán, Universiteit Gent, Belgium&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Pizzetti and Cauchy formulae for higher dimensional surfaces: a&lt;br /&gt;
distributional approach&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; In this talk, we study Pizzetti-type formulas for Stiefel&lt;br /&gt;
manifolds and Cauchy-type formulas for the tangential Dirac operator&lt;br /&gt;
from a distributional perspective. First, we illustrate a general&lt;br /&gt;
distributional method for integration over manifolds in R^m defined by&lt;br /&gt;
means of k equations. We apply this method to derive an alternative&lt;br /&gt;
proof of the Pizzetti formulae for the real Stiefel manifolds&lt;br /&gt;
SO(m)/SO(m-k). Besides, a distributional interpretation of invariant&lt;br /&gt;
oriented integration is provided. In particular, we obtain a&lt;br /&gt;
distributional Cauchy theorem for the tangential Dirac operator on an&lt;br /&gt;
embedded (m-k)-dimensional smooth surface.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 11th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Arjendu K Pattanayak, Physics and Astronomy, Carleton College, Northfield, Minnesota&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Quantum entanglement and tunneling oscillations in a (few) many-body nonlinear spin system&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Quantum tunnelling permits recoherence or refocusing in real or phase space after the initial quantum state has seemingly delocalized, exhibiting so-called classically forbidden dynamics. For a nonlinearly interacting many-body spin system this interim state can be an entangled state. We report on recent results from investigations into this phenomenon for initially spin coherent pure states in the paradigmatic kicked top (vale Haake) system. This has a mixed regualar and chaotic phase space in the classical limit and exhibits the entanglement tunneling described above,  including coherent dynamics between phase-space stability islands;  here the interim state is maximally entangled. We map the dependence on various parameters including nonlinear spin and number of spins involved (focusing mostly on the remarkable special case N=4) using a metric that attempts to quantify the quality and rate of tunnelling. The calculations of tunneling rates using eigenvalues and eigenstates of the time evolution operator as a function of initial condition compared to classical space structures demonstrates several nontrivial ways in which quantum behavior transitions to classical as the size of the system grows.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Dec 4th, 2019, 4 - 5 pm in Keck 370, refreshments at 3:45 pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Raphael Drumond, Universidade Federal de Minas Gerais, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The basics of Quantum Darwinism (and its relationship with non-Markovianity)&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Some aspects of physical systems described by quantum &lt;br /&gt;
mechanics, most notably the possibility of violating a Bell inequality, &lt;br /&gt;
suggests (to some) or unavoidably implies (to others) that certain &lt;br /&gt;
properties of microscopic systems, like the precise values of position &lt;br /&gt;
and momentum of a fundamental particle, do not have an objective &lt;br /&gt;
reality. This strongly contrasts with the objectivity of properties of &lt;br /&gt;
everyday macroscopic systems like the (rough estimate of) position and &lt;br /&gt;
momentum of a baseball.  Now, how can this objectivity of the &lt;br /&gt;
macroscopic world emerge from a theory where, apparently, not all &lt;br /&gt;
aspects of physical systems are objective? The notion of quantum &lt;br /&gt;
Darwinism, put forward and popularized by Wojciech Zurek, is a path in &lt;br /&gt;
that direction.  In this talk I will discuss the main ideas behind &lt;br /&gt;
quantum Darwinism, explore it in some simple models, and briefly discuss &lt;br /&gt;
its relationship (or the lack of it) with the notion of non-Markovianity &lt;br /&gt;
of quantum dynamical systems.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, Nov 21th, 2019, 12:30 - 1:30 pm in Keck 370, refreshments from 12:15 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Sandu Popescu, University of Bristol, UK&#039;&#039;&#039; ====&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Exploring the limits of no-backward-in-time signaling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; One of the most routine observations that we make about our world is that we cannot signal backwards in time. So ubiquitous is this understanding that it is often taken as one of the basic laws of Nature. At first glance, this remark seems straightforward. However, as I will show, in probabilistic theories such as quantum mechanics, the consequences of such an assertion are far more involved. In fact, we will see that there is a surprising amount of liberty: some theories even allow the future to affect the past, nevertheless without signaling backwards in time.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, Nov 8th, 2019, 3 - 4 pm in Keck 171, refreshments from 2:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Fredrik Dahlqvist, University College London, UK&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;A probabilistic approach to floating point arithmetic&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Finite-precision floating point arithmetic introduces rounding errors which are traditionally bounded using a worst-case analysis. However, worst-case analysis might be overly conservative because worst-case errors can be extremely rare events in practice. Here we develop a probabilistic model of rounding errors with which it becomes possible to quantify the likelihood that the rounding error of an algorithm lies within a given interval. &lt;br /&gt;
&lt;br /&gt;
Given an input distribution, the model requires the distribution of rounding errors. We show how to exactly compute this distribution for low precision arithmetic. For high precision arithmetic we derive a simple but surprisingly useful approximation. The model is then entirely compositional: given a numerical program written in a simple imperative programing language we can recursively compute the distribution of rounding errors at each step and propagate it through each program instruction. This is done by applying a formalism originaly developed by Kozen to understand the semantics of probabilistic programs, for example how probability distributions gets transformed by assignments or &amp;quot;if then else&amp;quot; statements.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, Nov 6th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Jacques Pienaar, International Institute of Physics in Natal, Brazil&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The new question in quantum foundations: what is causality?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Work in quantum foundations has tended to concentrate on Bell&#039;s Theorem, &lt;br /&gt;
but recently a particular aspect of that theorem has taken on a life of &lt;br /&gt;
its own: the question of what &amp;quot;causality&amp;quot; means in quantum mechanics, &lt;br /&gt;
and how to model it. This movement has been driven in large part by &lt;br /&gt;
recent advances in causal modeling in the statistical and Artificial &lt;br /&gt;
Intelligence communities, which have had a heavy influence on quantum &lt;br /&gt;
causal modeling. These &amp;quot;classical&amp;quot; approaches tend to define causality &lt;br /&gt;
as a probabilistic and action-centered concept, which fits well with &lt;br /&gt;
modern information-theoretic treatments of quantum mechanics. However, &lt;br /&gt;
the classical approaches also tend to emphasize notions of underlying &lt;br /&gt;
determinism and objective mechanisms that do not sit so well in the &lt;br /&gt;
quantum context. In this talk I will step back from most of the &lt;br /&gt;
technical jargon and try to get to the heart of some of the conceptual &lt;br /&gt;
issues involved in &amp;quot;quantizing&amp;quot; the concept of causality, critically &lt;br /&gt;
reviewing some key findings, pointing out potential inconsistencies and &lt;br /&gt;
outlining possible directions for further inquiry into this fascinating &lt;br /&gt;
problem.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 18th, 2019, 12 - 1 pm in Keck 370, refreshments from 11:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Lev Vaidman, Alex Maguy-Glass Chair in Physics of Complex Systems, Tel Aviv University, Israel&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;The past of a quantum particle&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Textbooks of quantum mechanics lack the concept of the past of quantum systems. Few years ago I proposed to define the past of a quantum particle according to the trace it leaves. While in many cases this definition provides a reasonable description, for a nested Mach-Zehnder interferometer it leads to a picture seemingly contradicting common sense: the particle leaves a trace in a place through which it could not pass. I will discuss recent theoretical and experimental studies of this controversial issue.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Friday, October 11th, 2019, 1 - 2 pm in Keck 370, refreshments from 12:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Prof. Thomas Curtright, University of Miami&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Massive Dual Gravity Revisited&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; I will describe a highly speculative model of gravity as a massive,&lt;br /&gt;
pure spin 2 field, which is &amp;quot;dual&amp;quot; to the usual description in terms of&lt;br /&gt;
a spacetime metric tensor.&lt;br /&gt;
&lt;br /&gt;
In the dual description, for weak fields, the metric emerges as the&lt;br /&gt;
field strength of an underlying fundamental field.  More generally, if&lt;br /&gt;
the gravitational field is not weak, the metric emerges as a nonlinear&lt;br /&gt;
mixture involving the energy momentum tensor.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Wednesday, October 9th, 2019, 4 - 5 pm in Keck 370, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Alain Hénaut, Institut de Mathématiques de Bordeaux, Université de Bordeaux, France&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;On planar web geometry&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; Web geometry deals with foliations in general position. In the planar case and the complex setting, a $d$-web is given by the generic family of integral curves of an analytic or an algebraic differential equation $F(x,y,y&#039;)=0$ with $y&#039;$-degree $d$. Invariants of these configurations as abelian relations (related to Abel&#039;s addition theorem), Lie symmetries or Godbillon-Vey sequences are investigated. This viewpoint enlarges the qualitative study of differential equations and their moduli. In the nonsingular case and through the singularities, Cartan-Spencer and meromorphic connections methods will be used. Basic examples will be given from different domains including classic algebraic geometry and WDVV-equations. Standard results and open problems will be mentioned. Illustration of the interplay between differential and algebraic geometry, new results will be presented. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Thursday, September 5th, 2019, 4 - 5 pm in Keck 171, refreshments from 3:45 (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Nicole Yunger Halpern, Harvard-Smithsonian ITAMP (Institute for Theoretical Atomic, Molecular, and Optical Physics) Harvard University Department of Physics&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Entropic uncertainty relations for quantum-information scrambling&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; How violently do two quantum operators disagree? Different subfields of physics feature different notions of incompatibility: (i) In quantum information theory, uncertainty relations are cast in terms of entropies. These entropic uncertainty relations constrain measurement outcomes. (ii) Condensed matter and high-energy physics feature interacting quantum many-body systems, such as spin chains. A local perturbation, such as a Pauli operator on one side of a chain, spreads through many-body entanglement. The perturbation comes to overlap, and to disagree, with probes localized on the opposite side of the system. This disagreement signals that quantum information about the perturbation has scrambled, or become hidden in highly nonlocal correlations. I will unite these two notions of quantum operator disagreement, presenting an entropic uncertainty relation for quantum-information scrambling. The entropies are of distributions over weak and strong measurements’ possible outcomes. The uncertainty bound strengthens when a spin chain scrambles in numerical simulations. Hence the subfields—quantum information, condensed matter, and high-energy physics—can agree about when quantum operations disagree. Our relation can be tested experimentally with superconducting qubits, trapped ions, and quantum dots.&lt;br /&gt;
&lt;br /&gt;
NYH, Bartolotta, and Pollack, Comms. Phys. 2, 92 (2019). https://www.nature.com/articles/s42005-019-0179-8&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Monday, August 26, 2019, 7 - 8:30 pm, in Argyros Forum, Room 209 A&amp;amp;B, networking from 6:15 to 7pm (same room) ===&lt;br /&gt;
&lt;br /&gt;
==== &#039;&#039;Speaker:&#039;&#039; &#039;&#039;&#039;Frederick Eberhardt, Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology&#039;&#039;&#039; ====&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Title:&#039;&#039; &#039;&#039;&#039;Computing Causal Relations at Scale    or     Causality: From Aristotle through Computing to Zebrafish&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Abstract:&#039;&#039; What causes what? How do we untangle the “why” behind processes that regulate the brain, the climate or the economy? If “Correlation does not imply causation&amp;quot; is the standard mantra in science, how can we ever discover causal relationships behind the data? Will it ever be possible for intelligent AI to make its own deductions and predictions? In recent years researchers have developed mathematical techniques that give us the power to infer the underlying “why” behind scientific data. What’s more, we’ve learned that we can discover these causes without performing experiments. Starting with a little practical example with lightbulbs that can be worked out by hand we will see how the problem scales as the number of variables increases. To compute the neural connections in a zebrafish brain, high performance computing is essential.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;Bio:&#039;&#039; Frederick Eberhardt is Professor of Philosophy in the Division of the Humanities and Social Sciences at the California Institute of Technology. Before coming to Caltech he was Assistant Professor in the Philosophy-Neuroscience-Psychology (PNP) program and the Department of Philosophy at Washington University in St. Louis and a postdoc at the Institute of Cognitive and Brain Sciences at the University of California, Berkeley. As an undergraduate he attended the London School of Economics for a Bachelor in Philosophy &amp;amp; Mathematics. He received his PhD in philosophy from Carnegie Mellon University, where he also completed a Masters in Machine Learning.&lt;br /&gt;
&lt;br /&gt;
His research interests lie at the intersection of philosophy of science, machine learning and statistics. He is particularly interested in the development of methods for causal discovery from statistical data.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Previous Seminar talks ==&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2019]]&lt;br /&gt;
&lt;br /&gt;
* [[MPC Seminar 2018]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2017]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2016]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2015]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2014]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2013]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2012]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2011]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2010]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2009]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2008]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2007]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2006]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2005]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2004]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2003]]&lt;br /&gt;
&lt;br /&gt;
* [[MathCS Seminar 2002]]&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=Main_Page&amp;diff=3</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=Main_Page&amp;diff=3"/>
		<updated>2021-02-22T18:26:05Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;big&amp;gt;&#039;&#039;&#039;This is the main page of the Chapman University Math Wiki&#039;&#039;&#039;&amp;lt;/big&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Useful Links ==&lt;br /&gt;
[http://math.chapman.edu/ Faculty of Mathematics]&lt;br /&gt;
&lt;br /&gt;
The following web pages are dedicated to our Math-Physics-Computation (MPC) Seminar and other resources.&lt;br /&gt;
&lt;br /&gt;
* Our [[MPC Seminar]]&lt;br /&gt;
* [http://canvas.chapman.edu/ Canvas at Chapman University]&lt;br /&gt;
* MathSciNet https://mathscinet-ams-org.libproxy.chapman.edu/&lt;br /&gt;
* zbMATH Open https://www.zbmath.org/&lt;br /&gt;
* ArXiv Math https://arxiv.org/archive/math&lt;br /&gt;
* Chapman Library https://www1.chapman.edu/library/&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
* American Mathematical Society https://www.ams.org/home/page&lt;br /&gt;
* Mathematical Association of America https://www.maa.org/&lt;br /&gt;
* Association of Computing Machinery https://www.acm.org/&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
* Mathematics Genealogy Project https://genealogy.math.ndsu.nodak.edu/&lt;br /&gt;
* The MacTutor History of Mathematics Archive https://www-history.mcs.st-and.ac.uk/&lt;br /&gt;
* Encyclopedia of Integer Sequences https://www.research.att.com/~njas/sequences/&lt;br /&gt;
* [https://math.chapman.edu/~jipsen/structures Mathematical Structures Homepage]&lt;br /&gt;
* CoCalc: A powerful online computer algebra system https://cocalc.com&lt;br /&gt;
* Colab: A free online Jupyter notebook https://colab.research.google.com/&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
* Wikipedia [http://en.wikipedia.org/wiki/Mathematics Mathematics], [http://en.wikipedia.org/wiki/Computer_science Computer Science], [http://en.wikipedia.org/wiki/Physics Physics], [http://en.wikipedia.org/wiki/Computational_science Computational Science]&lt;br /&gt;
&lt;br /&gt;
* PlanetMath http://planetmath.org/&lt;br /&gt;
&lt;br /&gt;
* Wolfram Alpha http://www.wolframalpha.com&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
	<entry>
		<id>https://math.chapman.edu/mathcs/index.php?title=Main_Page&amp;diff=2</id>
		<title>Main Page</title>
		<link rel="alternate" type="text/html" href="https://math.chapman.edu/mathcs/index.php?title=Main_Page&amp;diff=2"/>
		<updated>2021-02-22T18:23:30Z</updated>

		<summary type="html">&lt;p&gt;Jipsen: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;big&amp;gt;&#039;&#039;&#039;This is the main page of the Chapman University Math Wiki&#039;&#039;&#039;&amp;lt;/big&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Useful Links ==&lt;br /&gt;
[http://math.chapman.edu/ Faculty of Mathematics]&lt;br /&gt;
&lt;br /&gt;
[http://www1.chapman.edu/SCS/CS/ School of Computational Science]&lt;br /&gt;
&lt;br /&gt;
The following web pages are dedicated to our Math Physics Computation Seminar and other resources.&lt;br /&gt;
&lt;br /&gt;
* Our [[MPC Seminar]]&lt;br /&gt;
* [http://canvas.chapman.edu/ Canvas at Chapman University]&lt;br /&gt;
* MathSciNet https://mathscinet-ams-org.libproxy.chapman.edu/&lt;br /&gt;
* zbMATH Open https://www.zbmath.org/&lt;br /&gt;
* ArXiv Math https://arxiv.org/archive/math&lt;br /&gt;
* Chapman Library https://www1.chapman.edu/library/&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
* American Mathematical Society https://www.ams.org/home/page&lt;br /&gt;
* Mathematical Association of America https://www.maa.org/&lt;br /&gt;
* Association of Computing Machinery https://www.acm.org/&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
* Mathematics Genealogy Project https://genealogy.math.ndsu.nodak.edu/&lt;br /&gt;
* The MacTutor History of Mathematics Archive https://www-history.mcs.st-and.ac.uk/&lt;br /&gt;
* Encyclopedia of Integer Sequences https://www.research.att.com/~njas/sequences/&lt;br /&gt;
* [https://math.chapman.edu/~jipsen/structures Mathematical Structures Homepage]&lt;br /&gt;
* CoCalc: A powerful online computer algebra system https://cocalc.com&lt;br /&gt;
* Colab: A free online Jupyter notebook https://colab.research.google.com/&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
* Wikipedia [http://en.wikipedia.org/wiki/Mathematics Mathematics], [http://en.wikipedia.org/wiki/Computer_science Computer Science], [http://en.wikipedia.org/wiki/Physics Physics], [http://en.wikipedia.org/wiki/Computational_science Computational Science]&lt;br /&gt;
&lt;br /&gt;
* PlanetMath http://planetmath.org/&lt;br /&gt;
&lt;br /&gt;
* Wolfram Alpha http://www.wolframalpha.com&lt;/div&gt;</summary>
		<author><name>Jipsen</name></author>
	</entry>
</feed>