3,792 research outputs found

    Middle divisors and σ\sigma-palindromic Dyck words

    Full text link
    Given a real number λ>1\lambda > 1, we say that dnd|n is a λ\lambda-middle divisor of nn if nλ<dλn. \sqrt{\frac{n}{\lambda}} < d \leq \sqrt{\lambda n}. We will prove that there are integers having an arbitrarily large number of λ\lambda-middle divisors. Consider the word  ⁣n ⁣λ:=w1w2...wk{a,b}, \langle\! \langle n \rangle\! \rangle_{\lambda} := w_1 w_2 ... w_k \in \{a,b\}^{\ast}, given by wi:={aif uiDn\(λDn),bif ui(λDn)\Dn, w_i := \left\{ \begin{array}{c l} a & \textrm{if } u_i \in D_n \backslash \left(\lambda D_n\right), \\ b & \textrm{if } u_i \in \left(\lambda D_n\right)\backslash D_n, \end{array} \right. where DnD_n is the set of divisors of nn, λDn:={λd:dDn}\lambda D_n := \{\lambda d: \quad d \in D_n\} and u1,u2,...,uku_1, u_2, ..., u_k are the elements of the symmetric difference DnλDnD_n \triangle \lambda D_n written in increasing order. We will prove that the language Lλ:={ ⁣n ⁣λ:nZ1} \mathcal{L}_{\lambda} := \left\{\langle\! \langle n \rangle\! \rangle_{\lambda} : \quad n \in \mathbb{Z}_{\geq 1} \right\} contains Dyck words having an arbitrarily large number of centered tunnels. We will show a connection between both results

    A relationship between the ideals of Fq[x,y,x1,y1]\mathbb{F}_q\left[x, y, x^{-1}, y^{-1} \right] and the Fibonacci numbers

    Full text link
    Let Cn(q)C_n(q) be the number of ideals of codimension nn of Fq[x,y,x1,y1]\mathbb{F}_q\left[x, y, x^{-1}, y^{-1} \right], where Fq\mathbb{F}_q is the finite field with qq elements. Kassel and Reutenauer [KasselReutenauer2015A] proved that Cn(q)C_n(q) is a polynomial in qq for any fixed value of n1n \geq 1. For q=3+52q = \frac{3+\sqrt{5}}{2}, this combinatorial interpretation of Cn(q)C_n(q) is lost. Nevertheless, an unexpected connexion with Fibonacci numbers appears. Let fnf_n be the nn-th Fibonacci number (following the convention f0=0f_0 = 0, f1=1f_1 = 1). Define the series F(t)=n1f2ntn. F(t) = \sum_{n \geq 1} f_{2n}\,t^n. We will prove that for each n1n \geq 1, Cn(3+52)=λn(f2n3+52f2n2), C_n\left( \frac{3+\sqrt{5}}{2}\right) = \lambda_n \, \left(f_{2n} \frac{3+\sqrt{5}}{2} - f_{2n-2} \right) , where the integers λn0\lambda_n \geq 0 are given by the following generating function \prod_{m \geq 1} \left(1+F\left( t^m\right)\right) = 1 + \sum_{n \geq 1} \lambda_n\,t^n. $

    On a function introduced by Erd\"{o}s and Nicolas

    Full text link
    Erd\"os and Nicolas [erdos1976methodes] introduced an arithmetical function F(n)F(n) related to divisors of nn in short intervals ]t2,t]\left] \frac{t}{2}, t\right]. The aim of this note is to prove that F(n)F(n) is the largest coefficient of polynomial Pn(q)P_n(q) introduced by Kassel and Reutenauer [kassel2015counting]. We deduce that Pn(q)P_n(q) has a coefficient larger than 11 if and only if 2n2n is the perimeter of a Pythagorean triangle. We improve a result due to Vatne [vatne2017sequence] concerning the coefficients of Pn(q)P_n(q)

    On prime numbers of the form 2n±k2^n \pm k

    Full text link
    Consider the set K\mathcal{K} of integers kk for which there are infinitely many primes pp such that p+kp+k is a power of 22. The aim of this paper is to show a relationship between K\mathcal{K} and the limits points of some set rational numbers related to a sequence of polynomials Cn(q)C_n(q) introduced by Kassel and Reutenauer [KasselReutenauer]

    Factorization of Dyck words and the distribution of the divisors of an integer

    Full text link
    In [CaballeroHooleyDelta], we associated a Dyck word  ⁣n ⁣λ\langle\! \langle n \rangle\! \rangle_{\lambda} to any pair (n,λ)(n, \lambda) consisting of an integer n1n \geq 1 and a real number λ>1\lambda > 1. The goal of the present paper is to show a relationship between the factorization of  ⁣n ⁣λ\langle\! \langle n \rangle\! \rangle_{\lambda} as the concatenation of irreducible Dyck words and the distribution of the divisors of nn. In particular, we will provide a characterization of λ\lambda-densely divisible numbers (these numbers were introduced in [castryck2014new])

    Relative positions of points on the real line and balanced parentheses

    Full text link
    Consider a finite set of positive real numbers SS. For any real number λ>1\lambda > 1, a Dyck word denoted  ⁣S ⁣λ{a,b}\langle\! \langle S \rangle\! \rangle_{\lambda} \in \{a,b\}^{\ast}, was defined in [CaballeroWords2017] in order to compute Hooley's Δ\Delta-function and its generalization. The aim of this paper is to prove that, given a real number λ>1\lambda > 1, any Dyck word can be expressed as  ⁣S ⁣λ\langle\! \langle S \rangle\! \rangle_{\lambda} for some finite set SS of positive real numbers

    Self-Similar Algebras with connections to Run-length Encoding and Rational Languages

    Full text link
    A self-similar algebra (A,ψ)\left(\mathfrak{A}, \psi \right) is an associative algebra A\mathfrak{A} with a morphism of algebras ψ:AMd(A)\psi: \mathfrak{A} \longrightarrow M_d \left( \mathfrak{A}\right), where Md(A)M_d \left( \mathfrak{A}\right) is the set of d×dd\times d matrices with coefficients from A\mathfrak{A}. We study the connection between self-similar algebras with run-length encoding and rational languages. In particular, we provide a curious relationship between the eigenvalues of a sequence of matrices related to a specific self-similar algebra and the smooth words over a 2-letter alphabet. We also consider the language L(s)L(s) of words uu in (Σ×Σ)(\Sigma\times \Sigma)^* where Σ={0,1}\Sigma=\{0,1\} such that sus\cdot u is a unit in A\mathfrak{A}. We prove that L(s)L(s) is rational and provide an asymptotic formula for the number of words of a given length in L(s)L(s)

    Las tres muertes del Mariscal Sucre

    Get PDF
    pags. 129-15

    Responsabilidad en casos de detenciones o privación de libertad con resultado de muerte

    Get PDF
    Cada vez son más los casos en donde una persona muere durante el forcejeo que mantiene con las Fuerzas y Cuerpos de Seguridad del Estado durante el proceso de detención. Esto supone un gran reto profesional para el médico forense que realiza la autopsia. En muchas ocasiones, los resultados obtenidos tras la autopsia no son entendidos por la sociedad, familiares del fallecido ni correctamente divulgados por los medios de comunicación, pareciendo que dicha muerte queda en un limbo judicial. Estas muertes, generalmente son consecuencia del síndrome de delirium agitado. Este síndrome no es bien conocido en nuestro país por parte de médicos ni por cuerpos de seguridad. Se engloban dentro de las muertes en privación de libertad o death in custody. En su producción intervienen factores como la patología previa del paciente, consumo de drogas, especialmente cocaína, y la forma de llevar a cabo el proceso de inmovilización del detenido.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech
    corecore