Exploració per tema "Number theory"
Ara es mostren els items 36-55 de 83
-
Galois action on $\bar{\mathbb Q}$-isogeny classes of abelian $L$-surfaces with quaternionic multiplication
(2017-12-08)
Article
Accés obertWe construct a projective Galois representation attached to an abelian L-surface with quaternionic multiplication, describing the Galois action on its Tate module. We prove that such representation characterizes the Galois ... -
Hamilton y la teoría de Galois
(2006-03-08)
Audiovisual
Accés obertIndudablemente uno de los legados más importantes de Hamilton es la rama de la teoría de ecuaciones diferenciales que en honor a su nombre se denomina Sistemas Hamiltonianos. Ejemplos de sistemas Hamiltonianos son la ... -
Harmonic distance in intervals and chords
(2019-05-01)
Article
Accés obertThe harmonic distance between two pure tones, in the sense used by Tenney, is generalised to chords whose pitches are harmonic fractions. In the tonal graph generated by the harmonics involved in a chord, which for n-TET ... -
Heegner's lemma
(Universitat Politècnica de Catalunya, 2019-10)
Projecte Final de Màster Oficial
Accés obertEs un treball que explica una mica com Heegner va fer per trobar una familia de nombre congruents. Tambe explico les eienes que es necessiten de class field theory i modular functions. També explica el metode de descents ... -
High-order mesh curving by distortion minimization with boundary nodes free to slide on a 3D CAD representation
(2016-03)
Article
Accés obertWe propose a 3D mesh curving method that converts a straight-sided mesh to an optimal-quality curved high-order mesh that interpolates a CAD boundary representation. The main application of this method is the generation ... -
Hybridizable Discontinuous Galerkin with degree adaptivity for the incompressible Navier-Stokes equations
(Elsevier, 2014-07-02)
Article
Accés obertA degree adaptive Hybridizable Discontinuous Galerkin (HDG) method for the solution of the incompressible Navier-Stokes equations is presented. The key ingredient is an accurate and computationally inexpensive a posteriori ... -
La funció Z de Riemann
(2007-09-19)
Audiovisual
Accés obertEl novembre de 1859 Riemann envià un manuscrit de sis fulls a l’Acadèmia de Berlín titulat Sobre el nombre de primers menors que una quantitat donada, el qual seria l’única publicació dedicada a la teoria de nombres de ... -
La mitjana aritmètico-geomètrica de Gauss
(Universitat Politècnica de Catalunya, 2021-07)
Treball Final de Grau
Accés obertLa mitjana aritmètico-geomètrica de Gauss (MAG) neix com a eina per calcular numèricament integrals el·líptiques. Aquesta successió apareix per primer cop en notes de Lagrange, però va ser Gauss qui va descobrir realment ... -
Large graphs of diameter two and given degree
(Iniciativa Digital Politècnica, 2011)
Text en actes de congrés
Accés obertLet r(d, 2), C(d, 2), and AC(d, 2) be the largest order of a regular graph, a Cayley graph, and a Cayley graph of an Abelian group, respectively, of diameter 2 and degree d. The best currently known lower bounds on these ... -
Mock modular forms
(Universitat Politècnica de Catalunya, 2019-07)
Treball Final de Grau
Accés obertEn aquest treball estudiem la recent teoria de les formes modulars de mock i en veiem algunes aplicacions. -
Modular curves and complex multiplication
(Universitat Politècnica de Catalunya, 2018-07)
Projecte Final de Màster Oficial
Accés obertIn this project we explore the connections between elliptic curves, modular curves and complex multiplication (CM). The main theorem of CM shows that the theory of CM for elliptic curves provides an explicit construction ... -
Modular symbols
(Universitat Politècnica de Catalunya, 2016-05)
Treball Final de Grau
Accés obertModular forms are holomorphic functions defined on the complex upper half-plane which transform in a certain way under the action of a group of matrices. Alternatively, they can be thought of as differential forms on a ... -
New results on metric-locating-dominating sets of graphs
(2016-04-13)
Report de recerca
Accés obertA dominating set S of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distanc es from the elements of S , and the minimum cardinality of such a set is called the ... -
No anul·lació de funcions L en valors crítics i resultats d'equidistribució en aritmètica
(Universitat Politècnica de Catalunya, 2009-10)
Projecte Final de Màster Oficial
Accés obertL'objectiu del treball és revisar els principals resultats d'equidistribució en aritmètica. En primer terme es presenten i demostren el Teorema de densitat de Dirichlet i el Teorema de densitat de Chebotarev. La part central ... -
Numerical differentiation for local and global tangent operators in computational plasticity
(2000)
Article
Accés obertIn this paper, numerical di¿erentiation is applied to integrate plastic constitutive laws and to compute the corresponding consistent tangent operators. The derivatives of the constitutive equations are approximated by ... -
On a question of Sárkozy and Sós for bilinear forms
(2009-02-02)
Article
Accés restringit per política de l'editorialWe prove that if 2 ≤ k1 ≤ k2, then there is no infinite sequence $\emph{A}$ of positive integers such that the representation function r(n)=#{(a, a'): n=$k{_1}a$ + $k{_2}a'$, a,a' ∊ $\emph{A}$} is constant for n large ... -
On elliptic Galois representations and genus-zero modular units
(2006-07-03)
Article
Accés obertGiven an odd prime \,$p$\, and a representation $\varrho$\, of the absolute Galois group of a number field $k$ onto $\mathrm{PGL}_2(\mathbb{F}_p)$ with cyclotomic determinant, the moduli space of elliptic curves defined ... -
On monochromatic solutions of equations in groups
(2006-01-12)
Article
Accés obertResum no disponible -
On PGZ decoding of alternant codes
(2019-03-01)
Article
Accés obertIn this paper, we first review the classical Petterson–Gorenstein–Zierler decoding algorithm for the class of alternant codes, which includes Reed–Solomon, Bose–Chaudhuri–Hocquenghem and classical Goppa codes. Afterwards, ... -
On some classes of irreducible polynomials
(2020-07)
Article
Accés obertOne of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irreducible factors. The aim of the paper is to produce new families of irreducible polynomials, generalizing previous results ...
