## SEARCH

#### Institution

##### ( see all 5458)

- Russian Academy of Sciences 109 (%)
- Zentrum Mathematik 93 (%)
- Universität Stuttgart 87 (%)
- Moscow State University 69 (%)
- Chinese Academy of Sciences 66 (%)

#### Author

##### ( see all 14593)

- Karpfinger, Christian 93 (%)
- Höllig, Klaus 64 (%)
- Hörner, Jörg 64 (%)
- Börgers, Christoph 49 (%)
- Walz, Guido 46 (%)

#### Publication

##### ( see all 331)

- Journal of Scientific Computing 201 (%)
- Journal of Mathematical Sciences 180 (%)
- The Journal of Geometric Analysis 165 (%)
- Advances in Difference Equations 121 (%)
- Designs, Codes and Cryptography 115 (%)

#### Subject

##### ( see all 168)

- Mathematics [x] 9331 (%)
- Mathematics, general 3409 (%)
- Analysis 1546 (%)
- Applications of Mathematics 1378 (%)
- Theoretical, Mathematical and Computational Physics 1006 (%)

## CURRENTLY DISPLAYING:

Most articles

Fewest articles

Showing 1 to 10 of 9331 matching Articles
Results per page:

## Grundwissen Differenzialrechnung

### (Hoch)Schulmathematik (2017-01-01): 113-150 , January 01, 2017

### Zusammenfassung

In diesem Kapitel konzentrieren wir uns auf das, was in der Schule oftmals etwas zu kurz kommt: Eine präzise Einführung des Begriffes der ″Ableitung einer Funktion″. Zusammen mit dem Integralbegriff ist dies wohl die bedeutsamste Anwendung des Grenzwert-Konzepts in der Mathematik schlechthin. Auf Dinge wie z.B. Berechnung von Extrem- und Wendepunkten gehen wir hier nicht näher ein – dies wird im Matheunterricht ja auch bis zum Umfallen eingeübt. Allerdings stellen wir ausführlich die Ableitungsregeln bereit, die wir in Kapitel 8 benötigen werden.

## Strong convergence of an extragradient-type algorithm for the multiple-sets split equality problem

### Journal of Inequalities and Applications (2017-02-28) 2017: 1-11 , February 28, 2017

This paper introduces a new extragradient-type method to solve the multiple-sets split equality problem (MSSEP). Under some suitable conditions, the strong convergence of an algorithm can be verified in the infinite-dimensional Hilbert spaces. Moreover, several numerical results are given to show the effectiveness of our algorithm.

## A Note on Generalized Lagrangians of Non-uniform Hypergraphs

### Order (2017-03-01) 34: 9-21 , March 01, 2017

Set
$A\subset {\mathbb N}$
is less than
$B\subset {\mathbb N}$
in the *colex ordering* if *m**a**x*(*A*△*B*)∈*B*. In 1980’s, Frankl and Füredi conjectured that the *r*-uniform graph with *m* edges consisting of the first *m* sets of
${\mathbb N}^{(r)}$
in the colex ordering has the largest Lagrangian among all *r*-uniform graphs with *m* edges. A result of Motzkin and Straus implies that this conjecture is true for *r*=2. This conjecture seems to be challenging even for *r*=3. For a hypergraph *H*=(*V*,*E*), the set *T*(*H*)={|*e*|:*e*∈*E*} is called the *edge type* of *H*. In this paper, we study non-uniform hypergraphs and define *L*(*H*) a generalized Lagrangian of a non-uniform hypergraph *H* in which edges of different types have different weights. We study the following two questions: 1. Let *H* be a hypergraph with *m* edges and edge type *T*. Let *C*_{m,T} denote the hypergraph with edge type *T* and *m* edges formed by taking the first *m* sets with cardinality in *T* in the colex ordering. Does *L*(*H*)≤*L*(*C*_{m,T}) hold? If *T*={*r*}, then this question is the question by Frankl and Füredi. 2. Given a hypergraph *H*, find a minimum subhypergraph *G* of *H* such that *L*(*G*) = *L*(*H*). A result of Motzkin and Straus gave a complete answer to both questions if *H* is a graph. In this paper, we give a complete answer to both questions for {1,2}-hypergraphs. Regarding the first question, we give a result for {1,*r*_{1},*r*_{2},…,*r*_{l}}-hypergraph. We also show the connection between the generalized Lagrangian of {1,*r*_{1},*r*_{2},⋯ ,*r*_{l}}-hypergraphs and {*r*_{1},*r*_{2},⋯ ,*r*_{l}}-hypergraphs concerning the second question.

## The Matrix Exponential Function

### Positive Operator Semigroups (2017-01-01) 257: 43-53 , January 01, 2017

We continue our investigation of the asymptotic behavior of dynamical systems described by matrices, which was started in last chapter, now moving to the continuous time case. This means that we investigate the asymptotic properties of the matrix exponential function.

## An extension of a multidimensional Hilbert-type inequality

### Journal of Inequalities and Applications (2017-04-18) 2017: 1-12 , April 18, 2017

In this paper, by the use of weight coefficients, the transfer formula and the technique of real analysis, a new multidimensional Hilbert-type inequality with multi-parameters and a best possible constant factor is given, which is an extension of some published results. Moreover, the equivalent forms, the operator expressions and a few particular inequalities are considered.

## Entropy and Thinning of Discrete Random Variables

### Convexity and Concentration (2017-01-01) 161: 33-53 , January 01, 2017

We describe five types of results concerning information and concentration of discrete random variables, and relationships between them, motivated by their counterparts in the continuous case. The results we consider are information theoretic approaches to Poisson approximation, the maximum entropy property of the Poisson distribution, discrete concentration (Poincaré and logarithmic Sobolev) inequalities, monotonicity of entropy and concavity of entropy in the Shepp–Olkin regime.

## Resource constrained scheduling with general truncated job-dependent learning effect

### Journal of Combinatorial Optimization (2017-02-01) 33: 626-644 , February 01, 2017

Scheduling with general truncated job-dependent learning effect and resource-dependent processing times is studied on a single machine. It is assumed that the job processing time is a function of the amount of resource allocated to the job, the general job-dependent learning effect and the job-dependent control parameter. For each version of the problem that differs in terms of the objective functions and the processing time functions, the optimal resource allocation is provided. Polynomial time algorithms are also developed to find the optimal schedule of several versions of the problem.

## SL(n) Invariant Valuations on Polytopes

### Discrete & Computational Geometry (2017-04-01) 57: 571-581 , April 01, 2017

A classification of $${\text {SL}}(n)$$ invariant valuations on the space of convex polytopes in $$\mathbb {R}^n$$ without any continuity assumptions is established. A corresponding result is obtained on the space of convex polytopes in $$\mathbb {R}^n$$ that contain the origin.

## On Para-Complex Affine Hyperspheres

### Results in Mathematics (2017-03-30): 1-23 , March 30, 2017

In this paper we introduce a notion of a para-complex affine hypersphere. We give a complete local classification of such hypersurfaces and give several examples. It turns out that every para-complex affine hypersphere can be constructed from (real) affine hyperspheres. As an application, we classify all 2-dimensional para-complex affine hyperspheres.

## Compact differences of weighted composition operators on the weighted Bergman spaces

### Journal of Inequalities and Applications (2017-01-03) 2017: 1-14 , January 03, 2017

In this paper, we consider the compact differences of weighted composition operators on the standard weighted Bergman spaces. Some necessary and sufficient conditions for the differences of weighted composition operators to be compact are given, which extends Moorhouse’s results in (J. Funct. Anal. 219:70-92, 2005).