Research
Research
Research
Research
1,541+ open-access research outputs.
A Berge $k$-factor in a hypergraph is a generalization of a $k$-factor in a graph. In this paper, we study the problem of determining the values $k$ such that every $\lambda$-edge-connected $r$-regula…
In recent previous work [E. Hansen, T. Stillfjord and T. \r{A}berg, SIAM J. Numer. Anal., to appear], we analyzed the convergence of operator splitting methods applied to operator-valued differential …
Given a hypergraph $F$, what is the largest chromatic number that an $F$-free hypergraph can have? In the case of graphs, this question is easy to answer: the chromatic number is unbounded if $F$ cont…
Let $X$ be a normal projective variety of dimension $d\ge 4$ and let $f$ be a zero-entropy automorphism of $X$. Denote by $k$ the degree growth rate of $f$, so that $\mathrm{deg}_1(f^n) \asymp n^{k}$.…
Let $\mathcal{H}$ be a hypergraph and $F$ be a graph. If there exists a bijection between the hyperedges of $\mathcal{H}$ and the edges of $F$ such that each hyperedge contains its image, then we sa…
I was interested in the work of Solomon Marcus in Mathematical Linguistics as a high-school student. Later, I had the opportunity to discuss with him about many topics. He was a polymath. We wrote a p…
Given a graph $F$, a Berge copy of $F$ (Berge-$F$ for short) is a hypergraph obtained by enlarging the edges arbitrarily. Gy\H{o}ri, Salia and Zamora determined the maximum number of hyperedges in a c…
We prove a law of large numbers and a functional central limit theorem for the empirical density of a Marcus-Lushnikov model. The limiting density turns out to be the solution of a Smoluchowski equati…
Let $D$ be a digraph. A collection of disjoint sets of vertices (respec., collection of disjoint subdigraphs) $\mathcal{H}$ of $D$ and a vertex subset (or subdigraph) $Q$ of $D$ are orthogonal if ever…
This paper develops a general theory for first-order descent methods whose search directions are restricted to a prescribed dictionary in a reflexive Banach space. Instead of assuming that the linear …
This paper presents a class of structure-preserving numerical methods for quantum optimal control problems, based on commutator-free Cayley integrators. Starting from the Krotov framework, we reformul…
The $i$-dimensional Potts lattice Higgs model is a random assignment of spins in $\mathbb{Z}_q$ to the $i$-dimensional cells of a cell complex induced by a Hamiltonian with a Potts interaction on the …
We consider the (compact) abelian lattice Higgs model with charge \( k \geq 1 \) and show, using charged Wilson~loop observables and charged versions of the Marcu--Fredenhagen ratio, that this model e…
Income-based poverty indicators are insufficient to fully explain the multifaceted socio-economic issue of energy poverty. The ability of households to obtain and use energy services sustainably is si…
We generalize the sparsification algorithm of Batson, Spielman and Srivastava, making one part of the result dimension-independent. In particular, we recover discretization inequalities in $L_2$- and …
A Berge path of length $k$ in an $r$-uniform hypergraph is a collection of $k$ hyperedges $h_1,\dots,h_k$ and $k+1$ vertices $v_1,\dots,v_{k+1}$ such that $v_i, v_{i+1}\in h_i$ for each $1\le i\le k$.…
We study robust nonlinear filtering for stochastic models driven by L\'evy processes, where the signal and observation processes are coupled through common Brownian and jump noise. Robustness, defined…
We study information-theoretic phase transitions for the detectability of latent geometry in bipartite random geometric graphs RGGs with Gaussian d-dimensional latent vectors while only a subset of ed…
We study combinatorial and algebraic properties of $t$-clique-free complexes, a family of simplicial complexes associated with finite simple graphs that generalize the classical independence complex. …
We develop a real-analytic counterpart of the Bers embedding for the Fr\'echet Lie group $\Diff^{-\infty}(\R)$ of decay-controlled diffeomorphisms of the line, and establish its connection to $L^p$ Fi…
Free open-access publishing with Google Scholar indexing.
Submission Guide →