Estimates in Beurling--Helson type theorems. Multidimensional case

We consider the spaces $A_p(\mathbb T^m)$ of functions $f$ on the $m$ -dimensional torus $\mathbb T^m$ such that the sequence of the Fourier coefficients $\hat{f}=\{\hat{f}(k), ~k \in \mathbb Z^m\}$ belongs to $l^p(\mathbb Z^m), ~1\leq p<2$. The norm on $A_p(\mathbb T^m)$ is defined by $\|f\|_{A_p(\mathbb T^m)}=\|\hat{f}\|_{l^p(\mathbb Z^m)}$. We study the rate of growth of the norms $\|e^{i\lambda\varphi}\|_{A_p(\mathbb T^m)}$ as $|\lambda|\rightarrow \infty, ~\lambda\in\mathbb R,$ for $C^1$ -smooth real functions $\varphi$ on $\mathbb T^m$ (the one-dimensional case was investigated by the author earlier). The lower estimates that we obtain have direct analogues for the spaces $A_p(\mathbb R^m)$

Isotropic subbundles of TM⊕T∗MTM\oplus T^*M

We define integrable, big-isotropic structures on a manifold $M$ as subbundles $E\subseteq TM\oplus T^*M$ that are isotropic with respect to the natural, neutral metric (pairing) $g$ of $TM\oplus T^*M$ and are closed by Courant brackets (this also implies that $[E,E^{\perp_g}]\subseteq E^{\perp_g}$). We give the interpretation of such a structure by objects of $M$, we discuss the local geometry of the structure and we give a reduction theorem.Comment: LaTex, 37 pages, minimization of the defining condition

Ideal Tightly Couple (t,m,n) Secret Sharing

As a fundamental cryptographic tool, (t,n)-threshold secret sharing ((t,n)-SS) divides a secret among n shareholders and requires at least t, (t<=n), of them to reconstruct the secret. Ideal (t,n)-SSs are most desirable in security and efficiency among basic (t,n)-SSs. However, an adversary, even without any valid share, may mount Illegal Participant (IP) attack or t/2-Private Channel Cracking (t/2-PCC) attack to obtain the secret in most (t,n)-SSs.To secure ideal (t,n)-SSs against the 2 attacks, 1) the paper introduces the notion of Ideal Tightly cOupled (t,m,n) Secret Sharing (or (t,m,n)-ITOSS ) to thwart IP attack without Verifiable SS; (t,m,n)-ITOSS binds all m, (m>=t), participants into a tightly coupled group and requires all participants to be legal shareholders before recovering the secret. 2) As an example, the paper presents a polynomial-based (t,m,n)-ITOSS scheme, in which the proposed k-round Random Number Selection (RNS) guarantees that adversaries have to crack at least symmetrical private channels among participants before obtaining the secret. Therefore, k-round RNS enhances the robustness of (t,m,n)-ITOSS against t/2-PCC attack to the utmost. 3) The paper finally presents a generalized method of converting an ideal (t,n)-SS into a (t,m,n)-ITOSS, which helps an ideal (t,n)-SS substantially improve the robustness against the above 2 attacks

A weighted interpretation for the super Catalan numbers

The super Catalan numbers $T(m,n)=(2m)!(2n)!/2m!n!(m+n)!$ are integers which generalize the Catalan numbers. With the exception of a few values of $m$, no combinatorial interpretation in known for $T(m,n)$. We give a weighted interpretation for $T(m,n)$ and develop a technique that converts this weighted interpretation into a conventional combinatorial interpretation in the case $m=2$.Comment: 8 pages, 5 figure