English
Related papers

Related papers: Hypomorphic Sperner systems and nonreconstructible…

200 papers

A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…

Combinatorics · Mathematics 2010-09-15 Kruchinin Vladimir Victorovich

A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the…

Symbolic Computation · Computer Science 2013-01-24 Shaoshi Chen , Ruyong Feng , Guofeng Fu , Ziming Li

In this article, we consider some generalizations of polynomial and exponential B-splines. Firstly, the extension from integral to complex orders is reviewed and presented. The second generalization involves the construction of uncountable…

Metric Geometry · Mathematics 2019-02-18 Peter Massopust

It is well known that the Lorenz system has $Z_2$-symmetry. Using introducted in math.DS/0105147 topological covering-coloring a new representation for the Lorenz system is obtained. Deleting coloring leads to the factorized Lorenz system…

Dynamical Systems · Mathematics 2007-05-23 I. Kunin , A. Runov

Reconstruction of density functions and their characteristic functions by radial basis functions with scattered data points is a popular topic in the theory of pricing of basket options. Such functions are usually entire or admit an…

Mathematical Finance · Quantitative Finance 2014-04-22 A. Kushpel , J. Levesley

Four families of special functions, depending on n variables, are studied. We call them symmetric and antisymmetric multivariate sine and cosine functions. They are given as determinants or antideterminants of matrices, whose matrix…

Classical Analysis and ODEs · Mathematics 2009-11-13 A. Klimyk , J. Patera

The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…

Logic · Mathematics 2020-05-13 Emil Jeřábek

Submodular function maximization has found a wealth of new applications in machine learning models during the past years. The related supermodular maximization models (submodular minimization) also offer an abundance of applications, but…

Data Structures and Algorithms · Computer Science 2020-06-25 Mehrdad Ghadiri , Richard Santiago , Bruce Shepherd

Recently the authors and J.M. Kress presented a special function recurrence relation method to prove quantum superintegrability of an integrable 2D system that included explicit constructions of higher order symmetries and the structure…

Mathematical Physics · Physics 2015-05-27 E. G. Kalnins , W. Miller,

In 1955, Berger \cite{Ber} gave a list of irreducible reductive representations which can occur as the holonomy of a torsion-free affine connection. This list was stated to be complete up to possibly a finite number of missing entries. In…

dg-ga · Mathematics 2015-06-25 Quo-Shin Chi , Sergey A. Merkulov , Lorenz J. Schwachhöfer

The problem of inverting a system in presence of a series-defined output is analyzed. Inverse models are derived that consist of a set of algebraic equations. The inversion is performed explicitly for an output trajectory functional, which…

Systems and Control · Computer Science 2012-11-27 Jean-Francois Stumper , Ralph Kennel

In this paper, we investigate parameter families of iterated function systems and continuity. Specifically, if we have a set of iterated function systems that depend continuously on a parameter, which properties of the invariant sets will…

Dynamical Systems · Mathematics 2007-05-23 Maxwell Murphy

This paper sets the groundwork for the consideration of families of recursively defined polynomials and rational functions capable of describing the Bernoulli numbers. These families of functions arise from various recursive definitions of…

Number Theory · Mathematics 2018-12-31 Christina Taylor

In its most general formulation a quantum kinematical system is described by a Heisenberg group; the "configuration space" in this case corresponds to a maximal isotropic subgroup. We study irreducible models for Heisenberg groups based on…

Quantum Algebra · Mathematics 2007-05-23 T. Digernes , V. S. Varadarajan

We define new families of noncommutative symmetric functions and quasi-symmetric functions depending on two matrices of parameters, and more generally on parameters associated with paths in a binary tree. Appropriate specializations of both…

Combinatorics · Mathematics 2013-02-12 Alain Lascoux , Jean-Christophe Novelli , Jean-Yves Thibon

We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…

Rings and Algebras · Mathematics 2019-09-16 Sebastian Kreinecker

Differentiable real function reproducing primes up to a given number and having a differentiable inverse function is constructed. This inverse function is compared with the Riemann-Von Mangoldt exact expression for the number of primes not…

Number Theory · Mathematics 2007-05-23 Lumomir Alexandrov , D. B. Baranov , Plamen Yotov

We study irreducible specializations, in particular when group-preserving specializations may not exist. We obtain a criterion in terms of embedding problems. We include several applications to analogs of Schinzel's hypothesis H and to the…

Number Theory · Mathematics 2010-09-23 Lior Bary-Soroker

This article summarises the theory of several bounded functional calculi for unbounded operators that have recently been discovered. The extend the Hille--Phillips calculus for (negative) generators $A$ of certain bounded $C_0$-semigroups,…

Functional Analysis · Mathematics 2022-02-08 Charles Batty , Alexander Gomilko , Yuri Tomilov

First of all we give some reasons that "natural proofs" built not a barrier to prove P $\not=$ NP using Boolean complexity. Then we investigate the approximation method for its extension to prove super-polynomial lower bounds for the…

Computational Complexity · Computer Science 2020-06-16 Norbert Blum