scholarly journals Simple Equational Specifications of Rational Arithmetic

2001 ◽  
Vol Vol. 4 no. 2 ◽  
Author(s):  
Lawrence S. Moss
Keyword(s):  
Rational Numbers ◽  
Absolute Value ◽  
Error Constant ◽  
Greatest Integer Function ◽  
International Audience ◽  
Rational Arithmetic ◽  
Equational Specifications

International audience We exhibit an initial specification of the rational numbers equipped with addition, subtraction, multiplication, greatest integer function, and absolute value. Our specification uses only the sort of rational numbers. It uses one hidden function; that function is unary. But it does not use an error constant, or extra (hidden) sorts, or conditional equations. All of our work is elementary and self-contained.

scholarly journals The Saddle Point Method for the Integral of the Absolute Value of the Brownian Motion

2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
Leonid Tolmatz
Keyword(s):  
Distribution Function ◽  
Brownian Motion ◽  
Saddle Point ◽  
Point Method ◽  
Saddle Point Method ◽  
Tail Asymptotics ◽  
Absolute Value ◽  
Exact Tail Asymptotics ◽  
International Audience ◽  
The Absolute

International audience The distribution function of the integral of the absolute value of the Brownian motion was expressed by L.Takács in the form of various series. In the present paper we determine the exact tail asymptotics of this distribution function. The proposed method is applicable to a variety of other Wiener functionals as well.

scholarly journals The Hodge Structure of the Coloring Complex of a Hypergraph (Extended Abstract)

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Sarah C Rundell ◽  
Jane H Long
Keyword(s):  
Euler Characteristic ◽  
Homology Group ◽  
Hodge Structure ◽  
Hodge Decomposition ◽  
Simple Graph ◽  
Absolute Value ◽  
International Audience ◽  
The Absolute ◽  
Nous Examinons ◽  
Coloring Complex

International audience Let $G$ be a simple graph with $n$ vertices. The coloring complex$ Δ (G)$ was defined by Steingrímsson, and the homology of $Δ (G)$ was shown to be nonzero only in dimension $n-3$ by Jonsson. Hanlon recently showed that the Eulerian idempotents provide a decomposition of the homology group $H_{n-3}(Δ (G))$ where the dimension of the $j^th$ component in the decomposition, $H_{n-3}^{(j)}(Δ (G))$, equals the absolute value of the coefficient of $λ ^j$ in the chromatic polynomial of $G, _{\mathcal{χg}}(λ )$. Let $H$ be a hypergraph with $n$ vertices. In this paper, we define the coloring complex of a hypergraph, $Δ (H)$, and show that the coefficient of $λ ^j$ in $χ _H(λ )$ gives the Euler Characteristic of the $j^{th}$ Hodge subcomplex of the Hodge decomposition of $Δ (H)$. We also examine conditions on a hypergraph, $H$, for which its Hodge subcomplexes are Cohen-Macaulay, and thus where the absolute value of the coefficient of $λ ^j$ in $χ _H(λ )$ equals the dimension of the $j^{th}$ Hodge piece of the Hodge decomposition of $Δ (H)$. Soit $G$ un graphe simple à n sommets. Le complexe de coloriage $Δ (G)$ a été défini par Steingrímsson et Jonsson a prouvé que l'homologie de $Δ (G)$ est non nulle seulement en dimension $n-3$. Hanlon a récemment prouvé que les idempotents eulériens fournissent une décomposition du groupe d'homologie $H_{n-3}(Δ (G))$ où la dimension de la $j^e$ composante dans la décomposition de $H_{n-3}^{(j)}(Δ (G))$ est égale à la valeur absolue du coefficient de $λ ^j$ dans le polynôme chromatique de $G, _{\mathcal{χg}}(λ )$ . Soit H un hypergraphe à $n$ sommets. Dans ce texte, nous définissons le complexe de coloration d'un hypergraphe $Δ (H)$ et nous prouvons que le coefficient de $λ ^j$ dans $χ _H(λ )$ donne la caractéristique d'Euler du $j^e$ sous-complexe de Hodge dans la décomposition de Hodge de Δ (H). Nous examinons également des conditions sur un hypergraphe H pour lesquelles les sous-complexes de Hodge sont Cohen-Macaulay. Ainsi la valeur absolue du coefficient de $λ ^j$ in $χ _H(λ )$ est égale à la dimension du $j^e$sous-complexe de Hodge dans la décomposition de Hodge de $Δ (H)$.

scholarly journals Mean-square upper bound of Hecke $L$-functions on the critical line.

2003 ◽  
Vol Volume 26 ◽  
Author(s):  
A Sankaranarayanan
Keyword(s):  
Cusp Form ◽  
Upper Bound ◽  
Critical Line ◽  
Congruence Subgroup ◽  
Mean Square ◽  
Absolute Value ◽  
International Audience ◽  
The Mean ◽  
The Absolute

International audience We prove the upper bound for the mean-square of the absolute value of the Hecke $L$-functions (attached to a holomorphic cusp form) defined for the congruence subgroup $\Gamma_0 (N)$ on the critical line uniformly with respect to its conductor $N$.

scholarly journals Structure of spanning trees on the two-dimensional Sierpinski gasket

2011 ◽  
Vol Vol. 12 no. 3 (Combinatorics) ◽  
Author(s):  
Shu-Chiuan Chang ◽  
Lung-Chi Chen
Keyword(s):  
Probability Distribution ◽  
Spanning Tree ◽  
Spanning Trees ◽  
Sierpinski Gasket ◽  
Rational Numbers ◽  
Limiting Distribution ◽  
Two Dimensional ◽  
Sierpiński Gasket ◽  
Average Probability ◽  
International Audience

Combinatorics International audience Consider spanning trees on the two-dimensional Sierpinski gasket SG(n) where stage n is a non-negative integer. For any given vertex x of SG(n), we derive rigorously the probability distribution of the degree j ∈{1,2,3,4} at the vertex and its value in the infinite n limit. Adding up such probabilities of all the vertices divided by the number of vertices, we obtain the average probability distribution of the degree j. The corresponding limiting distribution φj gives the average probability that a vertex is connected by 1, 2, 3 or 4 bond(s) among all the spanning tree configurations. They are rational numbers given as φ1=10957/40464, φ2=6626035/13636368, φ3=2943139/13636368, φ4=124895/4545456.

scholarly journals 3x+1 Minus the +

2002 ◽  
Vol Vol. 5 ◽  
Author(s):  
Kenneth G. Monks
Keyword(s):  
Positive Integer ◽  
Rational Numbers ◽  
General Mechanism ◽  
Arbitrary Positive Integer ◽  
Arbitrary Integer ◽  
Constant Multiple ◽  
International Audience ◽  
Positive Integers

International audience We use Conway's \emphFractran language to derive a function R:\textbfZ^+ → \textbfZ^+ of the form R(n) = r_in if n ≡ i \bmod d where d is a positive integer, 0 ≤ i < d and r_0,r_1, ... r_d-1 are rational numbers, such that the famous 3x+1 conjecture holds if and only if the R-orbit of 2^n contains 2 for all positive integers n. We then show that the R-orbit of an arbitrary positive integer is a constant multiple of an orbit that contains a power of 2. Finally we apply our main result to show that any cycle \ x_0, ... ,x_m-1 \ of positive integers for the 3x+1 function must satisfy \par ∑ _i∈ \textbfE \lfloor x_i/2 \rfloor = ∑ _i∈ \textbfO \lfloor x_i/2 \rfloor +k. \par where \textbfO=\ i : x_i is odd \ , \textbfE=\ i : x_i is even \ , and k=|\textbfO|. \par The method used illustrates a general mechanism for deriving mathematical results about the iterative dynamics of arbitrary integer functions from \emphFractran algorithms.

scholarly journals Further Variations on the Six Exponentials Theorem.

2005 ◽  
Vol Volume 28 ◽  
Author(s):  
Michel Waldschmidt
Keyword(s):  
Present Note ◽  
Rational Numbers ◽  
Algebraic Numbers ◽  
Linearly Independent ◽  
International Audience ◽  
Rank 2

International audience According to the Six Exponentials Theorem, a $2\times 3$ matrix whose entries $\lambda_{ij}$ ($i=1,2$, $j=1,2,3$) are logarithms of algebraic numbers has rank $2$, as soon as the two rows as well as the three columns are linearly independent over the field $\BbbQ$ of rational numbers. The main result of the present note is that one at least of the three $2\times 2$ determinants, viz. $$ \lambda_{21}\lambda_{12}-\lambda_{11}\lambda_{22}, \quad \lambda_{22}\lambda_{13}-\lambda_{12}\lambda_{23}, \quad \lambda_{23}\lambda_{11}-\lambda_{13}\lambda_{21} $$ is transcendental.

scholarly journals Intersections of Amoebas

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Martina Juhnke-Kubitzke ◽  
Timo De Wolff
Keyword(s):  
Upper Bound ◽  
Connected Components ◽  
Algebraic Varieties ◽  
Connected Component ◽  
Absolute Value ◽  
Algebraic Torus ◽  
International Audience ◽  
Natural Way ◽  
Generalized Order

International audience Amoebas are projections of complex algebraic varieties in the algebraic torus under a Log-absolute value map, which have connections to various mathematical subjects. While amoebas of hypersurfaces have been inten- sively studied during the last years, the non-hypersurface case is barely understood so far. We investigate intersections of amoebas of n hypersurfaces in (C∗)n, which are genuine supersets of amoebas given by non-hypersurface vari- eties. Our main results are amoeba analogs of Bernstein's Theorem and Be ́zout's Theorem providing an upper bound for the number of connected components of such intersections. Moreover, we show that the order map for hypersur- face amoebas can be generalized in a natural way to intersections of amoebas. We show that, analogous to the case of amoebas of hypersurfaces, the restriction of this generalized order map to a single connected component is still 1-to-1.

scholarly journals On the critical exponent of generalized Thue-Morse words

2007 ◽  
Vol Vol. 9 no. 1 (Automata, Logic and Semantics) ◽  
Author(s):  
Alexandre B. Massé ◽  
Srečko Brlek ◽  
Amy Glen ◽  
Sébastien Labbé
Keyword(s):  
Critical Exponent ◽  
Rational Numbers ◽  
International Audience

Automata, Logic and Semantics International audience For certain generalized Thue-Morse words t, we compute the critical exponent, i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine exactly the occurrences of powers realizing it.

scholarly journals Proofs of two conjectures of Kenyon and Wilson on Dyck tilings

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Jang Soo Kim
Keyword(s):  
Inverse Matrix ◽  
Dimer Model ◽  
Absolute Value ◽  
Nous Trouvons ◽  
International Audience ◽  
The Absolute

International audience Recently, Kenyon and Wilson introduced a certain matrix M in order to compute pairing probabilities of what they call the double-dimer model. They showed that the absolute value of each entry of the inverse matrix $M^-1$ is equal to the number of certain Dyck tilings of a skew shape. They conjectured two formulas on the sum of the absolute values of the entries in a row or a column of $M^-1$. In this paper we prove the two conjectures. As a consequence we obtain that the sum of the absolute values of all entries of $M^-1$ is equal to the number of complete matchings. We also find a bijection between Dyck tilings and complete matchings. Récemment, Kenyon et Wilson ont introduit une certaine matrice M afin de calculer des probabilités d'appariement dans ce qu'ils appellent le modèle double-dimère. Ils ont montrè que la valeur absolue de chaque entrée de la matrice inverse $M^-1$ est égal au nombre de pavages de Dyck d'une certaine forme gauche. Ils ont conjecturè deux formules sur la somme des valeurs absolues des entrées dans une rangée ou une colonne de $M^-1$. Dans cet article, nous prouvons les deux conjectures. En conséquence on obtient que la somme des valeurs absolues de toutes les entrées de M^-1 est égale au nombre de couplages parfaits. Nous trouvons aussi une bijection entre les pavages de Dyck et les couplages parfaits.

scholarly journals Extended Rate, more GFUN

2006 ◽  
Vol DMTCS Proceedings vol. AG,... (Proceedings) ◽  
Author(s):  
Martin Rubey
Keyword(s):  
Software Package ◽  
Rational Functions ◽  
Rational Numbers ◽  
International Audience

International audience We present a software package that guesses formulas for sequences of, for example, rational numbers or rational functions, given the first few terms. Thereby we extend and complement Christian Krattenthaler’s program $\mathtt{Rate}$ and the relevant parts of Bruno Salvy and Paul Zimmermann’s $\mathtt{GFUN}$.

Sign in / Sign up

Export Citation Format

Share Document