English
Related papers

Related papers: On the Non-Equivalence of Rearranged Walsh and Tri…

200 papers

We show that the slicing problem holds true for subspaces of $L_p,p>2$ in the setting of arbitrary measures in place of volume. This generalizes a result of Milman for the original slicing problem.

Metric Geometry · Mathematics 2016-01-12 Alexander Koldobsky , Alain Pajor

This paper derives sparse recurrence relations between orthogonal polynomials on a triangle and their partial derivatives, which are analogous to recurrence relations for Jacobi polynomials. We derive these recurrences in a systematic…

Classical Analysis and ODEs · Mathematics 2018-01-30 Sheehan Olver , Alex Townsend , Geoff Vasil

How can a stack of identical blocks be arranged to extend beyond the edge of a table as far as possible? We consider a generalization of this classic puzzle to blocks that differ in width and mass. Despite the seemingly simple premise, we…

Combinatorics · Mathematics 2026-02-13 Simon Gmeiner , Andreas S. Schulz

The classical Kepler-Coulomb system in 3 dimensions is well known to be 2nd order superintegrable, with a symmetry algebra that closes polynomially under Poisson brackets. This polynomial closure is typical for 2nd order superintegrable…

Mathematical Physics · Physics 2012-06-08 Ernie G. Kalnins Kalnins , Willard Miller

We consider the relation of the multi-component 2D Toda hierarchy with matrix orthogonal and biorthogonal polynomials. The multi-graded Hankel reduction of this hierarchy is considered and the corresponding generalized matrix orthogonal…

Exactly Solvable and Integrable Systems · Physics 2010-05-05 Carlos Alvarez-Fernandez , Ulises Fidalgo , Manuel Manas

We consider an important problem in signal processing, which consists in finding the sparsest solution of a linear system $\Phi x=b$. This problem has applications in several areas, but is NP-hard in general. Usually an alternative convex…

Optimization and Control · Mathematics 2019-06-25 Matías Valdés , Marcelo Fiori

In this paper, we consider several geometric inverse problems for linear elliptic systems. We prove uniqueness and stability results. In particular, we show the way that the observation depends on the perturbations of the domain. In some…

Analysis of PDEs · Mathematics 2024-02-02 Raul K. C. Araújo , Enrique Fernández-Cara , Diego A. Souza

Superintegrable systems of 2nd order in 3 dimensions with exactly 3-parameter potentials are intriguing objects. Next to the nondegenerate 4-parameter potential systems they admit the maximum number of symmetry operators but their symmetry…

Mathematical Physics · Physics 2017-03-08 M. A. Escobar-Ruiz , W. Miller

Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…

Classical Analysis and ODEs · Mathematics 2014-05-16 Vladimir Bolotnikov

Nandakumar asked whether there is a tiling of the plane by pairwise non-congruent triangles of equal area and equal perimeter. Here a weaker result is obtained: there is a tiling of the plane by pairwise non-congruent triangles of equal…

Metric Geometry · Mathematics 2016-03-31 Dirk Frettlöh

In this paper weighted Dirichlet-type inequalities for the decreasing rearrangement in cylinders are proved. A weighted isoperimetric inequality is also obtained.

Analysis of PDEs · Mathematics 2026-04-27 Friedemann Brock , Francesco Chiacchio , Adele Ferone , Anna Mercaldo

We prove Poincar\'e and Plancherel-Polya inequalities for weighted {\ell}p -spaces on weighted graphs in which the constants are explicitly expressed in terms of some geometric characteristics of a graph. We use Poincar\'e type inequality…

Functional Analysis · Mathematics 2014-03-07 Hartmut F"uhr , Isaac Z. Pesenson

An introduction is given to the Littlewood-Richardson rule, and various combinatorial constructions related to it. We present a proof based on tableau switching, dual equivalence, and coplactic operations. We conclude with a section…

Combinatorics · Mathematics 2007-05-23 Marc A. A. van Leeuwen

We prove that the pattern matching problem is undecidable in polymorphic lambda-calculi (as Girard's system F) and calculi supporting inductive types (as G{\"o}del's system T) by reducing Hilbert's tenth problem to it. More generally…

Logic in Computer Science · Computer Science 2023-06-12 Gilles Dowek

We present a new characterization of the shape equivalent class and the Littlewood-Richardson correspondence of Young tableaux in terms of tropical (ultradiscrete) integrable systems. As an application, an alternative proof of the "shape…

Combinatorics · Mathematics 2018-07-03 Shinsuke Iwao

We prove that the condition \begin{equation} \sum_{n=1}^\infty\frac{1}{nw(n)}<\infty \end{equation} is necessary for an increasing sequence of numbers $w(n)$ to be an almost everywhere unconditional convergence Weyl multiplier for the…

Classical Analysis and ODEs · Mathematics 2021-03-16 Grigori A. Karagulyan

A complete classification of \(\mathrm{SL}(n)\) contravariant, \(p\)-order tensor valuations on convex polytopes in \( \mathbb{R}^n \) for \( n \geq p \) is established without imposing additional assumptions, particularly omitting any…

Metric Geometry · Mathematics 2025-07-08 Jin Li , Dan Ma

The paper is related to the following question of P.~L.~Ul'yanov: is it true that for any $2\pi$-periodic continuous function $f$ there is a uniformly convergent rearrangement of its trigonometric Fourier series? In particular, we give an…

Classical Analysis and ODEs · Mathematics 2007-05-23 S. V. Konyagin

We show constructively that, under certain regularity assumptions, any system of coupled linear differential equations with variable coefficients can be tridiagonalized by a time-dependent Lanczos-like method. The proof we present formally…

Classical Analysis and ODEs · Mathematics 2021-04-22 P. -L. Giscard , S. Pozza

The Restricted Assignment Problem is a prominent special case of Scheduling on Parallel Unrelated Machines. For the strongest known linear programming relaxation, the configuration LP, we improve the non-constructive bound on its…

Data Structures and Algorithms · Computer Science 2019-08-21 Klaus Jansen , Lars Rohwedder
‹ Prev 1 3 4 5 6 7 10 Next ›