1,408+ open-access research outputs.
Heffter arrays are combinatorial structures used to construct orthogonal cyclic cycle decompositions and biembeddings of complete graphs onto surfaces. A Heffter array $H(m,n;h,k)$ is an $m \times n$ …
In 1972, Fredman proposes the problem of sorting under partial information: preprocess a directed acyclic graph $G$ with vertex set $X$ so that you can sort $X$ in $O(\log e(G))$ time, where $e(G)$ is…
Speech recognition systems often struggle with data domains that have not been included in the training. To address this, unsupervised domain adaptation has been explored with ensemble and multi-stage…
Let $f:\mathbb C\to \widehat{\mathbb C}=\mathbb C \cup\{\infty\}$ be a transcendental meromorphic function (possibly without any pole) with a single essential singularity, and that is chosen to be at …
We show that for every positive integer ${t \geq 2}$ there exists an integer $s$ such that every graph that contains no induced subgraph isomorphic to either the $6$-vertex path or the $(2,t)$-bicliqu…
This paper is the second part of our study on the non-parametric estimation of MS-NAR processes started with [L. Fermin et al. 2017]. We consider the Nadaraya-Watson type regression function estimator…
In his classical work, W. Blaschke proved that a convex body whose shadow boundaries are flat for every direction of parallel illumination must be an ellipsoid. An extension recently proposed by I. Go…
We study parabolic implosion in a general non-autonomous setting. Let $f(w)=w+w^2+O(w^3)$ be a holomorphic germ tangent to the identity. We consider the iteration of non-autonomous perturbations of th…
One approach to studying the dynamics of a singular Lagrangian system is to attempt to regularize it, that is, to find an equivalent and regular system. In the case of time-independent singular Lagran…
We show: 1) The existence of the first twisted Hilbert space that is not isomorphic to its dual; this solves a problem posed by Cabello in [Nonlinear centralizers in homology, Math. Ann. 358 (2014), n…
The low-excitation states of atomic nuclei in the region around the $N = Z = 28$ shell closure are generally well described by the shell model. Most experimental observables in the iron isotopes $^{56…
Bin Packing with $k$ bins is a fundamental optimisation problem in which we are given a set of $n$ integers and a capacity $T$ and the goal is to partition the set into $k$ subsets, each of total sum …
We extend the theory of ambidexterity developed by M.J. Hopkins and J. Lurie by proving commutativity of the norm square induced from a weakly ambidextrous morphism by two Beck-Chevalley fibrations th…
We reduce the $K(\pi,1)$-conjecture for all Artin groups with tree Coxeter diagrams to properties of Artin groups with tripod-shaped Coxeter diagrams. Combining this reduction theorem and properties o…
Since 2004, the Keck Observatory Archive (KOA) has operated as a NASA-funded collaboration between the NASA Exoplanet Science Institute ( NExScI) and the W.M. Keck Observatory. It ingests and serves a…
This paper establishes a novel combinatorial framework at the intersection of Lie theory and algebraic combinatorics, based on a generalization of the Kostant game. We begin by reviewing the foundatio…
We establish Flat Torus Theorem type results for groups acting on small cancellation complexes satisfying C(6), C(4)-T(4) and C(3)-T(6) conditions. For C(3)-T(6) complexes the result closely parallels…
With the development of teleconferencing and in-vehicle voice assistants, far-field multi-speaker speech recognition has become a hot research topic. Recently, a multi-channel transformer (MCT) has be…
We prove that for every fixed integer $s$ and every planar graph $H$, the class of $H$-induced-minor-free and $K_{1,s}$-induced-subgraph-free graphs has polylogarithmic tree-independence number. This …
In 1983, A. Bouchet extended W.T. Tutte's notion of nowhere-zero flows to signed graphs, and conjectured that every flow-admissible signed graph has a nowhere-zero 6-flow. In this paper we prove that …
Free open-access publishing with Google Scholar indexing.
Submission Guide →