歷史紀錄

110 學年度上學期・演講

2021/09/01 – 2022/01/31・共 12 場

2022 年 1 月3 場

202201/06週四 演講 Approximate 3-designs and partial decomposition of the Clifford group representations using transvections Dr. Tanmay SingalInstitute of Physics, Nicolaus Copernicus University 15:30 – 17:00 鴻經館 M107

 

線上演講連結:

(1) https://meet.google.com/ayr-hvnu-qyx  

(2) 開啟google meet並輸入下列代碼:ayr-hvnu-qyx

(3) 也可至中央大學鴻經館M107一起聽線上演講

 

Abstract:

We study a scheme to implement an asymptotic unitary 3-design. The scheme implements a random Pauli once followed by the implementation of a random transvection Clifford by using state twirling. Thus the scheme is implemented in the form of a quantum channel. We show that when this scheme is implemented k times, then, in the k→∞ limit, the overall scheme implements a unitary 3-design. This is proved by studying the eigendecomposition of the scheme: the +1 eigenspace of the scheme coincides with that of an exact unitary 3-design, and the remaining eigenvalues are bounded by a constant. Using this we prove that the scheme has to be implemented approximately O(m+log1/ϵ) times to obtain an ϵ-approximate unitary 3-design, where m is the number of qubits, and ϵ is the diamond-norm distance of the exact unitary 3-design. Also, the scheme implements an asymptotic unitary 2-design with the following convergence rate: it has to be sampled O(log1/ϵ) times to be an ϵ-approximate unitary 2-design. Since transvection Cliffords are a conjugacy class of the Clifford group, the eigenspaces of the scheme's quantum channel coincide with the irreducible invariant subspaces of the adjoint representation of the Clifford group. Some of the subrepresentations we obtain are the same as were obtained in J. Math. Phys. 59, 072201 (2018), whereas the remaining are new invariant subspaces. Thus we obtain a partial decomposition of the adjoint representation for 3 copies for the Clifford group. Thus, aside from providing a scheme for the implementation of unitary 3-design, this work is of interest for studying representation theory of the Clifford group, and the potential applications of this topic. The paper ends with open questions regarding the scheme and representation theory of the Clifford group.

 

 

[線上演講]_20220106演講_Dr. Tanmay Singal  (Institute of Physics, Nicolaus Copernicus University)

 

202201/04週二 演講 Applications of mathematics in FinTech : Crowdfunding and crowdsourcing 周世偉教授東吳大學財務工程與精算數學系 11:00 – 12:30 鴻經館 M116

 

Abstract:

In this talk, we will discuss several examples of applications of mathematics in FinTech. Why should we be excited about the FinTech. FinTech means “financial technology”. It provide a new way people pay, send money, borrow, lend, and invest. Crowdfunding and crowdsourcing are increasingly becoming household names.

There are two main types of motivation in this talk. Firstly, we generalize logic from mathematics. We define functions for reality problem. Find the algorithm to optimize of these cost functions. The calculus, linear algebra and statistics are the basis for a broad variety of algorithms. Secondly, the data analysis is a relatively new tendency in informatics. Training of prediction models is a very important work, especially for work with unstructured data. Furthermore the structured data published by Crowdsourcing platform is then made open and available for anyone to view or download. There are two approach to collection the data. First, we dig deeper into traditional qualitative content. Crowdsourcing platform provide structured data derived from such unstructured sources as project. Secondly, data sets can be formed as other processes. Transaction data such as consumer to consumer, or business to customer, web traffic for other purposes. An increasing number of businesses are turning to  business to business that offer solutions to common problems for indirect spend management.

 

20220104演講_周世偉教授 (東吳大學財務工程與精算數學系)

 

202201/04週二 演講 數學於財務工程與精算上的應用 吳政訓教授東吳大學財務工程與精算數學系 9:30 – 11:00 鴻經館 M116

 

Abstract:

數學為財務工程與精算的理論發展基礎。本演講將介紹財務工程以及精算與數學的關聯性,在數學系的課程學習中,如何規劃以及培養相關的數學專業能力,以利未來於財務工程與精算的職涯發展。最後,介紹北美精算協會(SOA)考試之注意事項以及流程規劃。

 

 

20220104演講_吳政訓教授 (東吳大學財務工程與精算數學系)

 

2021 年 12 月5 場

202112/28週二 演講 工作&數學 陳韋達博士鴻海數據分析師 10:00 – 11:30 鴻經館 M116

 

演講者:陳韋達博士

           鴻海數據分析師

           2017中央數學系博士

 

 

摘要:

從小到大,長輩們都說數學好很重要。

那進了數學系,真的人生以後就一帆風順了嗎?

不管你是數學好決定進到數學系,

不小心分數剛好掉到數學系,

糊里糊塗被騙填到數學系,

一定也會在意一個很重要的問題,

數學系畢業後可以找到哪些工作?

身為一個唸了很多年數學的數學系畢業生,

想趁這個機會跟大家分享一下,

我在職場上看到工作與數學之間的各種小故事。

 

 

20211228演講_陳韋達博士 (鴻海數據分析師)

 

202112/21週二 演講 隨機漫步與反脆弱的職涯 游明翰先生聯發資本投資處 10:00 – 12:00 鴻經館 M116

 

演講者: 游明翰先生

            現職-聯發資本投資處

            2007中央數學系畢業

            2009台大財金所碩士

 

摘要 : 2007中央數學系友返回母校與學弟妹分享數學人的金融財工之路。

 

 

20211221演講_游明翰先生 (聯發資本投資處)

 

202112/16週四 演講 Geometric measurements and its applications 黃彥彰教授國立臺南大學應用數學系 15:30 – 17:00 鴻經館 M107

 

Abstract:

In integral geometry, Hadwiger's theorem characterizes the valuations on convex bodies in the n-dimensional Euclidean spaces. Because of the recent development of artificial neural network, several applications of the related theorems to the geometric measurement of convex bodies in Image Processing has drawn attention. In this talk, I will introduce our recent works, showing the similar results of Hadwiger’s in the pseudo-hermitian manifolds. Those results support the role of the Heisenberg groups as the model case of pseudo-hermitian manifolds, and this, in the sense of Klein geometry, also provides an analogy of the Heisenberg groups to pseudo-hermitian manifolds as the Euclidean spaces to the Riemannian manifolds. Some applications to Image Processing in practice will also be introduced.

 

20211216演講_黃彥彰教授 (國立臺南大學應用數學系)

 

202112/14週二 演講 開啟你的職業生涯新篇章 Jon WuFSA, MAAA, CERA, MBA 10:00 – 11:30 鴻經館 M116

 

Jon Wu 是一名退休的保險主管,負責北美、拉丁美洲、亞太、愛爾蘭和英國地區的人壽和健康保險業務。他目前是企業金融和企業管理 (CFE) 考試委員會成員之一,以及精算師協會 (SOA) 國際分會副主席。他將以他的經驗,講講大學畢業後可以選擇的生活方式和精算專業工作的具體內容。

 

 

 

20211214演講_Jon Wu (FSA, MAAA, CERA, MBA)


演講投影片

 

202112/09週四 演講 Mixture estimate in fractional sense 吳恭儉教授國立成功大學數學系 15:30 – 17:00 鴻經館 M107

 

Abstract:

Mixture estimate arise in the study of well-posedness of solutions to the Boltzmann equations. This property says that some space regularity result will be obtained if one mixes the transport operator and an integral operator with velocity smoothing effect. In this talk we will present this property in fractional sense and apply it to the Boltzmann equation for very soft potentials.

 

20211209演講_吳恭儉教授 (國立成功大學數學系)

 

2021 年 11 月2 場

202111/18週四 演講 Distributed Compressive Sensing: Performance Analysis With Diverse Signal Ensembles 梁惟㨗教授東海大學應用數學系 15:30 – 17:00 鴻經館 M107

Abstract:

Distributed compressive sensing (DCS) is a framework that considers joint sparsity within signal ensembles along with multiple measurement vectors (MMVs). However, current theoretical bounds of the probability of perfect recovery for MMVs are derived to be essentially identical to that of a single MV (SMV). In this talk, I will introduce two key ingredients, called “Euclidean distances between signals” and “decay rate of signal ensemble,” to conduct a performance analysis of a deterministic signal model under the MMVs framework.

 

20211118演講_梁惟㨗教授 (東海大學應用數學系)

 

202111/04週四 演講 Robust score test for treatment effects for paired continuous and categorical data 鄒宗山教授國立中央大學統計研究所 15:30 – 17:00 鴻經館 M107

Abstract:

We develop a score statistic for testing the difference between two treatment effects for paired continuous and categorical responses. The test is legitimate in the presence of within-pair correlation and for general marginal distributions. Simulations show that our new method outperforms the generalized linear mixed model (GLMM) in terms of performance measures most concerned.

 

20211104演講_鄒宗山教授 (國立中央大學統計研究所)

2021 年 10 月1 場

202110/07週四 演講 On the Calderón’s Problems - Single and Multifrequency Measurements 鄒駿祥博士 15:30 – 17:00 鴻經館 M107

Abstract:詳如附件

 

20211007演講_鄒駿祥博士

 

2021 年 9 月1 場

202109/09週四 演講 [線上演講] Extremal combinatorics on excluded patterns 蔡昇甫博士Senior Software Engineer, Google 10:30 – 12:00 線上演講

Abstract:

In this talk, we will introduce the study of extremal function for excluded patterns including binary matrices and sequences, mostly focusing on the former i.e. Ex(n; P) defined as the maximum number of 1s an n-by-n binary matrix can have while avoiding another matrix P. We will briefly go over definitions, applications, and results developed over the last few decades. Then we will discuss our works on bounding parameters of minimally nonlinear matrices, the relatively small class of patterns that are almost linear. Finally, we will conclude the talk with potential future directions.

 

線上演講連結:

(1) https://meet.google.com/bzn-rukv-ifq

(2) 開啟google meet並輸入下列代碼:bzn-rukv-ifq

 

20210909演講_蔡昇甫博士 (Senior Software Engineer, Google)