Related papers: Reset thresholds of transformation monoids
In this paper, we provide an upper bound for the number of one-element commutation classes of a permutation, that is, the number of reduced words in which no commutation can be applied. Using this upper bound, we prove a conjecture that…
We give an abstract argument that an a priori Fourier restriction estimate for a certain choice of exponents automatically implies maximal and variational Fourier restriction estimates. These, in turn, provide pointwise and quantitative…
We consider the problem of minimal correction of the training set to make it consistent with monotonic constraints. This problem arises during analysis of data sets via techniques that require monotone data. We show that this problem is…
We study the perfectoid pure threshold with respect to $p$, an invariant of singularities in mixed characteristic $(0,p)$ arising from perfectoid purity. In this paper, we compute perfectoid pure thresholds for lifts of rational double…
We reformulate the monodromy relations of open-string scattering amplitudes as boundary terms of twisted homologies on the configuration spaces of Riemann surfaces of arbitrary genus. This allows us to write explicit linear relations…
We show that for any monoid M, the family of languages accepted by M-automata (or equivalently, generated by regular valence grammars over M) is completely determined by that part of M which lies outside the maximal ideal. Hence, every such…
We provide a complete set of supersymmetric constraints for the anomalous dimensions of the conformal twist-two operators to all orders of perturbation theory. Employing them we derive new relations between the exclusive evolution kernels…
In this paper, we obtain under the assumption of the Generalized Riemann Hypothesis upper bounds for all high integral moments of sums of Fourier coefficients of a given modular form twisted by quadratic Dirichlet characters. We show the…
We study the effects of threshold resummation on the rapidity dependence of single-particle-inclusive cross sections, using the prompt photon cross section as an example. We make use of the full resummation formula at next-to-leading…
We prove a reformulation of the multiplicity upper bound conjecture and use that reformulation to prove it for three-dimensional simplicial complexes and homology manifolds with many vertices. We provide necessary conditions for a…
A rewriting system is a set of equations over a given set of terms called rules that characterize a system of computation and is a powerful general method for providing decision procedures of equational theories, based upon the principle of…
Consider $ A^* $, the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the symbols of the other. The commutative closure of a set $ L…
We prove the macroscopic cousins of three conjectures: 1) a conjectural bound of the simplicial volume of a Riemannian manifold in the presence of a lower scalar curvature bound, 2) the conjecture that rationally essential manifolds do not…
Relaxation and rounding approaches became a standard and extremely versatile tool for constrained submodular function maximization. One of the most common rounding techniques in this context are contention resolution schemes. Such schemes…
We study matrix forms of quaternionic versions of the Fourier Transform and Convolution operations. Quaternions offer a powerful representation unit, however they are related to difficulties in their use that stem foremost from…
We prove a uniform generalized gaussian bound for the powers of a discrete convolution operator in one space dimension. Our bound is derived under the assumption that the Fourier transform of the coefficients of the convolution operator is…
We improve the best known upper bound on the length of the shortest reset words of synchronizing automata. The new bound is slightly better than $114 n^3 / 685 + O(n^2)$. The \v{C}ern\'y conjecture states that $(n-1)^2$ is an upper bound.…
In the setup of i.i.d.~observations and a real valued differentiable functional~$T$, locally asymptotic upper bounds are derived for the power of one-sided tests (simple, versus large values of~$T$)and for the confidence probability of…
We describe irreducible representations and character formulas of the Renner monoids for reductive monoids, which generalizes the Munn-Solomon representation theory of rook monoids to any Renner monoids. The type map and polytope associated…
Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…