相关论文: Weighted Discriminants and Mass Formulas for Numbe…
Counting integral binary quadratic forms with certain restrictions is a classical problem. In this paper, we count binary quadratic forms of fixed discriminant given restrictions on the size of their coefficients. We accomplish this by…
In this paper, we consider codes over finite fields, finite abelian groups, and finite Frobenius rings. For such codes, the complete weight enumerator and the Hamming weight enumerator serve as powerful tools. These two types of weight…
In [6], Kohnen proves that if $\Gamma=\Gamma_0(N)$ where $N$ is a square-free integer, then any modular function of weight $0$ for $\Gamma$ having a divisor supported at the cusps is an $\eta$-product. Under the condition of having rational…
We prove for a $\Theta-$positive representation from a discrete subgroup $\Gamma\subset \mathsf{PSL}(2,\mathbb{R})$, the critical exponent for any $\alpha\in \Theta$ is not greater than one. When $\Gamma$ is geometrically finite, the…
Quantitative algebras are $\Sigma$-algebras acting on metric spaces, where operations are nonexpanding. Mardare, Panangaden and Plotkin introduced 1-basic varieties as categories of quantitative algebras presented by quantitative equations.…
In this paper, we study the weighted difference substitutions from geometrical views. First, we give the geometric meanings of the weighted difference substitutions, and introduce the concept of convergence of the sequence of substitution…
In the last decades, the theory of digamma function has been developed with a high impact of interest by many authors. Here, we established some interesting results for digamma function, and also we have computed the values of digamma…
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…
We consider weighted sums of independent random variables regulated by an increment sequence. We provide operative conditions that ensure strong law of large numbers for such sums to hold in both the centered and non-centered case. The…
We define a new weighted zeta function for a finite digraph and obtain its determinant expression called the Ihara expression. The graph zeta function is a generalization of the weighted graph zeta function introduced in previous research.…
$\imath$quantum groups are generalizations of quantum groups which appear as coideal subalgebras of quantum groups in the theory of quantum symmetric pairs. In this paper, we define the notion of classical weight modules over an…
In this article, we study a divisor function in an arbitrary number field akin to Koshliakov's work on Vorono\"{\dotlessi} summation formula. More precisely, we generalize Koshliakov's kernel and Koshliakov's transform over any number field…
We study Brown's definition of the probabilistic zeta function of a finite lattice as a generalization of that of a finite group. We propose a natural alternative or extension that may be better suited for non-atomistic lattices. The…
The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…
The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…
We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…
The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…
We discuss the best methods available for computing the gamma function $\Gamma(z)$ in arbitrary-precision arithmetic with rigorous error bounds. We address different cases: rational, algebraic, real or complex arguments; large or small…
We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…
We introduce new zeta functions related to an endomorphism $\phi$ of a discrete group $\Gamma$. They are of two types: counting numbers of fixed ($\rho\sim \rho\circ\phi^n$) irreducible representations for iterations of $\phi$ from an…