Related papers: A Three-Dimensional SFT with Sparse Columns
In this paper we consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best $s$-term approximation of the Discrete Fourier Transform (DFT) $\mathbf{\hat{f}} \in \mathbb{C}^N$ of any given input vector…
Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…
Consider the discrete cubic Hilbert transform defined on finitely supported functions $f$ on $\mathbb{Z}$ by \begin{eqnarray*} H_3f(n) = \sum_{m \not = 0} \frac{f(n- m^3)}{m}. \end{eqnarray*} We prove that there exists $r <2$ and universal…
We propose a new mechanism of spontaneous supersymmetry breaking. The existence of extra dimensions with nontrivial topology plays an important role. We investigate new features resulted from the mechanism in two simple supersymmetric Z_2…
We introduce {\it (W')-specification} in terms of language decompositions of subshifts, and show that any recurrence set of a subshift with this property has full Hausdorff dimension. Our main result applies to a wide class of subshifts…
We propose a multi-dimensional (M-D) sparse Fourier transform inspired by the idea of the Fourier projection-slice theorem, called FPS-SFT. FPS-SFT extracts samples along lines (1-dimensional slices from an M-D data cube), which are…
Alternating sign trapezoids have recently been introduced as a generalisation of alternating sign triangles. Fischer established a threefold refined enumeration of alternating sign trapezoids and provided three statistics on column strict…
In this paper we construct nonlinear partial differential equations in more than 3 independent variables, possessing a manifold of analytic solutions with high, but not full, dimensionality. For this reason we call them ``partially…
Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…
Row-column factorial designs that provide unconfounded estimation of all main effects and the maximum number of two-factor interactions (2fi's) are called 2fi-optimal. This issue has been paid great attention recently for its wide…
The coordinate Bethe ansatz solutions of the XXZ model for a one-dimensional spin-1/2 chain are analyzed with focus on the statistical properties of the constituent quasiparticles. Emphasis is given to the special cases known as XX, XXX,…
We consider the XXZ spin-1/2 Heisenberg chain with antiperiodic boundary conditions. The inhomogeneous version of this model can be solved by Separation of Variables (SoV), and the eigenstates can be constructed in terms of Q-functions,…
We study the defect CFT associated with the half-BPS Wilson line in $\mathcal{N}=4$ Super Yang-Mills theory in four dimensions. Using a perturbative bootstrap approach, we derive new analytical results for multipoint correlators of…
We propose two semiparametric versions of the debiased Lasso procedure for the model $Y_i = X_i\beta_0 + g_0(Z_i) + \epsilon_i$, where $\beta_0$ is high dimensional but sparse (exactly or approximately). Both versions are shown to have the…
This paper presents a Bayesian nonparametric latent feature model specially suitable for exploratory analysis of high-dimensional count data. We perform a non-negative doubly sparse matrix factorization that has two main advantages: not…
We present a matrix-factorization algorithm that scales to input matrices with both huge number of rows and columns. Learned factors may be sparse or dense and/or non-negative, which makes our algorithm suitable for dictionary learning,…
We discuss a marginal deformation of the SL(2,R) x SU(2) x U(1)^4 WZW model, which describes string theory on AdS_3 x S^3 x T^4, that corresponds to warping the S^3 factor. This deformation breaks part of the N=(4,4) supersymmetry of the…
In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…
For any $d \geq 1$, random $\mathbb{Z}^d$ shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter $\alpha \in [0,1]$, an alphabet $\mathcal{A}$, and a scale $n \in \mathbb{N}$, one obtains a distribution…
Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most successful variants of binary decision diagrams (BDDs). On the other hand, BDDs are also called branching programs in…