Related papers: Induced and non-induced forbidden subposet problem…

Let $Q_n$ be the poset that consists of all subsets of a fixed $n$-element set, ordered by set inclusion. The poset cube Ramsey number $R(Q_n,Q_n)$ is defined as the least $m$ such that any 2-coloring of the elements of $Q_m$ admits a…

The Boolean lattice of dimension two, also known as the diamond, consists of four distinct elements with the following property: $A\subset B,C\subset D$. A diamond-free family in the $n$-dimensional Boolean lattice is a subposet such that…

Let $K$ be a convex body in $\mathbb{R}^n$, let $L$ be a lattice with covolume one, and let $\eta>0$. We say that $K$ and $L$ form an $\eta$-smooth cover if each point $x \in \mathbb{R}^n$ is covered by $(1 \pm \eta) vol(K)$ translates of…

We present a modification of the Depth first search algorithm, suited for finding long induced paths. We use it to give simple proofs of the following results. We show that the induced size-Ramsey number of paths satisfies…

We show that any subset of $\mathbb{Z}_p^n$ ($p$ an odd prime) without $3$-term arithmetic progression has size $O(p^{cn})$, where $c:=1-\frac{1}{18\log p}<1$. In particular, we find an upper bound of $O(2.84^n)$ on the maximum size of an…

We use spectral analysis to give an asymptotic formula for the number of matrices in SL(n, Z) of height at most T with strong error terms, far beyond the previous known, both for small and large rank.

The present paper is devoted to the well-posedness issue for a low-Mach number limit system with heat conduction but no viscosity. We will work in the framework of general Besov spaces $B^s_{p,r}(\R^d)$, $d\geq 2$, which can be embedded…

We continue the investigation of polynomial-time sparsification for NP-complete Boolean Constraint Satisfaction Problems (CSPs). The goal in sparsification is to reduce the number of constraints in a problem instance without changing the…

Many problems in computer vision and recommender systems involve low-rank matrices. In this work, we study the problem of finding the maximum entry of a stochastic low-rank matrix from sequential observations. At each step, a learning agent…

Let $n$ and $k$ be integers. A set $A\subset\mathbb{Z}/n\mathbb{Z}$ is $k$-free if for all $x$ in $A$, $kx\notin A$. We determine the maximal cardinality of such a set when $k$ and $n$ are coprime. We also study several particular cases and…

We investigate numerically the zero-temperature physics of the one-dimensional Bose-Hubbard model in an incommensurate cosine potential, recently realized in experiments with cold bosons in optical superlattices L. Fallani et al., Phys.…

Let A be a pre-defined set of rational numbers. We say a set of natural numbers S is an A-quotient-free set if no ratio of two elements in S belongs to A. We find the maximal asymptotic density and the maximal upper asymptotic density of…

We are concerned here with unrestricted maximum likelihood estimation in a sparse $p_0$ model with covariates for directed networks. The model has a density parameter $\nu$, a $2n$-dimensional node parameter $\bs{\eta}$ and a fixed…

In this paper, the following problem in the hyperbolic space $\mathbb{B}^N$ will be considered \begin{equation*} -\Delta_{\mathbb{B}^N} u=f(x,u), \mathrm{in} \ \mathbb{B}^N.\eqno{(1)} \end{equation*} where, $\Delta_{\mathbb{B}^N}$ denotes…

A subset $A$ of the integers is a $B_k[g]$ set if the number of multisets from $A$ that sum to any fixed integer is at most $g$. Let $F_{k,g}(n)$ denote the maximum size of a $B_k[g]$ set in $\{1,\dots, n\}$. In this paper we improve the…

We study the behavior of $p$-Dirichlet optimal design problem with volume constraint for $p$ large. As the limit as $p$ goes to infinity, we find a limiting free boundary problem governed by the infinity-Laplacian operator. We establish a…

We continue our study on the logarithmic balanced model metric initiated in our previous work. By a non-trivial refinement of the set of tools developed in our previous work, we are able to confirm partially a conjecture we made in our…

Given finite configurations $P_1, \dots, P_n \subset \mathbb{R}^d$, let us denote by $\mathbf{m}_{\mathbb{R}^d}(P_1, \dots, P_n)$ the maximum density a set $A \subseteq \mathbb{R}^d$ can have without containing congruent copies of any…

The induced $q$-color size-Ramsey number $\hat{r}_{\text{ind}}(H;q)$ of a graph $H$ is the minimal number of edges a host graph $G$ can have so that every $q$-edge-coloring of $G$ contains a monochromatic copy of $H$ which is an induced…

We explore the effect of disorder on a few-boson system in a finite one-dimensional quasiperiodic potential covering the full interaction ranging from uncorrelated to strongly correlated particles. We apply numerically exact…