Concept

Dedekind-infinite set

Related publications (75)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Prestressed ultra-high performance concrete (UHPC) beams for reusable structural systems: design and testing

Corentin Jean Dominique Fivet, Jan Friedrich Georg Brütting, Dario Redaelli, Alex-Manuel Muresan

With the aim to reduce the environmental footprint of buildings, this paper presents an original structural system concept for two-way slabs in residential and office buildings. The proposed system extends the best practice in terms of modularity, versatil ...

IOP2021

A proof of a sumset conjecture of Erdős

Florian Karl Richter

In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C of infinite subsets of ℕ , settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured ...

2019

A pathwise approach to the extinction of branching processes with countably many types

Sophie Myriam Hautphenne

We consider the extinction events of Galton-Watson processes with countably infinitely many types. In particular, we construct truncated and augmented Galton-Watson processes with finite but increasing sets of types. A pathwise approach is then used to sho ...

ELSEVIER SCIENCE BV2019

Dynamic Optimization of Reaction Systems via Exact Parsimonious Input Parameterization

Dominique Bonvin, Diogo Filipe Mateus Rodrigues

This paper discusses the use of parsimonious input parameterization for the dynamic optimization of reaction systems. This parameterization is able to represent the optimal inputs with only a few parameters. In the context of batch, semibatch, and continuo ...

AMER CHEMICAL SOC2019

On reducing the number of decision variables for dynamic optimization

Dominique Bonvin, Diogo Filipe Mateus Rodrigues

This paper presents an input parameterization for dynamic optimization that allows reducing the number of decision variables compared to traditional direct methods. A small number of decision variables is likely to be beneficial for various applications su ...

2019

We provide sharp conditions for the finiteness and the continuity of multimarginal optimal transport with repulsive cost, expressed in terms of a suitable concentration property of the measure. To achieve this result, we analyze the Kantorovich potentials ...

2019

Redundant Gabor frames admit an infinite number of dual frames, yet only the canonical dual Gabor system, constructed from the minimal l(2)-norm dual window, is widely used. This window function however, might lack desirable properties, e. g. good time-fre ...

ELSEVIER SCIENCE INC2018

We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties wh ...

2018

Effective multi-scale approach to the Schrödinger cocycle over a skew shift base

Marius Christopher Lemm, Rui Han

We prove a conditional theorem on the positivity of the Lyapunov exponent for a Schrödinger cocycle over a skew shift base with a cosine potential and the golden ratio as frequency. For coupling below 1, which is the threshold for Herman's subharmonicity t ...

2018

Approximating Steiner trees and forests with minimum number of Steiner points

Nachshon Cohen

Let R be a finite set of terminals in a convex metric space (M, d). We give approximation algorithms for problems of finding a minimum size set S subset of M of additional points such that the unit-disc graph G[R boolean OR S] of R boolean OR S satisfies s ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2018