Related papers: Forcing for hL and hd
Many fundamental problems in extremal combinatorics are equivalent to proving certain polynomial inequalities in graph homomorphism densities. In 2011, a breakthrough result by Hatami and Norine showed that it is undecidable to verify…
The Johnson-Lindenstrauss (JL) lemma allows subsets of a high-dimensional space to be embedded into a lower-dimensional space while approximately preserving all pairwise Euclidean distances. This important result has inspired an extensive…
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…
This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity for solving it. A novel and easy reformulation as a lottery…
We show new upper bounds for permanents and hafnians, which are particularly useful for complex matrices. Multidimensional permanents and hyperhafnians are considered as well. The permanental bounds improve on a Hadamard type inequality of…
In this paper, we obtain a sharp upper bound for the sum of the first $k$-th eigenvalues for this Dirichlet problem of poly-Laplacian with any order, which is viewed as an extension of the result due to Cheng and Wei (Journal of…
Given a graph $H$, a balanced subdivision of $H$ is obtained by replacing all edges of $H$ with internally disjoint paths of the same length. In this paper, we prove that for any graph $H$, a linear-in-$e(H)$ bound on average degree…
We investigate the optimality problem associated with the best constants in a class of Bohnenblust--Hille type inequalities for $m$--linear forms. While germinal estimates indicated an exponential growth, in this work we provide strong…
It is pointed out that the higher-order symmetries of the Camassa-Holm (CH) equation are nonlocal and nonlocality poses problems to obtain higher-order conserved densities for this integrable equation (J. Phys. A: Math. Gen. 2005, {\bf 38}…
A general structure theorem on higher order invariants is proven. For an arithmetic group, the structure of the corresponding Hecke module is determined. It is shown that the module does not contain any irreducible submodule. This explains…
Verification is a key bottleneck in improving inference speed while maintaining distribution fidelity in Speculative Decoding. Recent work has shown that sequence-level verification leads to a higher number of accepted tokens compared to…
For an indeterminate Hamburger moment problem we consider an infinite family of analytic densities solving the moment problem and we prove that they all have finite (Shannon) entropy. These densities are either all bounded or all unbounded.…
In this article, we design and analyze a Hybrid High-Order (HHO) finite element approximation for a class of strongly nonlinear boundary value problems. We consider an HHO discretization for a suitable linearized problem and show its…
In this paper we use a homological approach to obtain upper bounds for a few homological invariants of $FI_G$-modules $V$. These upper bounds are expressed in terms of the generating degree and torsion degree, which measure the top and…
The aim of this paper is to study the dominant dimension of two important classes of finite dimensional algebras, namely, hereditary algebras and tree algebras. We derive an explicit formula for the dominant dimension of each class.
Non-holonomic constraints, both in the Lagragian and Hamiltonian formalism, are discussed from the geometrical viewpoint of implicit differential equations. A precise statement of both problems is presented remarking the similarities and…
We survey recent results related to the concentration of eigenfunctions. We also prove some new results concerning ball-concentration, as well as showing that eigenfunctions saturating lower bounds for $L^1$-norms must also, in a measure…
Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the…
We derive a lower bound for the Wehrl entropy in the setting of SU(1,1). For asymptotically high values of the quantum number k, this bound coincides with the analogue of the Lieb-Wehrl conjecture for SU(1,1) coherent states. The bound on…
A number of non-standard finite element methods have been proposed in recent years, each of which derives from a specific class of PDE-constrained norm minimization problems. The most notable examples are $\mathcal{L}\mathcal{L}^*$ methods.…