English
Related papers

Related papers: The higher sharp I: on $M_1^\#$

200 papers

In this paper, we concentrate our attention on the Muntz problem in the univariate setting and for the uniform norm.

Classical Analysis and ODEs · Mathematics 2007-10-19 J. M. Almira

Let $m,n\ge 2$ be positive integers, $M_m$ the set of $m\times m$ complex matrices and $M_n$ the set of $n\times n$ complex matrices. Regard $M_{mn}$ as the tensor space $M_m\otimes M_n$. Suppose $|\cdot|$ is the Ky Fan $k$-norm with $1 \le…

Quantum Physics · Physics 2012-08-07 Ajda Fosner , Zejun Huang , Chi-Kwong Li , Nung-Sing Sze

In the context of a species sampling problem we discuss a non-parametric maximum likelihood estimator for the underlying probability mass function. The estimator is known in the computer science literature as the high profile estimator. We…

Statistics Theory · Mathematics 2018-01-12 Dragi Anevski , Richard D. Gill , Stefan Zohren

Despite significant progress in object categorization, in recent years, a number of important challenges remain; mainly, the ability to learn from limited labeled data and to recognize object classes within large, potentially open, set of…

Computer Vision and Pattern Recognition · Computer Science 2023-01-05 Yanwei Fu , Xiaomei Wang , Hanze Dong , Yu-Gang Jiang , Meng Wang , Xiangyang Xue , Leonid Sigal

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

Number Theory · Mathematics 2017-01-11 Zhi-Wei Sun

This paper is a sequel to "Representation growth of maximal class groups: non-exceptional primes". We use a constructive method to calculate some exceptional cases of $p$-local representation zeta functions of a family of finitely generated…

Group Theory · Mathematics 2024-12-12 Shannon Ezzat

Selective rationalization improves neural network interpretability by identifying a small subset of input features -- the rationale -- that best explains or supports the prediction. A typical rationalization criterion, i.e. maximum mutual…

Machine Learning · Computer Science 2020-03-24 Shiyu Chang , Yang Zhang , Mo Yu , Tommi S. Jaakkola

Implicit surface representations, such as signed-distance functions, combined with deep learning have led to impressive models which can represent detailed shapes of objects with arbitrary topology. Since a continuous function is learned,…

Computer Vision and Pattern Recognition · Computer Science 2021-02-08 Edgar Tretschk , Ayush Tewari , Vladislav Golyanik , Michael Zollhöfer , Carsten Stoll , Christian Theobalt

A generalization of the notion of an $\infty$-category is presented, allowing for ($\infty$-)cat(egorie)s that may have non-invertible higher morphisms.

Category Theory · Mathematics 2014-03-10 Daniel Gerigk

In this series of papers we study subspaces of de Branges spaces of entire functions which are generated by majorization on subsets $D$ of the closed upper half-plane. The present, first, part is addressed to the question which subspaces of…

Complex Variables · Mathematics 2010-05-18 Anton Baranov , Harald Woracek

This is a preliminary version of visual interpretation integrating multiple sensors in SUCCESSOR, an intelligent, model-based vision system. We pursue a thorough integration of hierarchical Bayesian inference with comprehensive physical…

Artificial Intelligence · Computer Science 2013-04-11 Thomas O. Binford , Tod S. Levitt , Wallace B. Mann

Covering-based rough set theory is an extension to classical rough set. The main purpose of this paper is to study covering rough sets from a topological point of view. The relationship among upper approximations based on topological spaces…

Databases · Computer Science 2012-07-30 Nguyen Duc Thuan

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…

Logic · Mathematics 2025-11-25 Sy-David Friedman , Tapani Hyttinen , Vadim Kulikov

This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…

Data Structures and Algorithms · Computer Science 2009-09-11 David Eppstein

We give a classification and a construction of all smooth $(n-1)$-dimensional varieties of lines in ${\bf P}\sp n$ verifying that all their lines meet a curve. This also gives a complete classification of $(n-1)$-scrolls over a curve…

alg-geom · Mathematics 2008-02-03 Enrique Arrondo , Marina Bertolini , Cristina Turrini

For the Lie superalgebra $q(n+1)$ a description is given in terms of creation and annihilation operators, in such a way that the defining relations of $q(n+1)$ are determined by quadratic and triple supercommutation relations of these…

Quantum Algebra · Mathematics 2009-10-31 T. D. Palev , J. Van der Jeugt

In this paper we elaborate on higher spin cubic interactions for massless, massive and partially massless fields. We work in the gauge invariant frame-like multispinor formalism, combining Lagrangian and unfolded formulations.

High Energy Physics - Theory · Physics 2021-11-09 Yu. M. Zinoviev

We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph's independence number and its acyclic orientations.…

Neural and Evolutionary Computing · Computer Science 2007-05-23 V. C. Barbosa , L. C. D. Campos

On a stack of stable maps, the psi classes are modified by subtracting certain boundary divisors. These modified psi classes are compatible with forgetful morphisms, and are well-suited to enumerative geometry: tangency conditions allow…

Algebraic Geometry · Mathematics 2010-03-09 Tom Graber , Joachim Kock , Rahul Pandharipande

We study plane partitions satisfying condition $a_{n+1,m+1}=0$ (this condition is called "pit") and asymptotic conditions along three coordinate axes. We find the formulas for generating function of such plane partitions. Such plane…

Combinatorics · Mathematics 2018-03-06 M. Bershtein , B. Feigin , G. Merzon