Related papers: On rearrangement inequalities for T-norm logics
The classical rearrangement inequality provides bounds for the sum of products of two sequences under permutations of terms and show that similarly ordered sequences provide the largest value whereas opposite ordered sequences provide the…
The rearrangement inequalities of Hardy-Littlewood and Riesz say that certain integrals involving products of two or three functions increase under symmetric decreasing rearrangement. It is known that these inequalities extend to integrands…
We study $L^2$-constraint minimizing problems related to elliptic systems. We introduce a new rearrangement to show $H^1$-precompactness of any minimizing sequences. Some strict inequality for the new rearrangement is obtained. It is a key…
The Rearrangement Conjecture states that if two words over $\mathbb{P}$ are Wilf-equivalent in the factor order on $\mathbb{P}^\ast$ then they are rearrangements of each other. We introduce the notion of strong Wilf-equivalence and prove…
We consider the problem of finding the set of permutations $r_j$ of $\{1,\cdots , n\}$ such that $\sum_{i=1}^n \prod_{j=1}^k r_j(i)$ is maximized or minimized. While the set of permutations maximizing this value are easily determined,…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
The uninorms with continuous underlying t-norm and t-conorm are characterized via an extended ordinal sum construction. Using the results of [18], where each uninorm with continuous underlying operations was characterized by properties of…
A logic has uniform interpolation if its formulas can be projected down to given subsignatures, preserving all logical consequences that do not mention the removed symbols; the weaker property of (Craig) interpolation allows the projected…
We study the following rearrangement problem: Given $n$ words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively). We show that this problem reduces to sorting the given words…
In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was…
The usual nonnegative modulus function is based on addition. A natural different modulus function on the set of positive reals is introduced. Arguments for results for series through the usual modulus function are transformed to arguments…
For a composition $I$ whose first part exceeds 1, we can define the multiple $t$-value $t(I)$ as the sum of all the terms in the series for the multiple zeta value $\zeta(I)$ whose denominators are odd. In this paper we show that if $I$ is…
This paper deals with the behavior of the periodic Gagliardo seminorm under two types of rearrangements, namely under a periodic, and respectively a cylindrical, symmetric decreasing rearrangement. Our two main results are P\'olya-Szeg\H{o}…
Motivated by partition regularity problems of homogeneous quadratic equations, we prove multiple recurrence and convergence results for multiplicative measure preserving actions with iterates given by rational sequences involving…
Let us consider a collection $\mathcal G$ of codewords of length $n$ over an alphabet of size $s$. Let $t_1,\ldots, t_s$ be nonnegative integers. What is the maximum of $|\mathcal G|$ subject to the condition that any two codewords should…
Talenti inequalities are a central feature in the qualitative analysis of PDE constrained optimal control as well as in calculus of variations. The classical parabolic Talenti inequality states that if we consider the parabolic equation…
We generalize a previous inequality related to a sharp version of the Littlewood conjecture on the minimal $L_1$-norm of $N$-term exponential sums $f$ on the unit circle. The new result concerns replacing the expression $\log(1+t|f|^2)$…
Majorisation, also called rearrangement inequalities, yields a type of stochastic ordering in which two or more distributions can be compared. In this paper we argue that majorisation is a good candidate as a theory for uncertainty. We…
We give new approximation algorithms for the submodular joint replenishment problem and the inventory routing problem, using an iterative rounding approach. In both problems, we are given a set of $N$ items and a discrete time horizon of…
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…