f-Vectors Implying Vertex Decomposability

We prove that if a pure simplicial complex $\Delta $ of dimension $d$ with $n$ facets has the least possible number of $(d-1)$ -dimensional faces among all complexes with $n$ faces of dimension $d$ , then it is vertex decomposable. This answers a question of J. Herzog and T. Hibi. In fact, we prove a generalization of their theorem using combinatorial methods.     

Spectrum of weighted composition operators. Part II: weighted composition operators on subspaces of Banach lattices

We describe the spectrum of weighted $d$ -isomorphisms of Banach lattices restricted on closed subspaces that are “rich” enough to preserve some “memory” of the order structure of the original lattice. The examples include (but are not limited to) weighted isometries of Hardy spaces on the polydisk and unit ball in $\mathbb C ^n$ .     

Functional limit theorems for random regular graphs

Consider $d$ uniformly random permutation matrices on $n$ labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree $2d$ on $n$ vertices. We consider limit theorems for various combinatorial and analytical properties of this graph (or the matrix) as $n$ grows to infinity, either when $d$ is kept fixed or grows slowly with $n$ . In a suitable weak convergence framework, we prove that the (finite but growing in length) sequences of the number of short cycles and of cyclically non-backtracking walks converge to distributional limits. We estimate the total variation distance from the limit using Stein’s method. As an application of these results we derive limits of linear functionals of the eigenvalues of the adjacency matrix. A key step in this latter derivation is an extension of the Kahn–Szemerédi argument for estimating the second largest eigenvalue for all values of $d$ and $n$ .     

Open Gromov–Witten invariants in dimension six

Let $L$ be a closed orientable Lagrangian submanifold of a closed symplectic six-manifold $(X , \omega )$ . We assume that the first homology group $H_1 (L ; A)$ with coefficients in a commutative ring $A$ injects into the group $H_1 (X ; A)$ and that $X$ contains no Maslov zero pseudo-holomorphic disc with boundary on $L$ . Then, we prove that for every generic choice of a tame almost-complex structure $J$ on $X$ , every relative homology class $d \in H_2 (X , L ; \mathbb{Z })$ and adequate number of incidence conditions in $L$ or $X$ , the weighted number of $J$ -holomorphic discs with boundary on $L$ , homologous to $d$ , and either irreducible or reducible disconnected, which satisfy the conditions, does not depend on the generic choice of $J$ , provided that at least one incidence condition lies in $L$ . These numbers thus define open Gromov–Witten invariants in dimension six, taking values in the ring $A$ .     

Explicit Constructions of Centrally Symmetric k-Neighborly Polytopes and Large Strictly Antipodal Sets

We present explicit constructions of centrally symmetric $2$ -neighborly $d$ -dimensional polytopes with about $3^{d/2}\approx (1.73)^d$ vertices and of centrally symmetric $k$ -neighborly $d$ -polytopes with about $2^{{3d}/{20k^2 2^k}}$ vertices. Using this result, we construct for a fixed $k\ge 2$ and arbitrarily large $d$ and $N$ , a centrally symmetric $d$ -polytope with $N$ vertices that has at least $\left( 1-k^2\cdot (\gamma _k)^d\right) \genfrac(){0.0pt}{}{N}{k}$ faces of dimension $k-1$ , where $\gamma _2=1/\sqrt{3}\approx 0.58$ and $\gamma _k = 2^{-3/{20k^2 2^k}}$ for $k\ge 3$ . Another application is a construction of a set of $3^{\lfloor d/2 -1\rfloor }-1$ points in $\mathbb R ^d$ every two of which are strictly antipodal as well as a construction of an $n$ -point set (for an arbitrarily large $n$ ) in $\mathbb R ^d$ with many pairs of strictly antipodal points. The two latter results significantly improve the previous bounds by Talata, and Makai and Martini, respectively.     

Weighted Function Spaces and Dunkl Transform

We introduce first weighted function spaces on ${\mathbb{R}^d}$ using the Dunkl convolution that we call Besov-Dunkl spaces. We provide characterizations of these spaces by decomposition of functions. Next we obtain in the real line and in radial case on ${\mathbb{R}^d}$ weighted L ^p -estimates of the Dunkl transform of a function in terms of an integral modulus of continuity which gives a quantitative form of the Riemann-Lebesgue lemma. Finally, we show in both cases that the Dunkl transform of a function is in L ¹ when this function belongs to a suitable Besov-Dunkl space.     

Integrability of higher pentagram maps

We define higher pentagram maps on polygons in $\mathbb{P }^d$ for any dimension $d$ , which extend R. Schwartz’s definition of the 2D pentagram map. We prove their integrability by presenting Lax representations with a spectral parameter for scale invariant maps. The corresponding continuous limit of the pentagram map in dimension $d$ is shown to be the $(2,d+1)$ -equation of the KdV hierarchy, generalizing the Boussinesq equation in 2D. We also study in detail the 3D case, where we prove integrability for both closed and twisted polygons and describe the spectral curve, first integrals, the corresponding tori and the motion along them, as well as an invariant symplectic structure.     

On High-Dimensional Acyclic Tournaments

We study a high-dimensional analog for the notion of an acyclic (aka transitive) tournament. We give upper and lower bounds on the number of $d$ -dimensional $n$ -vertex acyclic tournaments. In addition, we prove that every $n$ -vertex $d$ -dimensional tournament contains an acyclic subtournament of $\Omega (\log ^{1/d}n)$ vertices and the bound is tight. This statement for tournaments (i.e., the case $d=1$ ) is a well-known fact. We indicate a connection between acyclic high-dimensional tournaments and Ramsey numbers of hypergraphs. We investigate as well the inter-relations among various other notions of acyclicity in high-dimensional tournaments. These include combinatorial, geometric and topological concepts.     

Pitt’s Inequality and Logarithmic Uncertainty Principle for the Dunkl Transform on {\mathbb{R}}

We establish Pitt’s inequality and deduce Beckner’s logarithmic uncertainty principle for the Dunkl transform on \({\mathbb{R}}\) . Also, we prove Stein–Weiss inequality for the Dunkl–Bessel potentials.     

Lattice-free sets,multi-branch split disjunctions,and mixed-integer programming

In this paper we study the relationship between valid inequalities for mixed-integer sets, lattice-free sets associated with these inequalities and the multi-branch split cuts introduced by Li and Richard (Discret Optim 5:724–734, 2008). By analyzing $n$ -dimensional lattice-free sets, we prove that for every integer $n$ there exists a positive integer $t$ such that every facet-defining inequality of the convex hull of a mixed-integer polyhedral set with $n$ integer variables is a $t$ -branch split cut. We use this result to give a finite cutting-plane algorithm to solve mixed-integer programs. We also show that the minimum value $t$ , for which all facets of polyhedral mixed-integer sets with $n$ integer variables can be generated as $t$ -branch split cuts, grows exponentially with $n$ . In particular, when $n=3$ , we observe that not all facet-defining inequalities are 6-branch split cuts.     

Moment Functions and Central Limit Theorem for Jacobi Hypergroups on [0,\infty [

In this paper, we derive sharp estimates and asymptotic results for moment functions on Jacobi type hypergroups. Moreover, we use these estimates to prove a central limit theorem (CLT) for random walks on Jacobi hypergroups with growing parameters $\alpha ,\beta \rightarrow \infty $ . As a special case, we obtain a CLT for random walks on the hyperbolic spaces ${H}_d(\mathbb F )$ with growing dimensions $d$ over the fields $\mathbb F =\mathbb R ,\ \mathbb C $ or the quaternions $\mathbb H $ .     

New inequalities for q-ary constant-weight codes

Using double counting, we prove Delsarte inequalities for \(q\) -ary codes and their improvements. Applying the same technique to \(q\) -ary constant-weight codes, we obtain new inequalities for \(q\) -ary constant-weight codes.     

Weighted Hardy inequality with higher dimensional singularity on the boundary

Let \(\Omega \) be a smooth bounded domain in \(\mathbb R ^N\) with \(N\ge 3\) and let \(\Sigma _k\) be a closed smooth submanifold of \(\partial \Omega \) of dimension \(1\le k\le N-2\) . In this paper we study the weighted Hardy inequality with weight function singular on \(\Sigma _k\) . In particular we provide necessary and sufficient conditions for existence of minimizers.     

A gaussian estimate for the heat kernel on differential forms and application to the Riesz transform

Let $(M,g)$ be a complete Riemannian manifold which satisfies a Sobolev inequality of dimension $n$ , and on which the volume growth is comparable to the one of ${\mathbb{R }}^n$ for big balls; if there is no non-zero $L^2$ harmonic 1-form, and the Ricci tensor is in $L^{\frac{n}{2}-\varepsilon }\cap L^\infty $ for an $\varepsilon >0$ , then we prove a Gaussian estimate on the heat kernel of the Hodge Laplacian acting on 1-forms. This allows us to prove that, under the same hypotheses, the Riesz transform $d\varDelta ^{-1/2}$ is bounded on $L^p$ for all $1<p<\infty $ . Then, in presence of non-zero $L^2$ harmonic 1-forms, we prove that the Riesz transform is still bounded on $L^p$ for all $1<p<n$ , when $n>3$ .     

Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension

For a polyhedron $P$ P let $B(P)$ B ( P ) denote the polytopal complex that is formed by all bounded faces of $P$ P . If $P$ P is the intersection of $n$ n halfspaces in $\mathbb R ^D$ R D , but the maximum dimension $d$ d of any face in $B(P)$ B ( P ) is much smaller, we show that the combinatorial complexity of $P$ P cannot be too high; in particular, that it is independent of $D$ D . We show that the number of vertices of $P$ P is $O(n^d)$ O ( n d ) and the total number of bounded faces of the polyhedron is $O(n^{d^2})$ O ( n d 2 ) . For inputs in general position the number of bounded faces is $O(n^d)$ O ( n d ) . We show that for certain specific values of $d$ d and $D$ D , our bounds are tight. For any fixed $d$ d , we show how to compute the set of all vertices, how to determine the maximum dimension of a bounded face of the polyhedron, and how to compute the set of bounded faces in polynomial time, by solving a number of linear programs that is polynomial in  $n$ n .     

On the W^{2,1+\varepsilon }-estimates for the Monge-Ampère equation and related real analysis

We build upon the techniques introduced by De Philippis and Figalli regarding $W^{2,1+\varepsilon }$ bounds for the Monge-Ampère operator, to improve the recent $A_\infty $ estimates for $\Vert D^2 \varphi \Vert $ to $A_2$ ones. Also, we prove a $(1,2)-$ Poincaré inequality and weak $(q,p)-$ Poincaré inequalities associated to the Monge-Ampère quasi-metric structure. In turn, these Poincaré inequalities are used to prove Harnack’s inequality for non-negative solutions to the linearized Monge-Ampère under minimal geometric assumptions.     

Characterization of Function Spaces for the Dunkl Type Operator on the Real Line

In this work we consider the Dunkl operator on the real line, defined by $$ {\cal D}_kf(x):=f'(x)+k\dfrac{f(x)-f(-x)}{x},\,\,k\geq0. $$ We define and study Dunkl–Sobolev spaces \(L^p_{n,k}(\mathbb{R})\) , Dunkl–Sobolev spaces \({\cal L}^p_{\alpha,k}(\mathbb{R})\) of positive fractional order and generalized Dunkl–Lipschitz spaces \(\wedge^k_{\alpha,p,q}(\mathbb{R})\) . We provide characterizations of these spaces and we give some connection between them.     

A sharp Blaschke–Santaló inequality for \alpha -concave functions

We define a new transform on \(\alpha \) -concave functions, which we call the \(\sharp \) -transform. Using this new transform, we prove a sharp Blaschke–Santaló inequality for \(\alpha \) -concave functions, and characterize the equality case. This extends the known functional Blaschke–Santaló inequality of Artstein-Avidan, Klartag and Milman, and strengthens a result of Bobkov. Finally, we prove that the \(\sharp \) -transform is a duality transform when restricted to its image. However, this transform is neither surjective nor injective on the entire class of \(\alpha \) -concave functions.     

\mathcal {A}_{p, {\mathbb {E}}} Weights,Maximal Operators,and Hardy Spaces Associated with a Family of General Sets

Suppose that \({\mathbb {E}}:=\{E_r(x)\}_{r\in {\mathcal {I}}, x\in X}\) is a family of open subsets of a topological space \(X\) endowed with a nonnegative Borel measure \(\mu \) satisfying certain basic conditions. We establish an \(\mathcal {A}_{{\mathbb {E}}, p}\) weights theory with respect to \({\mathbb {E}}\) and get the characterization of weighted weak type (1,1) and strong type \((p,p)\) , \(1<p\le \infty \) , for the maximal operator \({\mathcal {M}}_{{\mathbb {E}}}\) associated with \({\mathbb {E}}\) . As applications, we introduce the weighted atomic Hardy space \(H^1_{{\mathbb {E}}, w}\) and its dual \(BMO_{{\mathbb {E}},w}\) , and give a maximal function characterization of \(H^1_{{\mathbb {E}},w}\) . Our results generalize several well-known results.     

A mean field model for a class of garbage collection algorithms in flash-based solid state drives

Garbage collection (GC) algorithms play a key role in reducing the write amplification in flash-based solid state drives, where the write amplification affects the lifespan and speed of the drive. This paper introduces a mean field model to assess the write amplification and the distribution of the number of valid pages per block for a class $\mathcal {C}$ of GC algorithms. Apart from the Random GC algorithm, class $\mathcal {C}$ includes two novel GC algorithms: the $d$ -Choices GC algorithm, that selects $d$ blocks uniformly at random and erases the block containing the least number of valid pages among the $d$ selected blocks, and the Random++ GC algorithm, that repeatedly selects another block uniformly at random until it finds a block with a lower than average number of valid blocks. Using simulation experiments, we show that the proposed mean field model is highly accurate in predicting the write amplification (for drives with $N=50{,}000$ blocks). We further show that the $d$ -Choices GC algorithm has a write amplification close to that of the Greedy GC algorithm even for small $d$ values, e.g., $d = 10$ , and offers a more attractive trade-off between its simplicity and its performance than the Windowed GC algorithm introduced and analyzed in earlier studies. The Random++ algorithm is shown to be less effective as it is even inferior to the FIFO algorithm when the number of pages $b$ per block is large (e.g., for $b \ge 64$ ).