Martin Tassy

Although modern blockchains almost universally produce blocks at fixed intervals, existing models still lack an analytical formula for the loss-versus-rebalancing (LVR) incurred by Automated Market Makers (AMMs) liquidity providers in this…

The motivation for this article is to derive strict convexity of the surface tension for Lipschitz random surfaces, that is, for models of random Lipschitz functions from $\mathbb Z^d$ to $\mathbb Z$ or $\mathbb R$. An essential innovation…

Graph homomorphisms from the $\mathbb{Z}^d$ lattice to $\mathbb{Z}$ are functions on $\mathbb{Z}^d$ whose gradients equal one in absolute value. These functions are the height functions corresponding to proper $3$-colorings of…

Using an alternative notion of entropy introduced by Datta, the max-entropy, we present a new simplified framework to study the minimizers of the specific free energy for random fields which are weakly dependent in the sense of Lewis,…

We prove and generalize a conjecture in arXiv:1610.0474(4) about the asymptotics of $\frac{1}{\sqrt{n!}} f^{\lambda/\mu}$, where $f^{\lambda/\mu}$ is the number of standard Young tableaux of skew shape $\lambda/\mu$ which have stable limit…

We consider homogenization of random surfaces and study the variational principle for graph homomorphisms from subsets of $\mathbb{Z}^m$ into $\mathbb{Z}$, where the underlying uniform measure is perturbed by a random field. Motivated by…

We develop a new robust technique to deduce variance principles for non-integrable discrete systems. To illustrate this technique, we show the existence of a variational principle for graph homomorphisms from $\Z^m$ to a $d$-regular tree.…

We study the well-known variational and large deviation principle for graph homomorphisms from $\mathbb{Z}^m$ to $\mathbb{Z}$. We provide a robust method to deduce those principles under minimal a priori assumptions. The only ingredient…

The classical Kirszbraun theorem says that all $1$-Lipschitz functions $f:A\longrightarrow \mathbb{R}^n$, $A\subset \mathbb{R}^n$, with the Euclidean metric have a $1$-Lipschitz extension to $\mathbb{R}^n$. For metric spaces $X,Y$ we say…

Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston's height function approach to a nearly…

We look at sets of tiles that can tile any region of size greater than 1 on the square grid. This is not the typical tiling question, but relates closely to it and therefore can help solve other tiling problems -- we give an example of…

We study the critical parameter u^{*} of random interlacements percolation (introduced by A.S Sznitman in arXiv:0704.2560) on a Galton-Watson tree conditioned on the non-extinction event. Starting from the previous work of A. Teixeira in…