DOCSLIB.ORG

Factoring Permutations Into the Product of Two Involutions: a Probabilistic

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Factoring Permutations Into the Product of Two Involutions: a Probabilistic View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Drexel Libraries E-Repository and Archives Factoring Permutations into the Product of Two Involutions: A Probabilistic, Combinatorial, and Analytic Approach A Thesis Submitted to the Faculty of Drexel University by Charles Burnette in partial fulfillment of the requirements for the degree of Doctor of Philosophy June 2017 c Copyright 2017 Charles Burnette. All Rights Reserved ii Acknowledgments First I must thank my thesis advisor, Eric Schmutz, for his exceptional mentorship. It has been a pleasure working with him for the past five years. His advice and guidance helped mold me as a mathematician. He granted me the freedom and independence to pursue my own interests, but was also a great source of encouragement and advice whenever I struggled. He has always made himself available for help, even though I did not capitalize on this opportunity as much as I should have. His patience and friendliness helped alleviate much of the stress of navigating graduate school, conferences, and the job market. I am very honored to be his student. I have been extremely fortunate to experience a quality education in combinatorics, analysis, and probability. Courses that I took under David Ambrose, Robert Boyer, Simon Foucart, Peter Freyd, Louis Friedler, Pawe ll Hitczenko, Ryan Kaliszewski, Dmitry Kaliuzhniy-Verbovetsky, Jen- nifer Morse, Shari Moskow, Alexander Nagel, Fedor Nazarov, Ron Perline, Jean-Pierre Rosay, Eric Schmutz, Andreas Seeger, Paul Terwiliger, and Ned Wolff shaped most of my knowledge in these areas of mathematics. Other mathematicians who have personally shared their deep insights on combinatorics and related mathematics with me on numerous occasions include Jonah Blasiak, Jim Haglund, Huilan Li, Victor Moll, Ken Ono, Greta Panova, Robin Pemantle, Mark Ward, Hugo Wo- erdeman, Dirk Zeindler, and many others who have influenced, either directly or indirectly, my past and present research themes and directions. Mark Ward especially inspired me to try and master analytic combinatorics. After I attended his mini-lectures during the 2nd Lake Michigan Workshop on Combinatorics and Graph Theory at Notre Dame, I was denuded of the misgivings I previously had about learning this subject. I was hooked. I also wish to thank the administrative staff of the math department { Paige Chmielewski, Kenn Hemphill, Gene Phan, Sobha Phillips, and Amy Tiernan { who work behind-the-scenes to make sure that the department runs smoothly, that the technology runs properly, and that I get paid/reimbursed. I would also like to thank the late Mindy Gilchrist, who used to be on the staff but iii passed away midway through my time at Drexel. We spoke together a lot, and she always wanted to know whether everything was going okay. I had a lot of fun these past five years mostly because of my fellow graduate students. I especially want to acknowledge Avi Dalal, Tim Faver, Tim Hayes, Mandy Lohss, Michael Minner, Dan Parry, Sarah Rody, Scott Rome, Pat Shields, David Sulon, Kelly Toppin, Chung Wong, and Trevor Zaleski for all of the times we hanged out together and exchanged ideas on everything from mathematics to sports, from game shows to Salty Bet. I also want to thank the organizers of the local seminars at Drexel, Penn, and Bryn Mawr at which I gave multiple talks for providing me an occasional platform. This also goes for all of the conferences that I've presented at. I have received so many helpful comments from people I don't know but decided to listen to me anyway. I have also received great suggestions from anonymous referees on the papers that I have either published or submitted for publication. These experiences really drive me to improve my exposition and oratory, and I'm grateful for it. I now want to take the time to acknowledge those who I feel are the main reasons why I even decided to go into mathematics in the first place. I greatly thank Louis Friedler, Carlos Ortiz, and Ned Wolf, my three math professors from Arcadia. I entered my undergrad as an English major without so much as a scintilla of interest in doing anything genuinely meaningful with my life. I enrolled in a Calculus I class on a whim. (As an English major, I didn't have to take it. Something at the level of Precalculus would have sufficed.) But I took Prof. Ortiz's calculus course anyway, and I didn't want to stop there. Next thing I know, I'm minoring in math. Next thing I know, I'm declaring a second major in math. Next thing I know, I'm ditching the English major and deciding to pursue a Ph.D. in math. (Apologies to the magnificent English professors that I had at Arcadia. I do occasionally feel like a traitor.) And this sequence of changes in my declared major is primarily because of these three people. They looked out for me more than any other teachers I've ever had up to that point. They were the first to ever tell me that I had the talent to make a living out of doing mathematics. I believed them. And I still do. Last but not least, I want to thank my parents, Barbara Burnette and Charles Burnette, Sr., iv for the limitless amount of love and support that they have given me. My mom has sacrificed so much to make sure that I had the chance and the means to pursue my ambitions. Even as a grown man now in his thirties, she's quick to look out for me. My dad was also very instrumental in my intellectual development. A degenerative eye disorder robbed him of his vision when I was very young. So he would have me read books and newspaper articles to him. As much as hated doing this at times, it instilled in me a thirst for knowledge. I finish with one last blanket statement of indebtedness to anyone important I may be forgetting about. I feel very privileged to have had so many people throughout my life invested in my success. Not many people get as many redos, mulligans, and second chances as I've gotten. I made it this far mostly because of the generosity, kindness, and mercy of others. So again, thank you to you all. Spread love. It's the Brooklyn way. { The Notorious B.I.G. v Table of Contents Abstract .............................................. vii 1. Introduction .......................................... 1 1.1 A Brief History of Analytic Combinatorics......................... 1 1.2 Statement of Results..................................... 2 2. Background Mathematics .................................. 5 2.1 The Generatingfunctionology of Permutations....................... 5 2.1.1 Generating Functions Associated with Permutations ................. 5 2.1.2 The Shepp-Lloyd Model................................. 8 2.2 Singularity Analysis ..................................... 9 2.2.1 The Gestalt of Analytic Combinatorics......................... 9 2.2.2 Wright's Expansions ................................... 11 2.2.3 Darboux's Method .................................... 11 2.2.4 A Flajolet-Odlyzko Transfer Theorem ......................... 13 2.2.5 Hybridization of Darboux's Method and the Transfer Theorem ........... 14 2.2.6 A Coefficient Growth Estimate ............................. 17 2.3 The Method of Moments................................... 17 3. Factoring Random Permutations ............................. 19 3.1 Preliminaries ......................................... 19 3.2 The Combinatorics Behind Involution Factorizations................... 20 3.3 Extremal Properties of Nn ................................. 24 3.4 Approximation by Bn .................................... 27 3.5 The Asymptotic Lognormality of Nn ............................ 29 4. Generalizing to the Ewens Sampling Formula .................... 31 4.1 What Is the Ewens Sampling Formula?........................... 31 vi 4.2 Mean Number of Involution Factorizations......................... 32 4.3 Approximation by Bn Revisited............................... 34 4.4 The Asymptotic Lognormality of Nn Revisited ...................... 37 4.5 The Threshold of θ = 1 ................................... 38 5. Permutations Admitting Fixed-Point Free Involution Factorizations . 40 5.1 Motivation .......................................... 40 5.2 Asymptotic Enumeration of Permissible Permutations .................. 41 ∗ 5.3 Extremal Properties of N2n ................................. 44 5.4 Cycle Structure of Permissible Permutations........................ 46 5.5 Concluding Remarks..................................... 49 Bibliography ............................................ 50 Appendix A: Alternative Derivation of (4.1.6) ...................... 54 ∗ Appendix B: Generating Function for E2n(N2n) ..................... 56 Appendix C: Alternative Proof of Theorem 5.4.1 .................... 57 Appendix D: Frequently Used Notation .......................... 58 Vita .................................................. 60 vii Abstract Factoring Permutations into the Product of Two Involutions: A Probabilistic, Combinatorial, and Analytic Approach Charles Burnette Eric Schmutz, Ph.D. An involution is a permutation that is its own inverse. Given a permutation σ of [n]; let Nn(σ) denote the number of ways to write σ as a product of two involutions. The random variables Nn are asymptotically lognormal when the symmetric groups Sn are equipped with uniform probability measures, in particular, and, more generally, Ewens measures of some fixed parameter θ > 0: The proof is based upon the observation that, for most permutations σ; the number of involution factorizations Nn(σ) can be well-approximated by Bn(σ); the product of the cycle lengths of
Load more

Recommended publications
  • The Book of Involutions
    The Book of Involutions Max-Albert Knus Alexander Sergejvich Merkurjev Herbert Markus Rost Jean-Pierre Tignol @ @ @ @ @ @ @ @ The Book of Involutions Max-Albert Knus Alexander Merkurjev Markus Rost Jean-Pierre Tignol Author address: Dept. Mathematik, ETH-Zentrum, CH-8092 Zurich,¨ Switzerland E-mail address: [email protected] URL: http://www.math.ethz.ch/~knus/ Dept. of Mathematics, University of California at Los Angeles, Los Angeles, California, 90095-1555, USA E-mail address: [email protected] URL: http://www.math.ucla.edu/~merkurev/ NWF I - Mathematik, Universitat¨ Regensburg, D-93040 Regens- burg, Germany E-mail address: [email protected] URL: http://www.physik.uni-regensburg.de/~rom03516/ Departement´ de mathematique,´ Universite´ catholique de Louvain, Chemin du Cyclotron 2, B-1348 Louvain-la-Neuve, Belgium E-mail address: [email protected] URL: http://www.math.ucl.ac.be/tignol/ Contents Pr´eface . ix Introduction . xi Conventions and Notations . xv Chapter I. Involutions and Hermitian Forms . 1 1. Central Simple Algebras . 3 x 1.A. Fundamental theorems . 3 1.B. One-sided ideals in central simple algebras . 5 1.C. Severi-Brauer varieties . 9 2. Involutions . 13 x 2.A. Involutions of the first kind . 13 2.B. Involutions of the second kind . 20 2.C. Examples . 23 2.D. Lie and Jordan structures . 27 3. Existence of Involutions . 31 x 3.A. Existence of involutions of the first kind . 32 3.B. Existence of involutions of the second kind . 36 4. Hermitian Forms . 41 x 4.A. Adjoint involutions . 42 4.B. Extension of involutions and transfer .
    [Show full text]
  • The Cycle Polynomial of a Permutation Group
    The cycle polynomial of a permutation group Peter J. Cameron and Jason Semeraro Abstract The cycle polynomial of a finite permutation group G is the gen- erating function for the number of elements of G with a given number of cycles: c(g) FG(x)= x , gX∈G where c(g) is the number of cycles of g on Ω. In the first part of the paper, we develop basic properties of this polynomial, and give a number of examples. In the 1970s, Richard Stanley introduced the notion of reciprocity for pairs of combinatorial polynomials. We show that, in a consider- able number of cases, there is a polynomial in the reciprocal relation to the cycle polynomial of G; this is the orbital chromatic polynomial of Γ and G, where Γ is a G-invariant graph, introduced by the first author, Jackson and Rudd. We pose the general problem of finding all such reciprocal pairs, and give a number of examples and charac- terisations: the latter include the cases where Γ is a complete or null graph or a tree. The paper concludes with some comments on other polynomials associated with a permutation group. arXiv:1701.06954v1 [math.CO] 24 Jan 2017 1 The cycle polynomial and its properties Define the cycle polynomial of a permutation group G acting on a set Ω of size n to be c(g) FG(x)= x , g∈G X where c(g) is the number of cycles of g on Ω (including fixed points). Clearly the cycle polynomial is a monic polynomial of degree n.
    [Show full text]
  • Introduction to Linear Logic
    Introduction to Linear Logic Beniamino Accattoli INRIA and LIX (École Polytechnique) Accattoli ( INRIA and LIX (École Polytechnique)) Introduction to Linear Logic 1 / 49 Outline 1 Informal introduction 2 Classical Sequent Calculus 3 Sequent Calculus Presentations 4 Linear Logic 5 Catching non-linearity 6 Expressivity 7 Cut-Elimination 8 Proof-Nets Accattoli ( INRIA and LIX (École Polytechnique)) Introduction to Linear Logic 2 / 49 Outline 1 Informal introduction 2 Classical Sequent Calculus 3 Sequent Calculus Presentations 4 Linear Logic 5 Catching non-linearity 6 Expressivity 7 Cut-Elimination 8 Proof-Nets Accattoli ( INRIA and LIX (École Polytechnique)) Introduction to Linear Logic 3 / 49 Quotation From A taste of Linear Logic of Philip Wadler: Some of the best things in life are free; and some are not. Truth is free. You may use a proof of a theorem as many times as you wish. Food, on the other hand, has a cost. Having baked a cake, you may eat it only once. If traditional logic is about truth, then Linear Logic is about food Accattoli ( INRIA and LIX (École Polytechnique)) Introduction to Linear Logic 4 / 49 Informally 1 Classical logic deals with stable truths: if A and A B then B but A still holds) Example: 1 A = ’Tomorrow is the 1st october’. 2 B = ’John will go to the beach’. 3 A B = ’If tomorrow is the 1st october then John will go to the beach’. So if tomorrow) is the 1st october, then John will go to the beach, But of course tomorrow will still be the 1st october. Accattoli ( INRIA and LIX (École Polytechnique)) Introduction to Linear Logic 5 / 49 Informally 2 But with money, or food, that implication is wrong: 1 A = ’John has (only) 5 euros’.
    [Show full text]
  • Arxiv:1809.02384V2 [Math.OA] 19 Feb 2019 H Ruet Eaefloigaecmlctd N Oi Sntcerin Clear Not Is T It Saying So Worth and Is Complicated, It Are Following Hand
    INVOLUTIVE OPERATOR ALGEBRAS DAVID P. BLECHER AND ZHENHUA WANG Abstract. Examples of operator algebras with involution include the op- erator ∗-algebras occurring in noncommutative differential geometry studied recently by Mesland, Kaad, Lesch, and others, several classical function alge- bras, triangular matrix algebras, (complexifications) of real operator algebras, and an operator algebraic version of the complex symmetric operators stud- ied by Garcia, Putinar, Wogen, Zhu, and others. We investigate the general theory of involutive operator algebras, and give many applications, such as a characterization of the symmetric operator algebras introduced in the early days of operator space theory. 1. Introduction An operator algebra for us is a closed subalgebra of B(H), for a complex Hilbert space H. Here we study operator algebras with involution. Examples include the operator ∗-algebras occurring in noncommutative differential geometry studied re- cently by Mesland, Kaad, Lesch, and others (see e.g. [26, 25, 10] and references therein), (complexifications) of real operator algebras, and an operator algebraic version of the complex symmetric operators studied by Garcia, Putinar, Wogen, Zhu, and many others (see [21] for a survey, or e.g. [22]). By an operator ∗-algebra we mean an operator algebra with an involution † † N making it a ∗-algebra with k[aji]k = k[aij]k for [aij ] ∈ Mn(A) and n ∈ . Here we are using the matrix norms of operator space theory (see e.g. [30]). This notion was first introduced by Mesland in the setting of noncommutative differential geometry [26], who was soon joined by Kaad and Lesch [25]. In several recent papers by these authors and coauthors they exploit operator ∗-algebras and involutive modules in geometric situations.
    [Show full text]
  • Derivation of the Cycle Index Formula of the Affine Square(Q)
    International Journal of Algebra, Vol. 13, 2019, no. 7, 307 - 314 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2019.9725 Derivation of the Cycle Index Formula of the Affine Square(q) Group Acting on GF (q) Geoffrey Ngovi Muthoka Pure and Applied Sciences Department Kirinyaga University, P. O. Box 143-10300, Kerugoya, Kenya Ireri Kamuti Department of Mathematics and Actuarial Science Kenyatta University, P. O. Box 43844-00100, Nairobi, Kenya Mutie Kavila Department of Mathematics and Actuarial Science Kenyatta University, P. O. Box 43844-00100, Nairobi, Kenya This article is distributed under the Creative Commons by-nc-nd Attribution License. Copyright c 2019 Hikari Ltd. Abstract The concept of the cycle index of a permutation group was discovered by [7] and he gave it its present name. Since then cycle index formulas of several groups have been studied by different scholars. In this study the cycle index formula of an affine square(q) group acting on the elements of GF (q) where q is a power of a prime p has been derived using a method devised by [4]. We further express its cycle index formula in terms of the cycle index formulas of the elementary abelian group Pq and the cyclic group C q−1 since the affine square(q) group is a semidirect 2 product group of the two groups. Keywords: Cycle index, Affine square(q) group, Semidirect product group 308 Geoffrey Ngovi Muthoka, Ireri Kamuti and Mutie Kavila 1 Introduction [1] The set Pq = fx + b; where b 2 GF (q)g forms a normal subgroup of the affine(q) group and the set C q−1 = fax; where a is a non zero square in GF (q)g 2 forms a cyclic subgroup of the affine(q) group under multiplication.
    [Show full text]
  • An Introduction to Combinatorial Species
    An Introduction to Combinatorial Species Ira M. Gessel Department of Mathematics Brandeis University Summer School on Algebraic Combinatorics Korea Institute for Advanced Study Seoul, Korea June 14, 2016 The main reference for the theory of combinatorial species is the book Combinatorial Species and Tree-Like Structures by François Bergeron, Gilbert Labelle, and Pierre Leroux. What are combinatorial species? The theory of combinatorial species, introduced by André Joyal in 1980, is a method for counting labeled structures, such as graphs. What are combinatorial species? The theory of combinatorial species, introduced by André Joyal in 1980, is a method for counting labeled structures, such as graphs. The main reference for the theory of combinatorial species is the book Combinatorial Species and Tree-Like Structures by François Bergeron, Gilbert Labelle, and Pierre Leroux. If a structure has label set A and we have a bijection f : A B then we can replace each label a A with its image f (b) in!B. 2 1 c 1 c 7! 2 2 a a 7! 3 b 3 7! b More interestingly, it allows us to count unlabeled versions of labeled structures (unlabeled structures). If we have a bijection A A then we also get a bijection from the set of structures with! label set A to itself, so we have an action of the symmetric group on A acting on these structures. The orbits of these structures are the unlabeled structures. What are species good for? The theory of species allows us to count labeled structures, using exponential generating functions. What are species good for? The theory of species allows us to count labeled structures, using exponential generating functions.
    [Show full text]
  • Orthogonal Involutions and Totally Singular Quadratic Forms In
    Orthogonal involutions and totally singular quadratic forms in characteristic two A.-H. Nokhodkar Abstract We associate to every central simple algebra with involution of ortho- gonal type in characteristic two a totally singular quadratic form which reflects certain anisotropy properties of the involution. It is shown that this quadratic form can be used to classify totally decomposable algebras with orthogonal involution. Also, using this form, a criterion is obtained for an orthogonal involution on a split algebra to be conjugated to the transpose involution. Mathematics Subject Classification: 16W10, 16K20, 11E39, 11E04. 1 Introduction The theory of algebras with involution is closely related to the theory of bilinear forms. Assigning to every symmetric or anti-symmetric regular bilinear form on a finite-dimensional vector space V its adjoint involution induces a one- to-one correspondence between the similarity classes of bilinear forms on V and involutions of the first kind on the endomorphism algebra EndF (V ) (see [5, p. 1]). Under this correspondence several basic properties of involutions reflect analogous properties of bilinear forms. For example a symmetric or anti- symmetric bilinear form is isotropic (resp. anisotropic, hyperbolic) if and only if its adjoint involution is isotropic (resp. anisotropic, hyperbolic). Let (A, σ) be a totally decomposable algebra with orthogonal involution over a field F of characteristic two. In [3], a bilinear Pfister form Pf(A, σ) was associated to (A, σ), which determines the isotropy behaviour of (A, σ). It was shown that for every splitting field K of A, the involution σK on AK becomes adjoint to the bilinear form Pf(A, σ)K (see [3, (7.5)]).
    [Show full text]
  • I-Rings with Involution
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOL-SAL OF ALGEBRA 38, 85-92 (1976) I-Rings with Involution Department of Mathematics, l.~&e~sity of Southern California, Los Angeles, California 90007 Communicated ly I. :V. Herstein Received September 18, 1974 The conditions of van Keumann regukity, x-reguiarity, and being an I-ring are placed on symmetric subrings of a ring with involution, and n-e determine when the whole ring must satisfy the same property. It is shown that any symmetric subring must satisfy any one of these properties if the whole ring does. In this paper, we continue our investigations begun in [6], in which we determined conditions on the symmetric elements of a ring witn involution that force the ring to be an I-ring. In the spirit of [S], the conditions of van Neumann reguhxrity, r-regularity, and being an I-ring are assumed for certain subrings generated by symmetric elements, to see if these conditions are then implied for the whole ring. Any of these conditions on the ring wiil restrict to the subrings under consideration, but we can only show that the I-ring condition extends up. In addition, we prove that r-regularity extends to the whole ring in the presence of a polynomial identity, and that the regularity condition cannot in general, be extended to the whole ring. Throughout this work, R will denote an associative ring with involution *. Let S = {.x E R i x:” = x> be the symmetric elements of R, 2” = {x L .x* i x E R] I the set of traces, and A’ = (xxx 1 x E RI, the set of norms.
    [Show full text]
  • Lecture 8: Counting
    Lecture 8: Counting Nitin Saxena ? IIT Kanpur 1 Generating functions (Fibonacci) P i 1 We had obtained φ(t) = i≥0 Fit = 1−t−t2 . We can factorize the polynomial, 1 − t − t2 = (1 − αt)(1 − βt), where α; β 2 C. p p 1+ 5 1− 5 Exercise 1. Show that α = 2 ; β = 2 . We can simplify the formula a bit more, 1 c c φ(t) = = 1 + 2 = c (1 + αt + α2t2 + ··· ) + c (1 + βt + β2t2 + ··· ) : 1 − t − t2 1 − αt 1 − βt 1 2 We got the second equality by putting c = p1 α and c = − p1 β. The final expression gives us an explicit 1 5 2 5 formula for the Fibonacci sequence, 1 n+1 n+1 Fn = p (α − β ) : 5 This is actually a very strong method and can be used for solving linear recurrences of the kind, Sn = a1Sn−1 + ··· + akSn−k. Here k; a1; a2; ··· ; ak are constants. Suppose φ(t) is the recurrence for Sn, then by the above method, k−1 b1 + b2t + ··· + bkt c1 ck φ(t) = 2 k = + ··· + : 1 − a1t − a2t − · · · − akt 1 − α1t 1 − αkt k k−1 Where α1; ··· ; αk are the roots (assumed distinct) of polynomial x − a1x − · · · − ak = 0 (replace t 1 by x ). This is known as the characteristic polynomial of the recurrence. Exercise 2. How are the coefficients b1; ··· ; bk or c1; ··· ; ck determined? nta conditions. Initial n n So we get Sn = c1α1 + ··· + ckαk . Note 1. For a linear recurrence if Fn and Gn are solutions then their linear combinations aFn + bGn are n n also solutions.
    [Show full text]
  • 3.8 the Cycle Index Polynomial
    94 CHAPTER 3. GROUPS AND POLYA THEORY 3.8 The Cycle Index Polynomial Let G be a group acting on a set X. Then as mentioned at the end of the previous section, we need to understand the cycle decomposition of each g G as product of disjoint cycles. ∈ Redfield and Polya observed that elements of G with the same cyclic decomposition made the same contribution to the sets of fixed points. They defined the notion of cycle index polynomial to keep track of the cycle decomposition of the elements of G. Let us start with a few definitions and examples to better understand the use of cycle decomposition of an element of a permutation group. ℓ1 ℓ2 ℓn Definition 3.8.1. A permutation σ n is said to have the cycle structure 1 2 n , if ∈ S t · · · the cycle representation of σ has ℓi cycles of length i, for 1 i n. Observe that i ℓi = n. ≤ ≤ i=1 · Example 3.8.2. 1. Let e be the identity element of . Then e = (1) (2) (nP) and hence Sn · · · the cycle structure of e, as an element of equals 1n. Sn 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 2. Let σ = . Then it can be 3 6 7 10 14 1 2 13 15 4 11 5 8 12 9 ! easily verified that in the cycle notation, σ = (1 3 7 2 6) (4 10) (5 14 12) (8 13) (9 15) (11). Thus, the cycle structure of σ is 11233151.
    [Show full text]
  • The Involution Tool for Accurate Digital Timingand Power Analysis Daniel Ohlinger, Jürgen Maier, Matthias Függer, Ulrich Schmid
    The Involution Tool for Accurate Digital Timingand Power Analysis Daniel Ohlinger, Jürgen Maier, Matthias Függer, Ulrich Schmid To cite this version: Daniel Ohlinger, Jürgen Maier, Matthias Függer, Ulrich Schmid. The Involution Tool for Accu- rate Digital Timingand Power Analysis. PATMOS 2019 - 29th International Symposium on Power and Timing Modeling, Optimization and Simulation, Jul 2019, Rhodes, Greece. 10.1109/PAT- MOS.2019.8862165. hal-02395242 HAL Id: hal-02395242 https://hal.inria.fr/hal-02395242 Submitted on 5 Dec 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The Involution Tool for Accurate Digital Timing and Power Analysis Daniel Ohlinger¨ ∗,Jurgen¨ Maier∗, Matthias Fugger¨ y, Ulrich Schmid∗ ∗ECS Group, TU Wien [email protected], jmaier, s @ecs.tuwien.ac.at f g yCNRS & LSV, ENS Paris-Saclay, Universite´ Paris-Saclay & Inria [email protected] Abstract—We introduce the prototype of a digital timing sim- in(t) ulation and power analysis tool for integrated circuit (Involution Tool) which employs the involution delay model introduced by t Fugger¨ et al. at DATE’15. Unlike the pure and inertial delay out(t) models typically used in digital timing analysis tools, the involu- tion model faithfully captures pulse propagation.
    [Show full text]
  • On a Class of Inverse Problems for a Heat Equation with Involution Perturbation
    On a class of inverse problems for a heat equation with involution perturbation Nasser Al-Salti∗y, Mokhtar Kiranez and Berikbol T. Torebekx Abstract A class of inverse problems for a heat equation with involution pertur- bation is considered using four different boundary conditions, namely, Dirichlet, Neumann, periodic and anti-periodic boundary conditions. Proved theorems on existence and uniqueness of solutions to these problems are presented. Solutions are obtained in the form of series expansion using a set of appropriate orthogonal basis for each problem. Convergence of the obtained solutions is also discussed. Keywords: Inverse Problems, Heat Equation, Involution Perturbation. 2000 AMS Classification: 35R30; 35K05; 39B52. 1. Introduction Differential equations with modified arguments are equations in which the un- known function and its derivatives are evaluated with modifications of time or space variables; such equations are called in general functional differential equa- tions. Among such equations, one can single out equations with involutions [?]. 1.1. Definition. [?, ?] A function α(x) 6≡ x that maps a set of real numbers, Γ, onto itself and satisfies on Γ the condition α (α(x)) = x; or α−1(x) = α(x) is called an involution on Γ: Equations containing involution are equations with an alternating deviation (at x∗ < x being equations with advanced, and at x∗ > x being equations with delay, where x∗ is a fixed point of the mapping α(x)). Equations with involutions have been studied by many researchers, for exam- ple, Ashyralyev [?, ?], Babbage [?], Przewoerska-Rolewicz [?, ?, ?, ?, ?, ?, ?], Aftabizadeh and Col. [?], Andreev [?, ?], Burlutskayaa and Col. [?], Gupta [?, ?, ?], Kirane [?], Watkins [?], and Wiener [?, ?, ?, ?]. Spectral problems and inverse problems for equations with involutions have received a lot of attention as well, see for example, [?, ?, ?, ?, ?], and equations with a delay in the space variable have been the subject of many research papers, see for example, [?, ?].
    [Show full text]