Recherche

Afficher tous les résultats pour

Accueil

Catégorie

Combinatoire

Science formelle
Mathématiques
Mathématiques discrètes
Combinatoire

Publications associées (25)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Seeking the new, learning from the unexpected: Computational models of surprise and novelty in the brain

Alireza Modirshanechi

Human babies have a natural desire to interact with new toys and objects, through which they learn how the world around them works, e.g., that glass shatters when dropped, but a rubber ball does not. When their predictions are proven incorrect, such as whe ...

EPFL2024

Beyond undulation! Body morphology and sensing components of elongated animals and robots reveal skills to maintain competent locomotion

Laura Isabel Paez Coy

Locomotion is an essential evolutive innovation of living beings that allows them to colonize and dominate the planet. As diverse as animal morphologies are (living) and were (extinct), their locomotion modalities are also diverse. In particular, animal mo ...

EPFL2023

From Trees to Barcodes and Back Again: A Combinatorial, Probabilistic and Geometric Study of a Topological Inverse Problem

Adélie Eliane Garin

In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view. Computing the persistent homology of a merge tree yields a barcode B. Reconstructing a tree from B invol ...

EPFL2022

Unlocking crowding by ensemble statistics

Michael Herzog, David Pascucci, Oh-Hyeon Choung, Yury Markov, Natalia Tiurina

In crowding,1-7 objects that can be easily recognized in isolation appear jumbled when surrounded by other elements.8 Traditionally, crowding is explained by local pooling mechanisms,3,6,9-15 but many findings have shown that the global configuration of th ...

2022

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Gaspard Ohlmann

In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...

ELECTRONIC JOURNAL OF COMBINATORICS2021

Haldane Gap of the Three-Box Symmetric SU(3) Chain

Frédéric Mila, Pierre Marcel Nataf, Samuel Gozel

Motivated by the recent generalization of the Haldane conjecture to SU(3) chains [Lajko et al., Nucl. Phys. B924, 508 (2017)] according to which a Haldane gap should be present for symmetric representations if the number of boxes in the Young diagram is a ...

2020

Asymptotic freedom, Haldane gap and edge states of SU(N) spin chains

Samuel Gozel

In this thesis we study various one-dimensional quantum spin systems with SU(2) and SU(N) symmetry. We investigate the short-distance behavior of the SU(2) Heisenberg model in the limit of large spin and show that there exists an extended regime where pert ...

EPFL2020

Self-conjugate representation SU(3) chains

Frédéric Mila, Francisco Hyunkyu Kim, Miklos Lajko

It was recently argued that SU(3) chains in the p-box symmetric irreducible representation (irrep) exhibit a "Haldane gap" when p is a multiple of 3 and are otherwise gapless [Nucl. Phys. B 924, 508 (2017)]. We extend this argument to the self-conjugate ir ...

2019

An algebraic least squares reduced basis method for the solution of nonaffinely parametrized Stokes equations

Alfio Quarteroni, Simone Deparis, Andrea Manzoni, Niccolò Dal Santo

In this paper we propose a new, purely algebraic, Petrov-Galerkin reduced basis (RB) method to solve the parametrized Stokes equations, where parameters serve to identify the (variable) domain geometry. Our method is obtained as an algebraic least squares ...

ELSEVIER SCIENCE SA2019

Almost tiling of the Boolean lattice with copies of a poset

Istvan Tomon

Let P be a partially ordered set. If the Boolean lattice (2[n],⊂) can be partitioned into copies of P for some positive integer n, then P must satisfy the following two trivial conditions: (1) the size of P is a power of 2, (2) P has a unique maximal and m ...

ELECTRONIC JOURNAL OF COMBINATORICS2018

Page 1 sur 3