English
Related papers

Related papers: A Johnson-Kist type representation for truncated v…

200 papers

We prove identities generating higher dimensional vector partitions. We derive theorems for integer lattice points in the 2D first quadrant, then generalize the approach to find 3D and $n$-space lattice point vector region extensions. We…

Combinatorics · Mathematics 2023-02-03 Geoffrey B. Campbell

We consider the class of non-Hermitian operators represented by infinite tridiagonal matrices, selfadjoint in an indefinite inner product space with one negative square. We approximate them with their finite truncations. Both infinite and…

Mathematical Physics · Physics 2016-08-08 Maxim Derevyagin , Luca Perotti , Michal Wojtylak

Whitney type examples of maps $f\in C^k(\real^m,\real^n)$ for a maximal possible real $k$, and multidimensional space-filling curves with special properties are constructed.

Geometric Topology · Mathematics 2016-09-07 Azat Ainouline

Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exist a convex…

Functional Analysis · Mathematics 2008-03-11 B. F. Svaiter

We give a new method to construct linear spaces of matrices of constant rank, based on truncated graded cohomology modules of certain vector bundles as well as on the existence of graded Artinian modules with pure resolutions. Our method…

Algebraic Geometry · Mathematics 2017-02-07 Ada Boralevi , Daniele Faenzi , Paolo Lella

Two new generalizations of the relation of comonotonicity of lattice-valued vectors are introduced and discussed. These new relations coincide on distributive lattices and they share several properties with the comonotonicity for the…

Functional Analysis · Mathematics 2018-10-16 Radomír Halaš , Radko Mesiar , Jozef Pócs

We describe a one-dimensional kink crystal, which represents a collection of equal and equally localized kinks forming a lattice in the real axis. The results are analytical, original and may motivate other studies on localized structures…

High Energy Physics - Theory · Physics 2024-03-29 D. Bazeia , G. S. Santiago

Is it possible to define, for certain values n the product of vectors of the real vector space of n dimensions, such that this is, with respect to multiplication and the ordinary addition of vectors, a numerical system which contains the…

General Mathematics · Mathematics 2007-05-23 Mijail Andres Saralain Figueredo

We classify the maximal $m$-distance sets in $\mathbb{R}^{n-1}$ which contain the representation of the Johnson graph $J(n, m)$ for $m = 2, 3$. Furthermore, we determine the necessary and sufficient condition for $n$ and $m$ such that the…

Combinatorics · Mathematics 2012-09-04 Eiichi Bannai , Takahiro Sato , Junichi Shigezumi

We study the continuity of an abstract generalization of the maximum-entropy inference - a maximizer. It is defined as a right-inverse of a linear map restricted to a convex body which uniquely maximizes on each fiber of the linear map a…

Mathematical Physics · Physics 2016-05-17 Leiba Rodman , Ilya M. Spitkovsky , Arleta Szkoła , Stephan Weis

The aim of this note is to point out a convexity property with respect to the root lattice for the support of the highest weights that occur in a tensor product of irreducible rational representations of $SL(n)$ over the complex numbers.…

Representation Theory · Mathematics 2021-07-06 Hariharan Narayanan , C. S. Rajan

The solution of the Ornstein-Zernike equation with various closure approximations is studied. This problem is rewritten as an integral equation that can be solved iteratively on a grid. The convergence of the fixed point iterations is…

chem-ph · Physics 2009-10-28 Herbert H. H. Homeier , Sebastian Rast , Hartmut Krienke

In this paper, we propose new proximal Newton-type methods for convex optimization problems in composite form. The applications include model predictive control (MPC) and embedded MPC. Our new methods are computationally attractive since…

Optimization and Control · Mathematics 2020-07-21 Ilan Adler , Zhiyue Tom Hu , Tianyi Lin

The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an…

Optimization and Control · Mathematics 2022-02-04 Romain Ageron

We consider the design of asymmetric multiple description lattice quantizers that cover the entire spectrum of the distortion profile, ranging from symmetric or balanced to successively refinable. We present a solution to a labeling…

Combinatorics · Mathematics 2007-05-23 Suhas N. Diggavi , N. J. A. Sloane , Vinay A. Vaishampayan

A detailed combinatorial analysis of planar convex lattice polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained.

Probability · Mathematics 2016-06-17 Julien Bureaux , Nathanaël Enriquez

A vector composition of a vector $\mathbf{\ell}$ is a matrix $\mathbf{A}$ whose rows sum to $\mathbf{\ell}$. We define a weighted vector composition as a vector composition in which the column values of $\mathbf{A}$ may appear in different…

Combinatorics · Mathematics 2018-08-28 Steffen Eger

Let F be a global function field with constant field $\mathbb{F}_q$. Let G be a reductive group over $\mathbb{F}_q$. We establish a variant of Arthur's truncated kernel for G and for its Lie algebra which generalizes Arthur's original…

Number Theory · Mathematics 2023-03-08 Hongjie Yu

We study the structure of representations, defined as approximations of minimal sufficient statistics that are maximal invariants to nuisance factors, for visual data subject to scaling and occlusion of line-of-sight. We derive analytical…

Computer Vision and Pattern Recognition · Computer Science 2015-04-20 Stefano Soatto , Jingming Dong , Nikolaos Karianakis

We present analytical expressions for optimal entropy-constrained multiple-description lattice vector quantizers which, under high-resolutions assumptions, minimize the expected distortion for given packet-loss probabilities. We consider…

Information Theory · Computer Science 2016-11-17 Jan Ostergaard , Richard Heusdens , Jesper Jensen