Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEquivalent Binary Quadratic Form and the Extended Modular Group
154
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Extended modular group $bar{Pi}=<R,T,U:R^2=T^2=U^3=(RT)^2=(RU)^2=1>$, where $ R:zrightarrow -bar{z}, sim T:zrightarrowfrac{-1}{z},simU:zrightarrowfrac{-1}{z +1} $, has been used to study some properties of the binary quadratic forms whose base points lie in the point set fundamental region $F_{bar{Pi}}$ (See cite{Tekcan1, Flath}). In this paper we look at how base points have been used in the study of equivalent binary quadratic forms, and we prove that two positive definite forms are equivalent if and only if the base point of one form is mapped onto the base point of the other form under the action of the extended modular group and any positive definite integral form can be transformed into the reduced form of the same discriminant under the action of the extended modular group and extend these results for the subset $QQ^*(sqrt{-n})$ of the imaginary quadratic field $QQ(sqrt{-m})$.
rate research
Read More
We count the finitely generated subgroups of the modular group $textsf{PSL}(2,mathbb{Z})$. More precisely: each such subgroup $H$ can be represented by its Stallings graph $Gamma(H)$, we consider the number of vertices of $Gamma(H)$ to be the size of $H$ and we count the subgroups of size $n$. Since an index $n$ subgroup has size $n$, our results generalize the known results on the enumeration of the finite index subgroups of $textsf{PSL}(2,mathbb{Z})$. We give asymptotic equivalents for the number of finitely generated subgroups of $textsf{PSL}(2,mathbb{Z})$, as well as of the number of finite index subgroups, free subgroups and free finite index subgroups. We also give the expected value of the isomorphism type of a size $n$ subgroup and prove a large deviations statement concerning this value. Similar results are proved for finite index and for free subgroups. Finally, we show how to efficiently generate uniformly at random a size $n$ subgroup (resp. finite index subgroup, free subgroup) of $textsf{PSL}(2,mathbb{Z})$.
We show how to count and randomly generate finitely generated subgroups of the modular group $textsf{PSL}(2,mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for these subgroups. The combinatorial methods developed to achieve these results bring to light a natural map, which associates with any finitely generated subgroup of $textsf{PSL}(2,mathbb{Z})$ a graph which we call its silhouette, and which can be interpreted as a conjugacy class of free finite index subgroups of $textsf{PSL}(2,mathbb{Z})$.
In 1994 S. Bullett and C. Penrose introduced the one complex parameter family of $(2:2)$ holomorphic correspondences $mathcal{F}_a$: $$left(frac{aw-1}{w-1}right)^2+left(frac{aw-1}{w-1}right)left(frac{az+1}{z+1}right) +left(frac{az+1}{z+1}right)^2=3$$ and proved that for every value of $a in [4,7] subset mathbb{R}$ the correspondence $mathcal{F}_a$ is a mating between a quadratic polynomial $Q_c(z)=z^2+c,,,c in mathbb{R}$ and the modular group $Gamma=PSL(2,mathbb{Z})$. They conjectured that this is the case for every member of the family $mathcal{F}_a$ which has $a$ in the connectedness locus. We prove here that every member of the family $mathcal{F}_a$ which has $a$ in the connectedness locus is a mating between the modular group and an element of the parabolic quadratic family $Per_1(1)$.
We prove that there exists a homeomorphism $chi$ between the connectedness locus $mathcal{M}_{Gamma}$ for the family $mathcal{F}_a$ of $(2:2)$ holomorphic correspondences introduced by Bullett and Penrose, and the parabolic Mandelbrot set $mathcal{M}_1$. The homeomorphism $chi$ is dynamical ($mathcal{F}_a$ is a mating between $PSL(2,mathbb{Z})$ and $P_{chi(a)}$), it is conformal on the interior of $mathcal{M}_{Gamma}$, and it extends to a homeomorphism between suitably defined neighbourhoods in the respective one parameter moduli spaces. Following the recent proof by Petersen and Roesch that $mathcal{M}_1$ is homeomorphic to the classical Mandelbrot set $mathcal{M}$, we deduce that $mathcal{M}_{Gamma}$ is homeomorphic to $mathcal{M}$.
Many papers in the field of integer linear programming (ILP, for short) are devoted to problems of the type $max{c^top x colon A x = b,, x in mathbb{Z}^n_{geq 0}}$, where all the entries of $A,b,c$ are integer, parameterized by the number of rows of $A$ and $|A|_{max}$. This class of problems is known under the name of ILP problems in the standard form, adding the word bounded if $x leq u$, for some integer vector $u$. Recently, many new sparsity, proximity, and complexity results were obtained for bounded and unbounded ILP problems in the standard form. In this paper, we consider ILP problems in the canonical form $$max{c^top x colon b_l leq A x leq b_r,, x in mathbb{Z}^n},$$ where $b_l$ and $b_r$ are integer vectors. We assume that the integer matrix $A$ has the rank $n$, $(n + m)$ rows, $n$ columns, and parameterize the problem by $m$ and $Delta(A)$, where $Delta(A)$ is the maximum of $n times n$ sub-determinants of $A$, taken in the absolute value. We show that any ILP problem in the standard form can be polynomially reduced to some ILP problem in the canonical form, preserving $m$ and $Delta(A)$, but the reverse reduction is not always possible. More precisely, we define the class of generalized ILP problems in the standard form, which includes an additional group constraint, and prove the equivalence to ILP problems in the canonical form. We generalize known sparsity, proximity, and complexity bounds for ILP problems in the canonical form. Additionally, sometimes, we strengthen previously known results for ILP problems in the canonical form, and, sometimes, we give shorter proofs. Finally, we consider the special cases of $m in {0,1}$. By this way, we give specialised sparsity, proximity, and complexity bounds for the problems on simplices, Knapsack problems and Subset-Sum problems.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
