相关论文: On the Non-Equivalence of Rearranged Walsh and Tri…
Considering a certain interpolation problem, we derive a series of elliptic difference isomonodromic systems together with their Lax forms. These systems give a multivariate extension of the elliptic Painlev\'e equation.
In this article we consider orthonormal systems consisting of tensor products of splines. We show some convergence results of the corresponding orthogonal series including a.e. convergence and unconditional convergence in $L^p$ for…
We give a simple polynomial time approximation scheme for the weighted matroid matching problem on strongly base orderable matroids. We also show that even the unweighted version of this problem is NP-complete and not in oracle-coNP.
The set of triangulations of a cyclic polytope possesses two a priori different partial orders, known as the higher Stasheff-Tamari orders. The first of these orders was introduced by Kapranov and Voevodsky, while the second order was…
In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…
The symmetric decreasing rearrangement of functions on $\mathbb{R}^n$ features in several seminal inequalities, such as the P\'olya-Szeg\H{o} inequality. The latter was shown by the authors to hold for all smoothing rearrangements, a class…
Chess championships are often organised as a Swiss-system tournament, causing great challenges in ranking the participants due to the different strength of schedules and possible circular triads. The paper suggests that pairwise comparison…
We present a classification of the so-called "additive symmetric 2-cocycles" of arbitrary degree and dimension over Z/p, along with a partial result and some conjectures for m-cocycles over Z/p, m > 2. This expands greatly on a result…
We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming…
The two-by-two Sp(2) matrix has three parameters with unit determinant. Yet, there are no established procedures for diagonalizing this matrix. It is shown that this matrix can be written as a similarity transformation of the two-by-two…
A Lie system is a system of first-order differential equations admitting a superposition rule, i.e., a map that expresses its general solution in terms of a generic family of particular solutions and certain constants. In this work, we use…
It is open whether equivalence ( f = g ) is decidable for string-to-string polyregular functions. We consider their higher-order extension based on the {\lambda}-calculus definition of polyregular functions from Boja\'nczyk (2018). In this…
Given a combinatorial triangulation of an $n$-gon, we study (a) the space of all possible drawings in the plane such the edges are straight line segments and the boundary has a fixed shape, and (b) the algebraic variety of possibilities for…
We give a complete characterization of $2\pi$-periodic weights $w$ for which the usual trigonometric system forms a quasi-greedy basis for $L^p(\bT;w)$, i.e., bases for which simple thresholding approximants converge in norm. The…
We present a criterion, based on three commutator relations, that allows to decide whether two self-adjoint matrices with non-overlapping support are simultaneously unitarily similar to quasidiagonal matrices, i.e., whether they can be…
This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface,…
Multidimensional combinatorial substitutions are rules that replace symbols by finite patterns of symbols in $\mathbb Z^d$. We focus on the case where the patterns are not necessarily rectangular, which requires a specific description of…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface,…
In this article we combinatorially describe the triangles that are present in two types of line arrangements, those which have global cyclicity and those which are infinity type line arrangements. A combinatorial nomenclature has been…