相关论文: Bounds on Discrete Potentials of Spherical (k,k)-D…

A new modulus of smoothness and its equivalent $K$-function are defined on the conic domains in $\mathbb{R}^d$, and used to characterize the weighted best approximation by polynomials. Both direct and weak inverse theorems of the…

We derive upper bounds on the difference between the orthogonal projections of a smooth function $u$ onto two finite element spaces that are nearby, in the sense that the support of every shape function belonging to one but not both of the…

A finite set X in the Euclidean space is called an s-inner product set if the set of the usual inner products of any two distinct points in X has size s. First, we give a special upper bound for the cardinality of an s-inner product set on…

In this work we investigate the min-max-min robust optimization problem and the k-adaptability robust optimization problem for binary problems with uncertain costs. The idea of the first approach is to calculate a set of k feasible…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

On any compact manifold of dimension $n\geq3$ with boundary, we prescibe any finite part of the Steklov spectrum whithin a given conformal class. In particular, we prescribe the multiplicity of the first eigenvalues. On a compact surface…

In this note, we first try to prove a uniform lower bound of nodal volume in elliptic homogenization setting. This lower bound is far from optimal. But, we can prove a constant lower bound in dimension two. Motivated by the proof, we extend…

We consider an energy functional motivated by the celebrated $K_{13}$ problem in the Oseen-Frank theory of nematic liquid crystals. It is defined for sphere-valued functions and appears as the usual Dirichlet energy with an additional…

In this paper, we study the two natural polarizations, namely the standard polarization and the box polarization, of the d-th power of the maximal ideal in a polynomial ring. We show that these polarizations correspond to smooth points in…

In this article, we introduce the notion of circular k-superpatterns, defined as permutations that contain all length-k patterns up to rotation equivalence. We present a construction of a circular superpattern from a linear…

We give a nontrivial lower bound for global dimension of a spherical fusion category.

The canonical dimension is an invariant attached to admissible representations of p-adic reductive groups, which has only received significant attention in the case of mod-p representations. In the case of complex representations, the…

We study the universality of superconcentration for the free energy in the Sherrington-Kirkpatrick (SK) model. In arXiv:0907.3381, Chatterjee showed that when the system consists of $N$ spins and Gaussian disorders, the variance of this…

We calculate the energy and wave functions of two particles confined to two spatial dimensions interacting via arbitrary anisotropic potentials with negative or zero net volume. The general rigorous analytic expressions are given in the…

This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determined by the nonlinear codeword length objective of…

In $\mathbb{R}^n$, we establish an asymptotically sharp upper bound for the upper Minkowski dimension of $k$-porous sets having holes of certain size near every point in $k$ orthogonal directions at all small scales. This bound tends to…

We study the computational complexity of decision problems in $k$-level linear programming (LP). Seminal work by Jeroslow establishes that determining whether the optimal objective value of a $k$-level LP is at least as good as a given…

The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…

Let $\textrm{S}(n,t,k)$ be the maximum size of a code containing only vectors of the $k$th shell of the integer lattice $\mathbb{Z}^n$ such that the inner product between distinct vectors does not exceed $t$. In this paper we compute lower…

An $(n,k)$-Sperner partition system is a collection of partitions of some $n$-set, each into $k$ nonempty classes, such that no class of any partition is a subset of a class of any other. The maximum number of partitions in an…