CINXE.COM

<!DOCTYPE html>  <html lang="en"><head> <meta charset="utf-8"/> <link rel="apple-touch-icon" sizes="180x180" href="icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="icons/favicon-16x16.png"> <link rel="manifest" href="icons/site.webmanifest"> <meta name="google" content="notranslate" /> <meta http-equiv="Content-Language" content="en"/> <meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no"> <title>RSME's 7th Congress of Young Researchers: Posters</title> <meta name="description" content="Posters of the RSME's 7th Congress of Young Researchers (Bilbao, 2025)." />  <meta property="og:type" content="website" > <meta property="og:locale" content="en_US" /> <meta property="og:locale:alternate" content="es_ES" /> <meta property="og:locale:alternate" content="eu" /> <meta property="og:url" content="https://jovenes2025.rsme.es/posteres_en.html" /> <meta property="og:title" content="RSME's 7th Congress of Young Researchers: Posters" /> <meta property="og:description" content="Posters of the RSME's 7th Congress of Young Researchers (Bilbao, 2025)."> <meta property="og:image" content="https://jovenes2025.rsme.es/imgs/logoSM_en.png">  <meta name="twitter:card" content="summary" /> <meta name="twitter:site" content="@RealSocMatEsp" /> <meta name="twitter:creator" content="@tonellicueto" /> <meta name="twitter:title" content="RSME's 7th Congress of Young Researchers: Posters" /> <meta name="twitter:description" content="Posters of the RSME's 7th Congress of Young Researchers (Bilbao, 2025)." /> <meta name="twitter:image" content="https://jovenes2025.rsme.es/imgs/logoSM_en.png" />  <link href="css/bootstrap.min.css" rel="stylesheet"/>  <style> @media print, screen and (min-width:991px){ .jumbotron{ background-position:50% 40%;background-image: url(imgs/bg_posteres.JPG); }} @media print, screen and (max-width:990px){ .jumbotron{ background-position:50% 40%;background-image: url(imgs/bgphone_posteres.JPG); }} </style> <link href="css/style.css" rel="stylesheet"/> </head> <body> <nav class="navbar navbar-toggleable-md navbar-inverse fixed-top navbar-custom"> <button class="navbar-toggler navbar-toggler-right" type="button" data-toggle="collapse" data-target="#navbarsExampleDefault" aria-controls="navbarsExampleDefault" aria-expanded="false" aria-label="Toggle navigation" style="background-color: var(--colorbarA);color: var(--colorbarB);"> Menu <span class="navbar-toggler-icon" style="background-color: var(--colorbarA);color: var(--colorbarB);"></span> </button> <a class="navbar-brand" href="index_en.html"><img src="imgs/logo.png" alt="weblogo"/></a> <div class="collapse navbar-collapse " id="navbarsExampleDefault"> <ul class="navbar-nav mr-auto"> <li class="nav-item"> <a class="nav-link" href="index_en.html">Home</a> </li> <li id="menuphoneProg" class="nav-item active" > <a class="nav-link" href="programa_en.html">Program</a> </li> <li id="menucompProg" class="nav-item active dropdown"> <a class="nav-link dropdown-toggle" href="programa_en.html" id="dropdown01" data-hover="dropdown" aria-haspopup="true" aria-expanded="false">Program</a> <div id="compmenu1" class="dropdown-menu" aria-labelledby="dropdown01"> <a class="dropdown-item" href="plenarias_en.html">Plenary Talks</a> <a class="dropdown-item" href="sesiones_en.html">Parallel Sessions</a> <a class="dropdown-item active" href="posteres_en.html">Posters</a> <a class="dropdown-item" href="mesasredondas_en.html">Round Tables</a> <a class="dropdown-item" href="divulgacion_en.html">Science Popularization Activity</a> <a class="dropdown-item" href="social_en.html">Social Program</a> </div> </li> <li id="menuphoneEvent" class="nav-item" > <a class="nav-link" href="eventos_en.html">Events</a> </li> <li id="menucompEvent" class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="eventos_en.html" id="dropdown02" data-hover="dropdown" aria-haspopup="true" aria-expanded="false">Events</a> <div id="compmenu2" class="dropdown-menu" aria-labelledby="dropdown02"> <a class="dropdown-item" href="mesasredondas_en.html">Round Tables</a> <a class="dropdown-item" href="divulgacion_en.html">Science Popularization Activity</a> <a class="dropdown-item" href="social_en.html">Social Program</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="horario_en.html">Schedule</a> </li> <li id="menuphoneSede" class="nav-item" > <a class="nav-link" href="sedeinflocal_en.html">Venue & Local Information</a> </li> <li id="menucompSede" class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="sedeinflocal_en.html" id="dropdown03" data-hover="dropdown" aria-haspopup="true" aria-expanded="false">Venue & Local Information</a> <div id="compmenu3" class="dropdown-menu" aria-labelledby="dropdown03"> <a class="dropdown-item" href="sede_en.html">Venue</a> <a class="dropdown-item" href="transporte_en.html">Public Transit</a> <a class="dropdown-item" href="bilbao_en.html">Bilbao</a> <a class="dropdown-item" href="alojamiento_en.html">Lodging</a> <a class="dropdown-item" href="viaje_en.html">Travel</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="inscripcion_en.html">Registration</a> </li>  </ul> <ul class="navbar-nav r-auto"> <li class="nav-item active"> <a class="nav-link" href="posteres_en.html">en</a> </li> <li class="nav-item"> <a class="nav-link" href="posteres.html">es</a> </li> <li class="nav-item"> <a class="nav-link" href="posteres_eu.html">eu</a> </li> </ul> </div> </nav>  <div class="jumbotron"> <div class="container"> <h1 class="display-4">Posters</h1> </div> </div> <div class="container"> <div class="row"><div class="col-md-12"><a class="btn btn-colora" href="fechasimportantes_en.html" style="width:100%;">Important Dates</a></div></div> <hr/> <div class="row"><div class="col-md-12"><a class="btn btn-colora" href="posteres_envio_en.html" style="width:100%;">Submission of Posters</a></div></div> <hr/> <p id="infocomp1"> In the RSME's 7th Congress of Young Researchers, a total of 21 posters will be presented. Posters' descriptions can be found below ordered alphabetically in terms of the surname of the presenters. The posters will be visible at <a href="sede.html#aulamagna">Great Hall's Foyer</a>, while presentations will be during the 1st session <a href="recepciones.html">(during the welcome reception)</a> or the 2nd session <a href="cafe.html#cafe6">(during the coffee break on Thursday morning)</a>, as the code of each poster indicates. </p> <hr id="infocomp2"/> <h2 id="posterP2.A" style="text-align:center;color:var(--colorlink);">Poster <em>P2.A</em></h2><h2 style="text-align:center;">Analyzing Certain Geometric Progressions Modulo 1<br/>Through Integer Recurrence Sequences</h2><h3 class="presenter" style="text-align:center;">Federico Accossato </h3><h4 class="institution" style="font-style: italic;text-align:center;">(Politecnico di Torino)</h4><p>It is known that if $\alpha$ is a Pisot number and $\xi >0$ lies in $\mathbb{Q}(\alpha)$ then the sequence $(\xi \alpha^n)_n$ has finitely many limit points modulo 1. This raises the question of whether it is possible to construct such sequences with a prescribed number of limit points, a problem closely linked to identifying linear recurrences with a prefixed number of residues modulo an integer. Recent results on this problem are presented.</p><p>Joint work with Carlo Sanna.</p><div class="row"><div class="col-md-3"></div><div class="col-md-6"><a class="btn btn-colorinv" href="https://arxiv.org/abs/2401.07661" style="width:100%;">arXiv:2401.07661</a></div><div class="col-md-3"></div></div><hr/><hr/> <h2 id="posterP1.A" style="text-align:center;color:var(--colorlink);">Poster <em>P1.A</em></h2><h2 style="text-align:center;">Three balls inequalities for Schr枚dinger operators on periodic graphs</h2><h3 class="presenter" style="text-align:center;">Yann Bourroux</h3><h4 class="institution" style="font-style: italic;text-align:center;">(UPV/EHU)</h4><p>Three balls inequalities are a useful tool in the study of unique continuation properties in the continuum. Our goal is to extend these inequalities to certain discrete lattices, known as periodic graphs. Periodic graphs are graphs in $\mathbb{R}^d$ that remain invariant under translations of particular vectors. We prove that such inequalities holds for Schr枚dinger operators on a family of periodic graph, and for Laplace operators on a wider family.</p><p>Joint work with Aingeru Fernandez Bertolin and Philippe Jaming.</p><hr/><hr/> <h2 id="posterP1.B" style="text-align:center;color:var(--colorlink);">Poster <em>P1.B</em></h2><h2 style="text-align:center;">Linear Probing of Deep Neural Networks with Minimax Risk Classifiers</h2><h3 class="presenter" style="text-align:center;">Eugenio Cainelli</h3><h4 class="institution" style="font-style: italic;text-align:center;">(BCAM)</h4><p>We propose a novel linear probing method for deep transfer learning using minimax risk classifiers (MRCs). This approach ensures robust learning with tight performance bounds. Additionally, we introduce a faster, effective model selection procedure leveraging MRC-provided upper bound, offering a more robust alternative to traditional methods.</p><p>Joint work with Santiago Mazuelas.</p><hr/><hr/> <h2 id="posterP1.C" style="text-align:center;color:var(--colorlink);">Poster <em>P1.C</em></h2><h2 style="text-align:center;">Integration of Li茅nard I-type equations via $C^\infty$-structures.</h2><h3 class="presenter" style="text-align:center;">Beltr谩n de la Flor Gandarillas</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad de C谩diz)</h4><p>We propose a new procedure of integration for a class of Li茅nard I-type second-order equations based on the construction of an associated $C^\infty$-structure using a Lie point symmetry and a $C^\infty$-symmetry of the equation. As an application, we obtain a two-parametric family of travelling wave solutions to a nonlinear partial differential equation which models weakly nonlinear phenomena in a media with convection, diffusion and dissipation. </p><p>Joint work with Adri谩n Ruiz Serv谩n and M陋 Concepci贸n Muriel Patino.</p><hr/><hr/> <h2 id="posterP2.B" style="text-align:center;color:var(--colorlink);">Poster <em>P2.B</em></h2><h2 style="text-align:center;">Open problems in greedy approximation theory</h2><h3 class="presenter" style="text-align:center;">Andrea Garc铆a Pons</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad CEU San Pablo)</h4><p>Greedy algorithms are a fundamental category of algorithms in mathematics and computer science, characterized by their iterative, locally optimal decision-making approach, which aims to find global optima. In this poster, we will discuss and pose some open questions about two greedy algorithms: the so-called Relaxed Greedy Algorithm and the Thresholding Greedy Algorithm.</p><p></p><hr/><hr/> <h2 id="posterP1.D" style="text-align:center;color:var(--colorlink);">Poster <em>P1.D</em></h2><h2 style="text-align:center;">Discrete degree of symmetry</h2><h3 class="presenter" style="text-align:center;">Jordi Garriga Puig</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universitat de Barcelona)</h4><p>A central question in transformation group theory is determining which finite groups act effectively on a given manifold, and a full answer remains elusive. Two main results describe finite abelian groups act on a manifold: the Mann-Su and the CarlssonBaumgartner theorems. This poster introduces the discrete degree of symmetry, an invariant for effective actions of sequences of finite abelian groups of increasing size, analogous to the toral degree of symmetry.</p><p></p><hr/><hr/> <h2 id="posterP2.C" style="text-align:center;color:var(--colorlink);">Poster <em>P2.C</em></h2><h2 style="text-align:center;">Topological Realization of permutation modules</h2><h3 class="presenter" style="text-align:center;">Rafael Gomes</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad de M谩laga)</h4><p>We find a solution to the problem of realizing (finitely generated) permutation modules in topological spaces. This can be seen as a combination of the Kanh's realizability problem for abstract groups and the G-Moore space problem, as it involves realizing a (finite) group G as the group of self homotopy equivalences of a space X, a module M as its integral homology and the action of the group G on such module.</p><p>Joint work with Cristina Costoya and Antonio Viruel.</p><div class="row"><div class="col-md-3"></div><div class="col-md-6"><a class="btn btn-colorinv" href="https://arxiv.org/abs/2308.16675" style="width:100%;">arXiv:2308.16675</a></div><div class="col-md-3"></div></div><hr/><hr/> <h2 id="posterP1.E" style="text-align:center;color:var(--colorlink);">Poster <em>P1.E</em></h2><h2 style="text-align:center;">A group-theoretic approach to quantum gate teleportation</h2><h3 class="presenter" style="text-align:center;">Samuel Gonz谩lez-Castillo</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad de Oviedo)</h4><p>We study the Clifford hierarchy from a group-theoretic perspective, deducing general properties about the cardinality of its levels. These are applicable not just to the usual Clifford hierarchy, but to any analogous construction. With our approach, it is possible to easily deduce results like the finitude of all the levels of general Clifford hierarchies, showing that a bounded number of applications of gate teleporataion schemes can only yield a finite number of fault-tolerant gates.</p><p>Joint work with El铆as F. Combarro and Ignacio F. R煤a.</p><hr/><hr/> <h2 id="posterP2.D" style="text-align:center;color:var(--colorlink);">Poster <em>P2.D</em></h2><h2 style="text-align:center;">Families of uninorms</h2><h3 class="presenter" style="text-align:center;">Ander Go帽i Medrano</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad P煤blica de Navarra)</h4><p>In this poster, we extend families of the so-called continuous triangular norms to define families of continuous uninorms within the open square $(0,1)^2$. By leveraging boundary conditions and parameterizations of triangular norms, we construct uninorms that satisfy key aggregation properties. This approach yields new families of uninorms with distinct behaviors, opening avenues for novel aggregation operators.</p><p>Work supervised by Marisol G贸mez and Ra煤l P茅rez-Fern谩ndez.</p><hr/><hr/> <h2 id="posterP1.F" style="text-align:center;color:var(--colorlink);">Poster <em>P1.F</em></h2><h2 style="text-align:center;">On $L_p$ Brunn-Minkowski type inequalities<br/>for a general class of functionals</h2><h3 class="presenter" style="text-align:center;">Lidia Gordo Malag贸n</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad de Murcia)</h4><p>In this poster we will collect different Brunn-Minkowski type inequalities for a general class of functionals, defined on the family of convex bodies, when dealing with the p-sum of the sets involved.</p><p>As a particular case of our approach, we will derive new Lp Brunn-Minkowski type inequalities for both the standard Gaussian measure and the so-called Wills functional, tools of high interest in Convex Geometric Analysis, as shown by the amount of different recent research works on them.</p><p>Joint work with Jes煤s Yepes Nicol谩s.</p><hr/><hr/> <h2 id="posterP1.G" style="text-align:center;color:var(--colorlink);">Poster <em>P1.G</em></h2><h2 style="text-align:center;">On testing effective archimedeanity of quadratic modules</h2><h3 class="presenter" style="text-align:center;">Joel Hurtado Moreno</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universitat de Barcelona)</h4><p>In real algebraic geometry, the archimedeanity of quadratic modules is crucial for results like Putinar鈥檚 Positivstellensatz. Only theoretical characterizations of this property exist so far. Our approach provides a computational approximation, yielding a concrete decomposition within the quadratic module when it is archimedean. Optimized through parallelization, our implementation has been tested on the MareNostrum 5 supercomputer at the Barcelona Supercomputing Center.</p><p>Joint work with Carlos D'Andrea.</p><hr/><hr/> <h2 id="posterP1.H" style="text-align:center;color:var(--colorlink);">Poster <em>P1.H</em></h2><h2 style="text-align:center;">Duality in mass-action networks:<br/>A step closer to a new case of the Global Attractor Conjecture? </h2><h3 class="presenter" style="text-align:center;">Alexandru Iosif</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad Rey Juan Carlos)</h4><p>Mass-action networks have semialgebraic steady state varieties. We introduce maximal invariant polyhedral supports (MIPS) and we prove that preclusters are dual to maximal invariant polyhedral supports. Given the close relation between MIPS and siphons, we conjecture that siphons and clusters are dual objects, which, we believe, based on the recent work of Craciun et al., might lead to the absence of boundary steady states in toric systems with small codimensional invariant polyhedra.</p><p>Joint work with Lamprini Ananiadi.</p><hr/><hr/> <h2 id="posterP1.I" style="text-align:center;color:var(--colorlink);">Poster <em>P1.I</em></h2><h2 style="text-align:center;">Optimality of the Median-of-Means for Different Distribution Classes<br/>in Adversarial Settings</h2><h3 class="presenter" style="text-align:center;">Xabier de Juan Soriano</h3><h4 class="institution" style="font-style: italic;text-align:center;">(BCAM)</h4><p>The Median-of-Means (MoM) estimator is a widely used robust estimator of the mean that is known to achieve the (minimax) optimal estimation error order for heavy-tailed distributions. However, its optimality under adversarial contamination was unknown. In this work, we prove that MoM is optimal in different distributions classes under adversarial contamination. We also identify classes of distributions where MoM becomes suboptimal.</p><p>Joint work with Santiago Mazuelas.</p><hr/><hr/> <h2 id="posterP2.E" style="text-align:center;color:var(--colorlink);">Poster <em>P2.E</em></h2><h2 style="text-align:center;">Bridgeland Stability Conditions</h2><h3 class="presenter" style="text-align:center;">Llu铆s Ll脿cer Sansaloni</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universitat de Barcelona)</h4><p>The derived category of coherent sheaves encodes important geometric information of a variety. Stability conditions provide the notion of polarization on triangulated categories and have been built in the derived category of projective surfaces and some threefolds. However, constructing and describing the space of these stability conditions remains a challenging problem. In this poster we review the actual state of the art.</p><p></p><hr/><hr/> <h2 id="posterP1.J" style="text-align:center;color:var(--colorlink);">Poster <em>P1.J</em></h2><h2 style="text-align:center;">Some quantum algorithms for black-box algebraic structures</h2><h3 class="presenter" style="text-align:center;">Guillermo Lugilde</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad de Oviedo)</h4><p>We dig into a variety of quantum algorithms for black-box groups, rings and magmas, and their complexity. A key result is proved: given a generating set for a subring, we extend it to an additive generating set in polynomial time. This allows several subring problems to be reduced to already solved abelian group problems. The ideality of a subring is also addressed. For magmas, we analyze existence problems and a generalization of the Deutsch-Jozsa algorithm that remains deterministic.</p><p>Joint work with El铆as F. Comabrro and Ignacio F. R煤a.</p><hr/><hr/> <h2 id="posterP2.F" style="text-align:center;color:var(--colorlink);">Poster <em>P2.F</em></h2><h2 style="text-align:center;">Training Implicit Generative Models via an Invariant Statistical Loss</h2><h3 class="presenter" style="text-align:center;">Jos茅 Manuel de Frutos Porras</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad Carlos III de Madrid)</h4><p>Implicit generative models often struggle with unstable training and mode-dropping when using adversarial discriminators, even in simple 1D cases. This work introduces a novel approach for training 1D implicit models, applying a loss function that measures the discrepancy between the model's samples and a uniform distribution. We extend this method to handle univariate and multivariate temporal data, offering a solution for complex distributions and addressing GAN mode collapse challenges.</p><p>Joint work with Pablo Olmos, Manuel Alberto V谩zquez and Joaqu铆n M铆guez.</p><div class="row"><div class="col-md-3"></div><div class="col-md-6"><a class="btn btn-colorinv" href="https://arxiv.org/abs/2402.16435" style="width:100%;">arXiv:2402.16435</a></div><div class="col-md-3"></div></div><hr/><hr/> <h2 id="posterP2.G" style="text-align:center;color:var(--colorlink);">Poster <em>P2.G</em></h2><h2 style="text-align:center;">Fast Fourier Transfom</h2><div class="row"><div class="col-md-1"></div><div class="col-md-5"><h3 class="presenter" style="text-align:center;">Federico Cabrera Linares</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad de Granada)</h4></div><div class="col-md-5"><h3 class="presenter" style="text-align:center;">Isabel Mar铆a Moreno Cuadrado</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad Complutense de Madrid)</h4></div><div class="col-md-1"></div></div><p>This poster reviews the Fast Fourier Transform (FFT) algorithm, focusing on its impact on signal processing and computation. Based on the Cooley-Tukey paper, which introduced an efficient method for calculating the Discrete Fourier Transform (DFT) and its inverse (IDFT), it highlights the FFT's role in reducing computational complexity. The presentation covers the algorithm鈥檚 history, compares direct DFT and FFT-1D complexity.</p><p></p><hr/><hr/> <h2 id="posterP2.H" style="text-align:center;color:var(--colorlink);">Poster <em>P2.H</em></h2><h2 style="text-align:center;">Some characterizations of $k$-extremal hyperbolic surfaces</h2><h3 class="presenter" style="text-align:center;">Claudia Mu帽oz Jer贸nimo</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad Aut贸noma de Madrid)</h4><p>Hyperbolic surfaces have a natural metric inherited from the hyperbolic metric on $\mathbb{H}$, so we can embed metric discs on them and study the maximum radius of the disc $k$-packings embedded on them. In this poster, we introduce an upper bound for the radius of a $k$-packing on a complete, finite-area hyperbolic surface and then, we comment on a couple of characterizations of $k$-extremal surfaces, that is, hyperbolic surfaces that admit a $k$-packing whose radius attains this upper bound.</p><p>Joint work with Ernesto Girondo.</p><hr/><hr/> <h2 id="posterP2.I" style="text-align:center;color:var(--colorlink);">Poster <em>P2.I</em></h2><h2 style="text-align:center;">Laplace particle filtering on Lie groups</h2><h3 class="presenter" style="text-align:center;">Irene Sanz</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Universidad de La Rioja)</h4><p>Dynamic systems often involve states in complex spaces like Lie groups. This work explores using particle filters to infer states in nonlinear systems, where probability densities are represented by particles. The have challenges, including resampling, solved by an improved method using the Laplace approximation. The generalization of particle filters to Lie groups is also briefly explained.</p><p></p><hr/><hr/> <h2 id="posterP2.J" style="text-align:center;color:var(--colorlink);">Poster <em>P2.J</em></h2><h2 style="text-align:center;">How many real zeros does a random fewnomial system have?</h2><h3 class="presenter" style="text-align:center;">Josu茅 Tonelli-Cueto</h3><h4 class="institution" style="font-style: italic;text-align:center;">(Johns Hopkins University)</h4><p>Consider a polynomial system $f_1(x)=0,\ldots,f_n(x)=0$ of $n$ real polynomials in $n$ variables, where each $f_k$ has a prescribed set $A_k\subseteq \mathbb{Z}^n$ of exponent vectors of size $t_k$. In this poster, we will present a probabilistic version of Kushnirenko's conjecture. We will show that if the coefficients are independent Gaussians of any variance, then the expected number of positive zeros of the random system is bounded from above by $4^{-n} \prod_{k=1}^n t_k(t_k-1)$.</p><p>Joint work with Alperen A. Erg眉r and Mat茅 L. Telek.</p><div class="row"><div class="col-md-3"></div><div class="col-md-6"><a class="btn btn-colorinv" href="https://arxiv.org/abs/2306.06784" style="width:100%;">arXiv:2306.06784</a></div><div class="col-md-3"></div></div><hr/><hr/>  <hr/> <div class="row breakfooter"><div class="col-md-12"><a class="btn btn-colora" href="horario_en.html" style="width:100%;">Return to Congress Schedule</a></div></div> <hr class="breakfooter"/> <div class="row"><div class="col-md-12"><a class="btn btn-colora" href="programa_en.html" style="width:100%;">Return to Congress Program</a></div></div> <hr/> </div> <footer style="margin-top:1em;padding-top:1em;padding-bottom:1em;"> <div class="row" style="margin:0;padding:0;"> <div class="col-lg-10"> <p id="finalpar" style="margin-bottom:0;padding-bottom:0;">© UPV/EHU & RSME<br class="breakfooter"/> (unless otherwise indicated)</p> <p id="finalpar2" style="margin-bottom:0;padding-bottom:0;">Header Image: <br class="breakfooter"/>Picture by <a href="https://tonellicueto.xyz/">Josu茅 Tonelli-Cueto</a> <br class="breakfooter"/>at <a href="https://sites.google.com/site/biostit/cursos-y-seminarios/jornada-de-estadistica">Jornada <br class="breakfooter"/><em>Investigaci贸n en Estad铆stica<br class="breakfooter"/> vs.<br class="breakfooter"/> Estad铆stica en Investigaci贸n</em></a></p> </div> <div class="col-lg-2"><p id="finalsentence2" style="font-style:italic;"><a href="webcredits.html" >Web Credits</a></p> </div> </div> </footer>    <script src="https://code.jquery.com/jquery-3.1.1.slim.min.js" integrity="sha384-A7FZj7v+d/sdmMqp/nOQwliLvUsJfDHW+k9Omg/a/EheAdgtzNs3hpfag6Ed950n" crossorigin="anonymous"></script> <script>window.jQuery || document.write('<script src="../../assets/js/vendor/jquery.min.js"><\/script>')</script> <script src="https://cdnjs.cloudflare.com/ajax/libs/tether/1.4.0/js/tether.min.js" integrity="sha384-DztdAPBWPRXSA/3eYEEUWrWCy7G5KFbe8fFjk5JAIxUYHKkDx6Qin1DkWx51bBrb" crossorigin="anonymous"></script> <script src="js/bootstrap.min.js"></script>  <script src="js/ie10-viewport-bug-workaround.js"></script>  <script type="text/javascript">  </script>  <script type="text/x-mathjax-config"> MathJax.Hub.Config({ tex2jax: { inlineMath: [ ['$','$'], ["\$","\$"] ], processEscapes: true } }); </script> <script type="text/javascript" src='https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/MathJax.js?config=TeX-MML-AM_CHTML' async></script> </body> </html>