{"id":60,"date":"2026-04-14T03:24:11","date_gmt":"2026-04-14T03:24:11","guid":{"rendered":"https:\/\/mrc-baku.org\/?page_id=60"},"modified":"2026-04-27T17:06:41","modified_gmt":"2026-04-27T17:06:41","slug":"seminars","status":"publish","type":"page","link":"https:\/\/mrc-baku.org\/index.php\/seminars\/","title":{"rendered":"MRC &#8211; Seminars"},"content":{"rendered":"\n<!DOCTYPE html>\n<html lang=\"en\">\n<head>\n<meta charset=\"UTF-8\">\n<meta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\">\n<title>Seminars \u2014 Mathematics Research Center<\/title>\n<link rel=\"preconnect\" href=\"https:\/\/fonts.googleapis.com\">\n<link href=\"https:\/\/fonts.googleapis.com\/css2?family=EB+Garamond:ital,wght@0,400;0,500;0,600;1,400;1,500&#038;family=DM+Mono:wght@300;400;500&#038;family=Outfit:wght@300;400;500;600&#038;display=swap\" rel=\"stylesheet\">\n<script>MathJax = { tex: { inlineMath: [[\"\\\\(\",\"\\\\)\"]] } };<\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/mathjax@3\/es5\/tex-chtml.js\" async><\/script>\n<style>\n:root {\n  --cream:#F5F0E8;--ink:#1A1610;--rust:#B84A2F;--gold:#C99A2E;\n  --slate:#3D4A5C;--mist:#E8EDF4;--rule:#C8BFA8;\n  --garamond:\"EB Garamond\",Georgia,serif;\n  --mono:\"DM Mono\",monospace;--sans:\"Outfit\",sans-serif;\n}\n*,*::before,*::after{box-sizing:border-box;margin:0;padding:0;}\nbody{background:#eee;padding:2rem;font-family:var(--garamond);color:var(--ink);}\n.sem-block{max-width:900px;margin:0 auto;background:var(--cream);border:1px solid var(--rule);box-shadow:4px 4px 0 var(--rule),8px 8px 0 #d8cdb8;overflow:hidden;}\n.sem-controls{display:flex;flex-wrap:wrap;gap:.75rem;align-items:center;padding:1.2rem 2.5rem;background:#EDE8DE;border-bottom:1px solid var(--rule);}\n.sem-search-wrap{flex:1;min-width:200px;position:relative;}\n.sem-search-wrap svg{position:absolute;left:.7rem;top:50%;transform:translateY(-50%);width:13px;height:13px;color:#9A8E80;pointer-events:none;}\n.sem-search{width:100%;padding:.55rem .75rem .55rem 2.1rem;font-family:var(--sans);font-size:.8rem;border:1px solid var(--rule);background:var(--cream);color:var(--ink);outline:none;transition:border-color .2s;}\n.sem-search:focus{border-color:var(--slate);}\n.sem-search::placeholder{color:#B0A898;}\n.sem-type-filters,.sem-year-filters{display:flex;flex-wrap:wrap;gap:.4rem;}\n.sem-type-btn,.sem-year-btn{font-family:var(--mono);font-size:.68rem;letter-spacing:.08em;padding:.4rem .75rem;border:1px solid var(--rule);background:var(--cream);color:#7A6E60;cursor:pointer;transition:all .15s;}\n.sem-type-btn:hover,.sem-year-btn:hover{border-color:var(--slate);color:var(--slate);}\n.sem-type-btn.active,.sem-year-btn.active{background:var(--slate);color:var(--cream);border-color:var(--slate);}\n.sem-type-btn.active.type-research{background:var(--rust);border-color:var(--rust);}\n.sem-type-btn.active.type-student{background:var(--gold);border-color:var(--gold);color:var(--ink);}\n.sem-count{font-family:var(--mono);font-size:.67rem;color:#9A8E80;letter-spacing:.05em;white-space:nowrap;}\n.sem-body{padding:2rem 2.5rem 2.5rem;}\n.sem-year-group{margin-bottom:2.5rem;}\n.sem-year-group:last-child{margin-bottom:0;}\n.sem-year-label{font-family:var(--mono);font-size:.7rem;letter-spacing:.18em;text-transform:uppercase;color:var(--rust);display:flex;align-items:center;gap:.7rem;margin-bottom:1rem;}\n.sem-year-label::after{content:\"\";flex:1;height:1px;background:var(--rule);}\n.sem-year-count{font-size:.6rem;background:var(--mist);color:var(--slate);padding:.1rem .45rem;letter-spacing:.06em;}\n.sem-entry{display:grid;grid-template-columns:160px 1fr;gap:0 1.5rem;padding:.9rem 0;border-bottom:1px solid #EAE3D4;align-items:start;}\n.sem-entry:last-child{border-bottom:none;}\n.sem-entry.hidden{display:none;}\n.sem-entry-left{display:flex;flex-direction:column;gap:.4rem;padding-top:.1rem;}\n.sem-date{font-family:var(--mono);font-size:.68rem;color:#7A6E60;letter-spacing:.03em;line-height:1.4;}\n.sem-badge{display:inline-block;font-family:var(--mono);font-size:.58rem;letter-spacing:.1em;text-transform:uppercase;padding:.15rem .5rem;width:fit-content;}\n.sem-badge-general{background:var(--mist);color:var(--slate);}\n.sem-badge-research{background:#FDECEA;color:var(--rust);}\n.sem-badge-student{background:#FBF5E6;color:#8A6800;}\n.sem-loc{font-family:var(--mono);font-size:.6rem;color:#9A8E80;letter-spacing:.02em;display:flex;align-items:flex-start;gap:.3rem;line-height:1.4;}\n.sem-loc svg{width:9px;height:9px;flex-shrink:0;margin-top:.15rem;opacity:.6;}\n.sem-title{font-family:var(--garamond);font-size:1.05rem;font-weight:500;line-height:1.35;margin-bottom:.2rem;color:var(--ink);}\n.sem-title a{color:var(--ink);text-decoration:none;border-bottom:1px solid var(--rule);transition:color .2s,border-color .2s;}\n.sem-title a:hover{color:var(--rust);border-bottom-color:var(--rust);}\n.sem-speaker{font-family:var(--garamond);font-style:italic;font-size:.9rem;color:#6A6058;margin-bottom:.4rem;}\n.sem-abstract-toggle{font-family:var(--mono);font-size:.62rem;letter-spacing:.08em;text-transform:uppercase;color:var(--rust);background:none;border:none;cursor:pointer;padding:0;transition:color .2s;}\n.sem-abstract-toggle:hover{color:var(--slate);}\n.sem-abstract{max-height:0;overflow:hidden;transition:max-height .35s ease;font-size:.93rem;line-height:1.7;color:#2E2820;}\n.sem-abstract.open{max-height:800px;}\n.sem-abstract p{margin-top:.6rem;}\n.sem-empty{font-family:var(--garamond);font-style:italic;font-size:1rem;color:#9A8E80;text-align:center;padding:2rem 0;display:none;}\n@media(max-width:640px){.sem-entry{grid-template-columns:1fr;gap:.4rem;}.sem-body{padding:1.5rem;}.sem-controls{padding:1rem 1.5rem;}}\n::-webkit-scrollbar{width:5px;}\n::-webkit-scrollbar-track{background:transparent;}\n::-webkit-scrollbar-thumb{background:var(--rule);}\n\/* \u2500\u2500 Registration Button \u2500\u2500 *\/\n.sem-reg-btn {\n  display: inline-block;\n  font-family: var(--mono);\n  font-size: 0.62rem;\n  font-weight: 500;\n  letter-spacing: 0.08em;\n  text-transform: uppercase;\n  text-decoration: none;\n  background: var(--slate);\n  color: var(--cream);\n  padding: 0.35rem 0.8rem;\n  margin-bottom: 0.6rem;\n  border-radius: 2px;\n  transition: background 0.2s;\n}\n.sem-reg-btn:hover {\n  background: var(--rust);\n  color: #fff;\n}\n<\/style>\n<!--\n  WORDPRESS BLOCK PATTERN \u2014 Seminars Page Title\n  Paste at the top of your Seminars page.\n  Shared .page-title-block CSS \u2014 paste once if already present.\n-->\n<style>\n.page-title-block {\n  max-width: 900px; margin: 0 auto 2rem;\n  background: var(--slate, #3D4A5C); color: var(--cream, #F5F0E8);\n  padding: 2.8rem 3rem 2.2rem;\n  position: relative; overflow: hidden;\n  border: 1px solid var(--rule, #C8BFA8);\n  box-shadow: 4px 4px 0 var(--rule, #C8BFA8), 8px 8px 0 #d8cdb8;\n}\n.page-title-block::before {\n  content: attr(data-wm);\n  position: absolute; right: -10px; bottom: -20px;\n  font-family: 'EB Garamond', Georgia, serif;\n  font-size: 9rem; font-weight: 500;\n  color: rgba(255,255,255,0.04); pointer-events: none; line-height: 1;\n  letter-spacing: 0.08em;\n}\n.page-title-tag {\n  font-family: 'DM Mono', monospace; font-size: 0.68rem;\n  letter-spacing: 0.18em; text-transform: uppercase;\n  color: var(--gold, #C99A2E); margin-bottom: 0.6rem;\n  display: flex; align-items: center; gap: 0.5rem;\n}\n.page-title-tag::before {\n  content: ''; display: inline-block;\n  width: 20px; height: 1px; background: var(--gold, #C99A2E);\n}\n.page-title-block h1 {\n  font-family: 'EB Garamond', Georgia, serif;\n  font-size: clamp(1.8rem, 3.5vw, 2.5rem);\n  font-weight: 500; line-height: 1.2; margin-bottom: 0.4rem;\n}\n.page-title-sub {\n  font-family: 'EB Garamond', Georgia, serif; font-style: italic;\n  font-size: 0.95rem; color: rgba(245,240,232,0.6);\n}\n@media (max-width: 620px) {\n  .page-title-block { padding: 2rem 1.5rem 1.8rem; margin-bottom: 1.5rem; }\n}\n<\/style>\n\n<div class=\"page-title-block\" data-wm=\"SEM\">\n  <div class=\"page-title-tag\">Mathematics Research Center \u00b7 ASOIU<\/div>\n  <h1>Seminars<\/h1>\n  <p class=\"page-title-sub\">General, research, and student seminars at MRC<\/p>\n<\/div>\n<\/head>\n<body>\n<div class=\"sem-block\">\n  <div class=\"sem-controls\">\n<div class=\"sem-search-wrap\" style=\"display: flex; align-items: center; height: 32px; border: 1px solid #B84A2F; border-radius: 6px; background: #fff; padding: 0 12px; width: 100%; max-width: 300px;\">\n  \n  <input \n    class=\"sem-search\" \n    id=\"sem-search\" \n    type=\"text\" \n    placeholder=\"Search by speaker or keyword\u2026\" \n    autocomplete=\"off\" \n    style=\"flex: 1; border: none !important; outline: none !important; background: transparent !important; font-size: 0.85rem; padding: 0 !important; height: 100%; box-shadow: none !important;\"\n  ><\/div>   \n<div class=\"sem-type-filters\">\n      <button class=\"sem-type-btn active\" data-type=\"all\">All types<\/button>\n      <button class=\"sem-type-btn type-general\" data-type=\"general\">General<\/button>\n      <button class=\"sem-type-btn type-research\" data-type=\"research\">Research<\/button>\n      <button class=\"sem-type-btn type-student\" data-type=\"student\">Student<\/button>\n    <\/div>\n    <div class=\"sem-year-filters\"><button class=\"sem-year-btn active\" data-year=\"all\">All<\/button><button class=\"sem-year-btn\" data-year=\"2026\">2026<\/button><button class=\"sem-year-btn\" data-year=\"2025\">2025<\/button><button class=\"sem-year-btn\" data-year=\"2024\">2024<\/button><\/div>\n   <!-- <span class=\"sem-count\" id=\"sem-count\"><\/span> -->\n  <\/div>\n  <div class=\"sem-body\">\n\n    <div class=\"sem-year-group\" data-year=\"2026\">\n      <div class=\"sem-year-label\">2026<\/div>\n\n<div class=\"sem-entry\" data-year=\"2026\" data-search=\"olcay coskun equivalences on primitive dirichlet characters\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 30, 2026<\/div>\n          <span class=\"sem-badge sem-badge-research\">Research Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>13:30 \u00b7 MRC Seminar Room<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/index.php\/research-seminar-by-olcay-coskun-2\/\">Equivalences on Primitive Dirichlet Characters<\/a><\/div>\n          <div class=\"sem-speaker\">Olcay Co\u015fkun<\/div>\n          \n        <\/div>\n      <\/div>\n <!-- NEXT -->\n<!-- <a href=\"https:\/\/docs.google.com\/forms\/d\/e\/1FAIpQLSf9UwM6GP7DHhMaJCqiqgzjReuHhTa3acVowBz1pKgyJ2ywBQ\/viewform?usp=header\" class=\"sem-reg-btn\" target=\"_blank\" rel=\"noopener\">Register Here \u2192<\/a> -->\n\n\n<div class=\"sem-entry\" data-year=\"2026\" data-search=\"ergun yalcin, Bilkent university worst-case examples for the computation of persistent homology\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 21, 2026<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:15 \u00b7 MRC @ UFAZ 308<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/index.php\/general-seminar-by-ergun-yalcin\/\">Worst-case examples for the computation of persistent homology<\/a><\/div>\n          <div class=\"sem-speaker\">Erg\u00fcn Yal\u00e7\u0131n, Bilkent University T\u00fcrkiye<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-0\"><p>Topological Data Analysis via persistent homology is a new emerging area of data analysis that uses methods from simplicial topology. The persistent homology of a data set can be calculated using a simple algorithm called reduction algorithm. In this talk, I will present a new construction of worst-case examples for this algorithm. Our constructions are similar to the worst-case examples introduced by Morozov, but replace the single-triangle arrangement with a strip formed by base and fin triangles. This structure allows us to give an explicit algorithm for their construction and to perform experiments comparing the runtime of different variants of the reduction algorithm. We further show that, after suitable edge and triangle subdivisions,\nthese strip examples remain worst-case and can be realized as clique complexes of filtered graphs, and hence as Vietoris&#8211;Rips complexes of finite point clouds for a sequence of scale parameters.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n<!-- next -->\n<div class=\"sem-entry\" data-year=\"2026\" data-search=\"ertan elma dirichlet l-functions ii\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 16, 2026<\/div>\n          <span class=\"sem-badge sem-badge-research\">Research Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>13:30 \u00b7 MRC<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/index.php\/research-seminar-by-turker-biyikoglu\/\">Castelnuovo-Mumford regularity of graphs<\/a><\/div>\n          <div class=\"sem-speaker\">T\u00fcrker B\u0131y\u0131ko\u011flu<\/div>\n          \n        <\/div>\n      <\/div>\n \n<!-- next -->\n <div class=\"sem-entry\" data-year=\"2026\" data-search=\"nijat aliyev, baku higher oil school subspace method for approximation of h-infinity norms of large-scale control systems\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 10, 2026<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:00 \u00b7 MRC @ UFAZ 101<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/general-seminar-by-yagub-n-aliyev-ada-university\/\">Subspace Method for Approximation of \\(H\\)-infinity Norms of Large-Scale Control Systems<\/a><\/div>\n          <div class=\"sem-speaker\">Nijat Aliyev, Baku Higher Oil School<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"0\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-0\"><p>We are concerned with the computation of the \\(H\\)-infinity norm for \\(H\\)-infinity functions of the form \\(H(s) = C(s)D(s)^{-1}B(s)\\), where the middle factor is the inverse of an analytic matrix- valued function, and \\(C(s)\\), \\(B(s)\\) are analytic functions mapping to short-and-fat and tall- and-skinny matrices, respectively. For instance, transfer functions of descriptor systems and delay systems fall into this family. We focus on the case where the middle factor is very large. We propose a subspace projection method to obtain approximations of the function H where the middle factor is of much smaller dimension. The \\(H\\)-infinity norms are computed for the resulting reduced functions, then the subspaces are refined by means of the optimal points on the imaginary axis where the largest singular value of the reduced function is maximized. The subspace method is designed so that certain Hermite interpolation properties hold between the largest singular values of the original and reduced functions. This leads to a superlinearly convergent algorithm with respect to the subspace dimension, which we prove and illustrate on various numerical examples.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n     \n <div class=\"sem-entry\" data-year=\"2026\" data-search=\"ertan elma dirichlet l-functions ii\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 9, 2026<\/div>\n          <span class=\"sem-badge sem-badge-research\">Research Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>13:30 \u00b7 MRC @ UFAZ 101<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/research-seminar-by-ertan-elma\/\">Dirichlet L-functions II<\/a><\/div>\n          <div class=\"sem-speaker\">Ertan Elma<\/div>\n          \n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2026\" data-search=\"yagub n. aliyev, ada university the number of inscribed and circumscribed polygons\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">March 12, 2026<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:00 \u00b7 MRC @ UFAZ 101<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/general-seminar-by-yagub-n-aliyev-ada-university\/\">The number of inscribed and circumscribed polygons<\/a><\/div>\n          <div class=\"sem-speaker\">Yagub N. Aliyev, ADA University<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"0\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-0\"><p>We study Poncelet type problem about the number of convex \\(n\\)-gons inscribed into one convex \\(n\\)-gon and circumscribed around another convex \\(n\\)-gon. It is proved that their number is at most 4. The result is generalized for spherical and hyperbolic geometries. This contrasts with Poncelet type porisms where usually infinitude of such polygons is proved, provided that one such polygon already exists. An inequality involving ratio of lengths of line segments is used. Alternative way of using Maclaurin\u2013Braikenridge&#8217;s conic generation method generalized by Brianchon is also discussed. Properties related to constructibility with straightedge and compass are also studied. A new proof, based on mathematical induction, of generalized Maclaurin\u2013Braikenridge&#8217;s theorem is given. We also gave examples of regular polygons for which number 4 is realized.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2026\" data-search=\"ertan elma dirichlet l-functions i\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">March 5, 2026<\/div>\n          <span class=\"sem-badge sem-badge-research\">Research Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>13:30 \u00b7 MRC @ UFAZ 102<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/research-seminar-by-ertan-elma\/\">Dirichlet L-functions I<\/a><\/div>\n          <div class=\"sem-speaker\">Ertan Elma<\/div>\n          \n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2026\" data-search=\"olcay co\u015fkun from symmetries to functors: an overview of functorial representation theory\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">February 26, 2026<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:00 \u00b7 MRC @ UFAZ 203<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/general-seminar-by-olcay-coskun-2\/\">From symmetries to functors: An overview of functorial representation theory<\/a><\/div>\n          <div class=\"sem-speaker\">Olcay Co\u015fkun<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"2\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-2\"><p>The representation theory of finite groups was introduced at the end of the 1800s with the work of Frobenius and Schur. It was developed further through contributions by Brauer, Burnside, Green and others. Beginning around the mid-20th century, category theory started to develop and, together with the abstraction techniques it provides, rapidly spread into other fields. The aim of this talk is to describe the evolution of functorial representation theory and to discuss the theory of biset functors, one of the most effective techniques of this new style of representation theory, and to describe various applications of this technique.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2026\" data-search=\"olcay co\u015fkun sorting and generating reduced words of permutations\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">February 19, 2026<\/div>\n          <span class=\"sem-badge sem-badge-research\">Research Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>13:30 \u00b7 MRC @ UFAZ 405<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/research-seminar-by-olcay-coskun\/\">Sorting and generating reduced words of permutations<\/a><\/div>\n          <div class=\"sem-speaker\">Olcay Co\u015fkun<\/div>\n          \n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2026\" data-search=\"olcay co\u015fkun functor of \\(p\\)-permutation modules\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">February 12, 2026<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:00 \u00b7 MRC @ UFAZ 101<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/general-seminar-by-olcay-coskun\/\">Functor of \\(p\\)-permutation modules<\/a><\/div>\n          <div class=\"sem-speaker\">Olcay Co\u015fkun<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"4\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-4\"><p>\\(p\\)-permutation modules provide an algebraic link between permutation representations and modular representation theory. In this talk we will (i) recall the definition and main properties of \\(p\\)-permutation modules over a field \\(k\\), (ii) explain how the assignment \\(G\\mapsto\\) (Grothendieck group of the category of \\(p\\)-permutation \\(kG\\)-modules) naturally has the structure of a (fibered) biset functor, and (iii) state and sketch proofs of the main structural results describing composition factors as (fibered) biset functor. This is a joint work with Robert Boltje and Cisil Karakguzel.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2026\" data-search=\"k\u00fcbra benli, bogazici university, t\u00fcrkiye prime numbers in residue classes\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">January 29, 2026<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:00 \u00b7 MRC @ UFAZ 101<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/general-seminar-by-kubra-benli-bogazici-university-turkiye\/\">Prime numbers in residue classes<\/a><\/div>\n          <div class=\"sem-speaker\">K\u00fcbra Benli, Bogazici University, T\u00fcrkiye<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"5\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-5\"><p>Prime numbers and their distribution is in the heart of analytic number theory. This talk will be about counting prime numbers with certain restrictions. We will cover some elementary techniques for detecting primes belonging to certain subsets of all residue classes modulo primes. And then we will discuss some classical analytic methods and their implications.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n    <\/div>\n    <div class=\"sem-year-group\" data-year=\"2025\">\n      <div class=\"sem-year-label\">2025<\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"firtina k\u00fc\u00e7\u00fck \\(p\\)-adic artin formalism and factorization of algebraic adjoint \\(p\\)-adic \\(l\\)-functions\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">December 18, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:00 \u00b7 MRC @ UFAZ 101<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/general-seminar-by-firtina-kucuk\/\">\\(p\\)-adic Artin formalism and factorization of algebraic adjoint \\(p\\)-adic \\(L\\)-functions<\/a><\/div>\n          <div class=\"sem-speaker\">Firtina K\u00fc\u00e7\u00fck<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"6\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-6\"><p>In this talk, we will briefly review Artin formalism and its \\(p\\)-adic variant. Artin formalism provides a factorization of \\(L\\)-functions whenever the associated Galois representation decomposes. We will explain why the \\(p\\)-adic Artin formalism becomes a nontrivial problem when there are no critical \\(L\\)-values. In particular, we will focus on the case where the Galois representation arises from the Rankin\u2013Selberg product of a newform with itself. We will present the results in this direction, including our result in the case where the modular form in question is \\(p\\)-non-ordinary, and discuss future directions.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"erkko lehtonen, khalifa university, uae the associative spectrum of a binary operation\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">December 1, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:00 \u00b7 MRC @ UFAZ 101<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/general-seminar-by-erkko-lehtonen-khalifa-university-uae\/\">The associative spectrum of a binary operation<\/a><\/div>\n          <div class=\"sem-speaker\">Erkko Lehtonen, Khalifa University, UAE<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"7\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-7\"><p>Associativity is a well-known property of some binary operations. Instead of the binary classification into associative and non-associative operations, more refined approaches for quantifying the degree of associativity have been proposed. One such method is the so-called associative spectrum, introduced by Csakany and Waldhauser in 2000. The associative spectrum of a groupoid \\(G\\) is an integer sequence whose \\(n\\)-th term equals the number of distinct term operations induced on \\(G\\) by the bracketings of \\(n\\) variables. In this talk, we provide a brief introduction to the associative spectrum, and give an overview on our work on the associative spectra of graph algebras and quasigroups. A quasigroup is a groupoid satisfying the condition that for all elements \\(a\\) and \\(b\\), there exist unique elements \\(x\\) and \\(y\\) such that \\(xa=b\\) and \\(ay=b\\). This talk is based on joint work with Tamas Waldhauser (University of Szeged).<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"lola thompson, utrecht university, netherlands on a conjecture of erdos, granville, pomerance, and spiro\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">November 13, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:00 \u00b7 MRC @ UFAZ 101<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/general-seminar-by-lola-thompson-utrecht-university-netherlands\/\">On a conjecture of Erdos, Granville, Pomerance, and Spiro<\/a><\/div>\n          <div class=\"sem-speaker\">Lola Thompson, Utrecht University, Netherlands<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"8\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-8\"><p>Let \\(s(n)\\) denote the sum of proper divisors of an integer \\(n\\). The function \\(s(n)\\) has been studied for thousands of years, due to its connection with the perfect numbers. In 1992, Erdos, Granville, Pomerance, and Spiro (EGPS) conjectured that if \\(\\mathcal{A}\\) is a set of integers with asymptotic density zero then \\(s^{-1}(\\mathcal{A})\\) also has asymptotic density zero. This has been confirmed for certain specific sets \\(\\mathcal{A}\\), but remains open in general. In this talk, we will give a survey of recent progress towards the EGPS conjecture. This talk is based on joint work with Kubra Benli, Giulia Cesana, Cecile Dartyge, Charlotte Dombrowsky, Paul Pollack, and Carl Pomerance.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"azer akhmedov, north dakota state university, usa tiles of groups\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">November 6, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:00 \u00b7 MRC @ UFAZ 406<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/general-seminar-by-azer-akhmedov\/\">Tiles of Groups<\/a><\/div>\n          <div class=\"sem-speaker\">Azer Akhmedov, North Dakota State University, USA<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"9\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-9\"><p>A tile of a countable group is a finite subset whose non-overlapping left translations cover the entire group. We will review some recent results (including works related to Fuglede Conjecture) about the tilings of groups. It is unknown whether, for every countable group \\(G\\), any finite subset \\(K\\subset G\\) is contained in a tile of \\(G\\). We prove this for hyperbolic groups (in the sense of Gromov).<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"ertan elma a discrete mean value of the riemann zeta function and its derivatives\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">October 23, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:00 \u00b7 MRC @ UFAZ 101<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/general-seminar-by-ertan-elma\/\">A Discrete Mean Value of the Riemann Zeta Function and its Derivatives<\/a><\/div>\n          <div class=\"sem-speaker\">Ertan Elma<\/div>\n          \n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"t\u00fcrker biyikoglu graph entropy, degree assortativity, and hierarchical structures in networks\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">October 9, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:00 \u00b7 MRC @ UFAZ 101<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\"><a href=\"https:\/\/mrc-baku.org\/general-seminar-by-turker-biyikoglu\/\">Graph entropy, degree assortativity, and hierarchical structures in networks<\/a><\/div>\n          <div class=\"sem-speaker\">T\u00fcrker Biyikoglu<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"11\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-11\"><p>There are various network descriptors for the understanding of complex networks. A major theme is to understand the relations between network descriptors and their connection to the networks function. The aim of this talk is to rigorously connect several network descriptors using mathematical tools. The central notion is entropy, which plays a fundamental role in quantifying disorder and complexity. Entropy is also closely related to the spectral radius of the graph adjacency matrix. Another central player is the so-called Randic index, introduced in the 1970s to study chemical compounds. We will see that the topological entropy is bounded from below by the Randic index. In social networks, vertices with high degree are often adjacent to other high-degree vertices, a tendency referred to as assortativity. We finish with breadth-first search ordering with decreasing degrees that characterizes the maximization of all these notions. This is a joint work with Fatihcan Atay, Bilkent University, Ankara.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"olcay coskun the burnside ring of a finite group\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 24, 2025<\/div>\n          <span class=\"sem-badge sem-badge-student\">Student Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>12:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">The Burnside Ring of a Finite Group<\/div>\n          <div class=\"sem-speaker\">Olcay Coskun<\/div>\n          \n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"t\u00fcrker biyikoglu pigeon hole ii\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 17, 2025<\/div>\n          <span class=\"sem-badge sem-badge-student\">Student Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>12:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Pigeon Hole II<\/div>\n          <div class=\"sem-speaker\">T\u00fcrker Biyikoglu<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"13\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-13\"><p>I will present some commonly used proof methods and techniques in discrete mathematics and graph theory. We will see several nice theorems and their smart proofs based on few basic definitions and such techniques. This week we continue with the pigeon hole principle. At the end of the lecture, there will be a problem solving session from journals such as American Mathematical Monthly, Elemente der Mathematik, and Mathematics Magazine.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"volker genz, institut des hautes \u00e9tudes scientifiques, france crystals and cluster algebras\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 17, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>15:00 \u00b7 Online<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Crystals and Cluster Algebras<\/div>\n          <div class=\"sem-speaker\">Volker Genz, Institut des Hautes \u00c9tudes Scientifiques, France<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"14\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-14\"><p>Cluster algebras offer a unifying framework that connects a diverse range of mathematical areas, including representation theory, string theory, Poisson geometry, integrable systems, knot theory, and combinatorics. In this talk, we will give a gentle introduction to cluster algebras, tracing their origins in representation theory and highlighting recent developments that connect cluster structures with crystal operators.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"christiaan j. f. van de ven, tno, netherlands advanced concepts in mathematical physics: an operator algebraic approach\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 14, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>13:30 \u00b7 Online<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Advanced concepts in Mathematical Physics: an operator algebraic approach<\/div>\n          <div class=\"sem-speaker\">Christiaan J. F. van de Ven, TNO, Netherlands<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"15\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-15\"><p>In this talk, I will give an overview of my research interests and current projects within the field of modern Mathematical Physics. A central focus is the mathematical derivation of the foundations of quantum mechanics. In particular, I highlight the concept of asymptotic emergence, a rigorous mathematical framework for understanding the classical and macroscopic limits of quantum systems. Key topics include spontaneous symmetry breaking, phase transitions, and entropy, explored through the lens of strict deformation quantization of Poisson manifolds, C*-algebras, and large deviation theory.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"ertan elma an introduction to arithmetic functions ii\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 10, 2025<\/div>\n          <span class=\"sem-badge sem-badge-student\">Student Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">An Introduction to Arithmetic Functions II<\/div>\n          <div class=\"sem-speaker\">Ertan Elma<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"16\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-16\"><p>In this second talk of the series, we will continue with some further properties of the Mobius function such as the Mobius Inversion Formula. Then we will see some other arithmetic functions such as the divisor function and the Euler totient function. If time permits, we will start considering the summatory functions of these functions and cover a technique called partial summation.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"olcay coskun finite groups, their actions and burnside rings\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 4, 2025<\/div>\n          <span class=\"sem-badge sem-badge-student\">Student Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>12:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Finite groups, their actions and Burnside rings<\/div>\n          <div class=\"sem-speaker\">Olcay Coskun<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"17\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-17\"><p>In this series of lectures, we introduce finite group actions and Burnside rings. We begin with basic definitions, explore concrete examples, and cover operations such as the induction and restriction of group actions.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"nika salia, king fahd university, saudi arabia which equations, sets, (hyper)graphs, and polynomials are extremal?\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">April 2, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>14:00 \u00b7 Institute of Education<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Which Equations, Sets, (Hyper)Graphs, and Polynomials Are Extremal?<\/div>\n          <div class=\"sem-speaker\">Nika Salia, King Fahd University, Saudi Arabia<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"18\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-18\"><p>In this talk, we will explore recent advances in combinatorics and graph theory, with a focus on stability results, extremal problems, and the structural properties of discrete objects. We will introduce a stability version of Dirac&#8217;s classical theorem, providing a full characterization of near-Hamiltonian graphs, and discuss extensions of Posa&#8217;s theorem to hypergraphs. Additionally, I will present the resolution of a longstanding conjecture by Hakimi and Schmeichel on the maximum number of pentagons in planar graphs. Further, I will highlight connections between combinatorics and algebra, including results on intersecting families of polynomials over finite fields and higher-order extensions of Schur&#8217;s theorem.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"keegan jonathan flood, unidistance suisse, switzerland jets, differential operators, and principal symbols in noncommutative geometry\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">March 28, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>15:00 \u00b7 Online<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Jets, differential operators, and principal symbols in noncommutative geometry<\/div>\n          <div class=\"sem-speaker\">Keegan Jonathan Flood, UniDistance Suisse, Switzerland<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"19\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-19\"><p>Classically, jet bundles provide the framework for variational calculus as well as for both the Lagrangian and the Hamiltonian formalism in physics. In this talk, we will be concerned with the extension of jet theory to the noncommutative setting. Noncommutative differential geometry generalizes classical differential geometry by replacing the commutative algebra \\(C^{\\infty}(M)\\) of smooth functions on a smooth manifold \\(M\\) with an arbitrary unital associative algebra \\(A\\) over a commutative ring \\(\\mathbb{k}\\). We will see that this data is sufficient to construct, via homological algebra and category theory, a generalization of the classical notion of jet to this noncommutative setting. In particular, we will discuss differential operators and their corresponding principal symbols.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"waqar ali shah, university of california, santa barbara, usa towards the bloch\u2013kato conjecture for gsp6\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">March 17, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>09:30 \u00b7 Online<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Towards the Bloch\u2013Kato conjecture for GSp6<\/div>\n          <div class=\"sem-speaker\">Waqar Ali Shah, University of California, Santa Barbara, USA<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"20\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-20\"><p>One of the central problems in number theory is the Birch and Swinnerton-Dyer conjecture, which asserts that the order of vanishing of the L-function of a rational elliptic curve \\(E\\) at the central value coincides with the rank of its Mordell-Weil group. A far-reaching generalization is the Bloch\u2013Kato conjecture. In this talk, we recall the Bloch\u2013Kato conjecture in the setting of GSp6-Shimura varieties and present the construction of an Euler system using a novel method that overcomes a major obstacle. As a consequence, we obtain the first non-trivial result towards the Bloch\u2013Kato conjecture in this setting.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"t\u00fcrker biyikoglu pigeon hole principle\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">March 13, 2025<\/div>\n          <span class=\"sem-badge sem-badge-student\">Student Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Pigeon Hole Principle<\/div>\n          <div class=\"sem-speaker\">T\u00fcrker Biyikoglu<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"21\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-21\"><p>I will present some commonly used proof methods and techniques in discrete mathematics and graph theory. We will see several nice theorems and their smart proofs based on few basic definitions and such techniques. This week we start with the pigeon hole principle. At the end of the lecture, there will be a problem solving session from journals such as American Mathematical Monthly, Elemente der Mathematik, and Mathematics Magazine.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"elchin hasanalizade, ada university multiplicative functions \\(k\\)-additive on hexagonal numbers\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">March 11, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:30 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Multiplicative functions \\(k\\)-additive on hexagonal numbers<\/div>\n          <div class=\"sem-speaker\">Elchin Hasanalizade, ADA University<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"22\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-22\"><p>Characterization of the identity function using functional equations has been actively studied by many authors. In 1992, Claudia Spiro introduced the concept of additive uniqueness. A set \\(E\\subseteq\\mathbb{N}\\) is called an additive uniqueness set of a set of arithmetic functions \\(\\mathcal{F}\\) if there is exactly one element \\(f\\in\\mathcal{F}\\) which satisfies \\(f(m+n)=f(m)+f(n)\\) for all \\(m,n\\in E\\). In the present talk, we show that for \\(k\\ge 3\\) the set of all nonzero hexagonal numbers is a new \\(k\\)-additive uniqueness set for the collection of multiplicative functions. This is a joint work with Poo-Sung Park (Kyungnam University, Republic of Korea) and Emil Inochkin (ADA University, Azerbaijan).<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2025\" data-search=\"ertan elma an introduction to arithmetic functions\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">March 6, 2025<\/div>\n          <span class=\"sem-badge sem-badge-student\">Student Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">An Introduction to Arithmetic Functions<\/div>\n          <div class=\"sem-speaker\">Ertan Elma<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"23\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-23\"><p>In this series of talks, we will define some commonly used arithmetic functions in number theory such as the Mobius function, Euler totient function and the divisor function, and we will cover their elementary properties. The talks will be self-contained and will not require a prerequisite.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n              <div class=\"sem-entry\" data-year=\"2025\" data-search=\"deniz yilmaz, bilkent university, t\u00fcrkiye diagonal \\(p\\)-permutation functors and local-global conjectures in block theory\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">January 23, 2025<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Diagonal \\(p\\)-permutation functors and local-global conjectures in block theory<\/div>\n          <div class=\"sem-speaker\">Deniz Yilmaz, Bilkent University, T\u00fcrkiye<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"25\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-25\"><p>The local-global principle in modular representation theory asserts that the invariants of blocks of finite groups are determined by the invariants of local subgroups. There are several outstanding conjectures revolving around this principle. Alperin&#8217;s block-wise weight conjecture (1987) predicts that the number of simple modules of a block is equal to the number of its weights. The finiteness conjectures of Donovan (1980) and Puig (1982) state that there are only finitely many blocks of finite groups with a given defect group, up to Morita and splendid Morita equivalence, respectively. In this talk, we prove a finiteness theorem in the spirit of Donovan&#8217;s and Puig&#8217;s conjectures, in terms of functorial equivalences. We also give a reformulation of Alperin&#8217;s conjecture in terms of diagonal \\(p\\)-permutation functors. Some parts of this work are joint with Boltje and Bouc.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n    <\/div>\n    <div class=\"sem-year-group\" data-year=\"2024\">\n      <div class=\"sem-year-label\">2024<\/div>\n      <div class=\"sem-entry\" data-year=\"2024\" data-search=\"ertan elma a discrete mean value of the riemann zeta function and its derivatives\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">December 26, 2024<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">A Discrete Mean Value of the Riemann Zeta Function and its Derivatives<\/div>\n          <div class=\"sem-speaker\">Ertan Elma<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"26\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-26\"><p>In this talk, we will discuss an estimate for a discrete mean value of the Riemann zeta function and its derivatives multiplied by Dirichlet polynomials. Assuming the Riemann Hypothesis, we obtain a lower bound for the \\(2k\\)-th moment of all the derivatives of the Riemann zeta function evaluated at its nontrivial zeros. This is based on a joint work with Kubra Benli and Nathan Ng.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2024\" data-search=\"olcay coskun finite group representations i\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">December 24, 2024<\/div>\n          <span class=\"sem-badge sem-badge-student\">Student Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Finite Group Representations I<\/div>\n          <div class=\"sem-speaker\">Olcay Coskun<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"27\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-27\"><p>This is the first session in a seminar series dedicated to exploring finite groups and their representations. In this introductory session, we will cover foundational concepts and outline our plans for the upcoming semester.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2024\" data-search=\"ruslan muslumov, ada university simple functors over the green biset functor of section burnside rings ii\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">November 27, 2024<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Simple functors over the Green biset functor of section Burnside rings II<\/div>\n          <div class=\"sem-speaker\">Ruslan Muslumov, ADA University<\/div>\n          \n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2024\" data-search=\"ruslan muslumov, ada university simple functors over the green biset functor of section burnside rings i\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">November 22, 2024<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Simple functors over the Green biset functor of section Burnside rings I<\/div>\n          <div class=\"sem-speaker\">Ruslan Muslumov, ADA University<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"29\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-29\"><p>Biset functors over a commutative and unitary ring \\(k\\) provide a powerful framework for studying finite groups and their actions. The biset category, whose objects are finite groups and morphism sets are given by Grothendieck groups \\(B(G,H)\\) of finite \\((G,H)\\)-bisets, serves as the foundation for this theory. Serge Bouc made significant contributions by introducing the slice Burnside ring and the section Burnside ring for a finite group \\(G\\), demonstrating that both naturally possess the structure of a Green biset functor. The classification of simple modules over the section Burnside ring is achieved through the fibered biset functor approach, as detailed in the article by Robert Boltje and Olcay Coskun. This is a joint work with Olcay Coskun.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2024\" data-search=\"olcay coskun prime portraits\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">October 30, 2024<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:15 \u00b7 Faculty of Mechanics and Mathematics, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Prime Portraits<\/div>\n          <div class=\"sem-speaker\">Olcay Coskun<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"30\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-30\"><p>This is the first of a series of seminars in which we develop an obstruction theory for the existence and uniqueness of a solution to the gluing problem for a biset functor defined on the sub-quotients of a finite group \\(G\\).<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2024\" data-search=\"olcay coskun obstructions for gluing biset functors\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">October 24, 2024<\/div>\n          <span class=\"sem-badge sem-badge-general\">General Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:00 \u00b7 Digital Research Lab, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Obstructions for gluing biset functors<\/div>\n          <div class=\"sem-speaker\">Olcay Coskun<\/div>\n          <div class=\"sem-abstract-wrap\"><button class=\"sem-abstract-toggle\" data-idx=\"31\">Show abstract &#9662;<\/button><div class=\"sem-abstract\" id=\"abs-31\"><p>This is the first of a series of seminars in which we develop an obstruction theory for the existence and uniqueness of a solution to the gluing problem for a biset functor defined on the sub-quotients of a finite group \\(G\\). The obstruction groups for this theory are the reduced cohomology groups of a category \\(D^*_G\\) whose objects are the sections \\((U,V)\\) of \\(G\\), where \\(V\\) is a non-trivial normal subgroup of the subgroup \\(U\\) of \\(G\\), and whose morphisms are defined as a generalization of morphisms in the orbit category.<\/p><\/div><\/div>\n        <\/div>\n      <\/div>\n      <div class=\"sem-entry\" data-year=\"2024\" data-search=\"olcay coskun representation theory through category theory\">\n        <div class=\"sem-entry-left\">\n          <div class=\"sem-date\">September 24, 2024<\/div>\n          <span class=\"sem-badge sem-badge-student\">Student Seminar<\/span>\n          <span class=\"sem-loc\"><svg viewBox=\"0 0 16 16\" fill=\"currentColor\"><path d=\"M8 0C5.24 0 3 2.24 3 5c0 3.75 5 11 5 11s5-7.25 5-11c0-2.76-2.24-5-5-5zm0 7.5a2.5 2.5 0 110-5 2.5 2.5 0 010 5z\"\/><\/svg>10:15 \u00b7 Faculty of Mechanics and Mathematics, BSU<\/span>\n        <\/div>\n        <div class=\"sem-entry-right\">\n          <div class=\"sem-title\">Representation Theory through Category Theory<\/div>\n          <div class=\"sem-speaker\">Olcay Coskun<\/div>\n          \n        <\/div>\n      <\/div>\n    <\/div>\n    <div class=\"sem-empty\" id=\"sem-empty\">No seminars match your search.<\/div>\n  <\/div>\n<\/div>\n<script>\n(function () {\n  var search = document.getElementById(\"sem-search\");\n  var typeBtns = document.querySelectorAll(\".sem-type-btn\");\n  var yearBtns = document.querySelectorAll(\".sem-year-btn\");\n  var entries = document.querySelectorAll(\".sem-entry\");\n  var yearGroups = document.querySelectorAll(\".sem-year-group\");\n  var countEl = document.getElementById(\"sem-count\");\n  var emptyEl = document.getElementById(\"sem-empty\");\n  var activeType = \"all\", activeYear = \"all\";\n\n  function update() {\n    var q = search.value.trim().toLowerCase();\n    var visible = 0;\n\n    entries.forEach(function (e) {\n      var badge = e.querySelector(\".sem-badge\");\n      var typeMatch = activeType === \"all\" || badge.className.indexOf(\"sem-badge-\" + activeType) !== -1;\n      var yearMatch = activeYear === \"all\" || e.closest(\".sem-year-group\").dataset.year === activeYear;\n      var text = (e.dataset.search || \"\") + \" \" + (e.querySelector(\".sem-abstract\") ? e.querySelector(\".sem-abstract\").textContent : \"\");\n      var searchMatch = !q || text.toLowerCase().indexOf(q) !== -1;\n\n      if (typeMatch && yearMatch && searchMatch) {\n        e.classList.remove(\"hidden\");\n        visible++;\n      } else {\n        e.classList.add(\"hidden\");\n      }\n    });\n\n    yearGroups.forEach(function (g) {\n      var n = g.querySelectorAll(\".sem-entry:not(.hidden)\").length;\n      g.style.display = n > 0 ? \"\" : \"none\";\n    });\n\n    if (countEl) {\n      countEl.textContent = visible === entries.length ? entries.length + \" seminars\" : visible + \" of \" + entries.length + \" shown\";\n    }\n    emptyEl.style.display = visible === 0 ? \"block\" : \"none\";\n  }\n\n  typeBtns.forEach(function (btn) {\n    btn.addEventListener(\"click\", function () {\n      typeBtns.forEach(function (b) { b.classList.remove(\"active\"); });\n      btn.classList.add(\"active\");\n      activeType = btn.dataset.type;\n      update();\n    });\n  });\n\n  yearBtns.forEach(function (btn) {\n    btn.addEventListener(\"click\", function () {\n      yearBtns.forEach(function (b) { b.classList.remove(\"active\"); });\n      btn.classList.add(\"active\");\n      activeYear = btn.dataset.year;\n      update();\n    });\n  });\n\n  search.addEventListener(\"input\", update);\n\n  document.querySelectorAll(\".sem-abstract-toggle\").forEach(function (btn) {\n    btn.addEventListener(\"click\", function () {\n      var wrap = btn.closest(\".sem-abstract-wrap\");\n      var abs = wrap.querySelector(\".sem-abstract\");\n      var open = abs.classList.toggle(\"open\");\n      btn.textContent = open ? \"Hide abstract \u25b4\" : \"Show abstract \u25be\";\n    });\n  });\n\n  update();\n})();\n<\/script>\n<\/body>\n<\/html>\n","protected":false},"excerpt":{"rendered":"<p>Seminars \u2014 Mathematics Research Center Mathematics Research Center \u00b7 ASOIU Seminars General, research, and student seminars at MRC All types General Research Student All202620252024 2026 April 30, 2026 Research Seminar 13:30 \u00b7 MRC Seminar Room Equivalences on Primitive Dirichlet Characters Olcay Co\u015fkun April 21, 2026 General Seminar 14:15 \u00b7 MRC @ UFAZ 308 Worst-case examples [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-60","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages\/60","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/comments?post=60"}],"version-history":[{"count":15,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages\/60\/revisions"}],"predecessor-version":[{"id":495,"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/pages\/60\/revisions\/495"}],"wp:attachment":[{"href":"https:\/\/mrc-baku.org\/index.php\/wp-json\/wp\/v2\/media?parent=60"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}