Vés al contingut (premeu Retorn)

Activitats

Congres Catala Educacio Matematica

De l'11 al 13 de juliol es farà a Barcelona el Congrés Català d'Educació Matemàtica, organitzat per la FEEMCAT.

De l'11 al 13 de juliol es farà a Barcelona el Congrés Català d'Educació Matemàtica, organitzat per la FEEMCAT.

Quan
11/06/2016 a 13/06/2016
Afegeix un esdeveniment al calendari
iCal

http://c2em.feemcat.org 

Jornada de Recerca

Hi haurà presentacions dels grups de recerca del departament. Inici 9 juny 2016 , 9:00; final 13:00 Ubicació: Sala d'actes FME

Hi haurà presentacions dels grups de recerca del departament. Inici 9 juny 2016 , 9:00; final 13:00 Ubicació: Sala d'actes FME

Quan
09/06/2016 de 09:00 a 13:00
On
Sala d'actes FME
URL de l'esdeveniment
Lloc web relacionat
Afegeix un esdeveniment al calendari
iCal

Computational geometry seminars: J. Pfeifle

The simplexity of a convex d-polytope P with n vertices is the minimum number of simplices necessary to triangulate P without using new vertices. In dimension 3 and above, bounds for the simplexity are scarce, even in such well-studied cases as the d-dimensional cube. One general method for obtaining bounds on the simplexity is doing linear optimization over the universal polytope U(P). However, since U(P) lives in (d+1)-dimensional space, these linear programs quickly become infeasible computationally. On the other hand, if P is symmetric, we can use techniques from the representation theory of finite groups to simplify the computations. In the Tuesday session, we'll give a crash course on the basics of representation theory, and apply these tools to the problem at hand on Friday.
  • Computational geometry seminars: J. Pfeifle
  • 2016-06-07T12:30:00+02:00
  • 2016-06-10T13:30:00+02:00
  • The simplexity of a convex d-polytope P with n vertices is the minimum number of simplices necessary to triangulate P without using new vertices. In dimension 3 and above, bounds for the simplexity are scarce, even in such well-studied cases as the d-dimensional cube. One general method for obtaining bounds on the simplexity is doing linear optimization over the universal polytope U(P). However, since U(P) lives in (d+1)-dimensional space, these linear programs quickly become infeasible computationally. On the other hand, if P is symmetric, we can use techniques from the representation theory of finite groups to simplify the computations. In the Tuesday session, we'll give a crash course on the basics of representation theory, and apply these tools to the problem at hand on Friday.

The simplexity of a convex d-polytope P with n vertices is the minimum number of simplices necessary to triangulate P without using new vertices. In dimension 3 and above, bounds for the simplexity are scarce, even in such well-studied cases as the d-dimensional cube. One general method for obtaining bounds on the simplexity is doing linear optimization over the universal polytope U(P). However, since U(P) lives in (d+1)-dimensional space, these linear programs quickly become infeasible computationally. On the other hand, if P is symmetric, we can use techniques from the representation theory of finite groups to simplify the computations. In the Tuesday session, we'll give a crash course on the basics of representation theory, and apply these tools to the problem at hand on Friday.

Quan
07/06/2016 12:30 a 10/06/2016 13:30
On
Room S215 Omega Building, Campus Nord UPC (equiv.: Room 215 Floor -2)
Afegeix un esdeveniment al calendari
iCal

Tuesday, June 7, 2016, 12:30-13:30 and Friday, June 10, 2016, 12:30-13:30

Discrete Mathematics Days Barcelona

Quan
06/06/2016 09:00 a 08/06/2016 12:00
URL de l'esdeveniment
Lloc web relacionat
Afegeix un esdeveniment al calendari
iCal

http://llati.upc.edu/JMDA16/

OpenRotor: Geometria para el modelado 3D

Organitzada per l'estudi Rotor. Xerrada dirigida a artistes visuals i interactius interessats en el modelat 3D. Es tracta d'introduir alguns sistemes de coordenades, les bases de la geometria de corbes i superfícies, i el software matemàtic que ens permet crear els models a partir d'equacions. Imprimirem alguns exemples.
  • OpenRotor: Geometria para el modelado 3D
  • 2016-06-02T19:00:00+02:00
  • 2016-06-02T23:59:59+02:00
  • Organitzada per l'estudi Rotor. Xerrada dirigida a artistes visuals i interactius interessats en el modelat 3D. Es tracta d'introduir alguns sistemes de coordenades, les bases de la geometria de corbes i superfícies, i el software matemàtic que ens permet crear els models a partir d'equacions. Imprimirem alguns exemples.

Organitzada per l'estudi Rotor. Xerrada dirigida a artistes visuals i interactius interessats en el modelat 3D. Es tracta d'introduir alguns sistemes de coordenades, les bases de la geometria de corbes i superfícies, i el software matemàtic que ens permet crear els models a partir d'equacions. Imprimirem alguns exemples.

Quan
02/06/2016 des de/d' 19:00"
On
Espai Erre, carrer Àvila, 124, 2-2, 08018 Barcelona
Afegeix un esdeveniment al calendari
iCal

http://www.rotor-studio.net/blog/openrotor-lali-barriere-geometria-para-el-modelado-3d/

Seminari grup ACES: Yuri B. Shtessel

Yuri B. Shtessel: Output tracking in nonminimum phase systems via sliding modes

Yuri B. Shtessel: Output tracking in nonminimum phase systems via sliding modes

Quan
02/06/2016 des de/d' 15:00"
On
IOC Seminar, ETSEIB building, 11th floor, UPC
Afegeix un esdeveniment al calendari
iCal

Title: Output tracking in nonminimum phase systems via sliding modes

Speaker: Prof. Yuri B. Shtessel, Dept. of Electrical and Computer Engineering, The University of Alabama in Huntsville, Huntsville, USA

Schedule: June 2nd, 2016, 15:00, IOC Seminar (ETSEIB building – 11th floor)

Abstract: The problem of causal output tracking and observation in non-minimum phase nonlinear systems is studied and addressed using sliding mode control techniques. The extended method of Stable System Center (ESSC) that is used for addressing the output tracking in nonminimum phase causal systems is presented. ESSC is used in two-fold manner: i) to generate bounded reference profile for unstable internal states; ii) to estimate states of unstable internal dynamics. Two applications of the proposed technique are considered for illustration purposes: output voltage tracking in a nonminimum phase DC/DC electric power converter and output tracking in SISO systems with time-delayed output feedback. A variety of traditional and higher-order sliding mode (HOSM) control and observation methods is employed in the majority of algorithms. Most of the theoretical results are covered by numerical simulations.

LIMDA Joint Seminar: Victor Diego

ALBCOM Seminar on Algorithms and Theory of Computation - COMBGRAPH Seminar on Combinatorics, Graph Theory and Applications - DCCG Seminar on Computational Geometry

ALBCOM Seminar on Algorithms and Theory of Computation - COMBGRAPH Seminar on Combinatorics, Graph Theory and Applications - DCCG Seminar on Computational Geometry

Quan
02/06/2016 des de/d' 12:00"
On
Room C3-005, Campus Nord UPC
Afegeix un esdeveniment al calendari
iCal

Speaker: Víctor Diego, Departament de Matemàtiques, UPC

Title: Distance mean-regular graphs

Abstract:

We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let G be a graph with vertex set V, diameter D, adjacency matrix A, and adjacency algebra A. Then, G is distance mean-regular when, for a given u in V, the averages of the intersection numbers p_{ij}^h(u,v)=|G_i(u)\G_j(v)| (number of vertices at distance i from u and distance j from v) computed over all vertices v at a given distance h in {0,1,ldots,D} from u, do not depend on u. In this work we study some properties and characterizations of these graphs. For instance, it is shown that a distance mean-regular graph is always distance degree-regular, and we give a condition for the converse to be also true. Some algebraic and spectral properties of distance mean-regular graphs are also investigated. We show that, for distance mean regular-graphs, the role of the distance matrices of distance-regular graphs is played for the so-called distance mean-regular matrices. These matrices are computed from a sequence of orthogonal polynomials evaluated at the adjacency matrix of G and, hence, they generate a subalgebra of A. Some other algebras associated to distance mean-regular graphs are also characterized.

CRM: AC Methods of Constructive Approximation and Harmonic Analysis

Quan
30/05/2016 12:00 a 03/06/2016 12:00
On
Centre de Recerca Matemàtica, Bellaterra,
URL de l'esdeveniment
Lloc web relacionat
Afegeix un esdeveniment al calendari
iCal

We want to remind you the upcoming Advanced Course on Methods of Constructive Approximation and Harmonic Analysis which will be held at the Centre de Recerca Matemàtica, Bellaterra,

from May 30 to June 3, 2016.
This event is part of the IRP Constructive Approximation and Harmonic Analysis. 

 Senior registration fee: 90 €
 Junior registration fee: 60 €
 Deadline for registration fee: May 7, 2016

 We want to emphasize that March 15 is the deadline for grant application with the Clay Mathematics Institute http://www.crm.cat/en/Activities/Curs_2015-2016/Pages/CMI-Grants-Constructive-approximation.aspx . These advanced courses are devoted to different topics in connection with High-dimensional approximation, Harmonic Analysis, and closed areas, such as PDE’s. The courses will focus on the problems which have attracted a lot of attention in the recent years. You can find more information in:
 http://www.crm.cat/en/Activities/Curs_2015-2016/Pages/Constructive-Approximation.aspx  
 We hope that this information is of your interest and we hope to see you soon in Barcelona,  
 Vladimir Temlyakov, University of South Carolina
 Sergey Tikhonov, Centre de Recerca Matemàtica-ICREA
 (Scientific Comittee)

Projecte de recerca d'Ivan Paz"

Col·laboració en la programació de la interfície gràfica GeMuSe per al software per a l'exploració perceptual de l'espai de paràmetres d'àudio, per a la composició algorísmica. La interfície està programada en Processing i es comunica amb l'aplicació, programada en supercollider, a través del protocol OSC.
  • Projecte de recerca d'Ivan Paz"
  • 2016-05-26T19:30:00+02:00
  • 2016-05-26T23:59:59+02:00
  • Col·laboració en la programació de la interfície gràfica GeMuSe per al software per a l'exploració perceptual de l'espai de paràmetres d'àudio, per a la composició algorísmica. La interfície està programada en Processing i es comunica amb l'aplicació, programada en supercollider, a través del protocol OSC.

Col·laboració en la programació de la interfície gràfica GeMuSe per al software per a l'exploració perceptual de l'espai de paràmetres d'àudio, per a la composició algorísmica. La interfície està programada en Processing i es comunica amb l'aplicació, programada en supercollider, a través del protocol OSC.

Quan
26/05/2016 des de/d' 19:30"
On
Hangar centre de producció en arts visuals, Emilia Coranty 16, Can Ricart, 08018 Barcelona
Afegeix un esdeveniment al calendari
iCal

https://hangar.org/en/news/presentacio-final-del-projecte-de-recerca-divan-paz-multiparameter-space-representation-as-a-perceptual-exploration-interface/

LIMDA Joint Seminar: Jack Koolen

ALBCOM Seminar on Algorithms and Theory of Computation - COMBGRAPH Seminar on Combinatorics, Graph Theory and Applications - DCCG Seminar on Computational Geometry

ALBCOM Seminar on Algorithms and Theory of Computation - COMBGRAPH Seminar on Combinatorics, Graph Theory and Applications - DCCG Seminar on Computational Geometry

Quan
26/05/2016 des de/d' 12:00"
On
Room C3-005, Campus Nord UPC
Afegeix un esdeveniment al calendari
iCal

Speaker: Jack Koolen, University of Science and Technology of China

Title: Recent progress on 2-walk-regular graphs

Abstract:

In this talk I will present some recent progress on 2-walk-regular graphs.

This is based on joint work with Zhi Qiao, Jongyook Park and Shao-Fei Du.