Sciweavers

SIAMMA
2011
70views more  SIAMMA 2011»
13 years 6 months ago
Global Smooth Solutions of Euler Equations for Van der Waals Gases
We prove global in time existence of solutions of the Euler compressible equations for a Van der Waals gas when the density is small enough in Hm , for m large enough. To do so, w...
Magali Lécureux-Mercier
CORR
2011
Springer
206views Education» more  CORR 2011»
13 years 6 months ago
Convergence analysis of a proximal Gauss-Newton method
Abstract An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Co...
Saverio Salzo, Silvia Villa
MICS
2010
102views more  MICS 2010»
13 years 9 months ago
Computing Zeta Functions of Superelliptic Curves in Larger Characteristic
Abstract. Following Gaudry and G¨urel who extended Kedlaya’s point-counting algorithm to superelliptic curves, we introduce Harvey’s running time improvements for large enough...
Moritz Minzlaff
MICS
2010
76views more  MICS 2010»
13 years 9 months ago
Mathematical Context in Interactive Documents
Abstract. In this paper we introduce the concept of an interactive mathematical document. We give a formal description of such a document, which enables us to introduce the notion ...
A. M. Cohen, Hans Cuypers, R. Verrijzer
JGO
2010
531views more  JGO 2010»
13 years 9 months ago
Characterizing zero-derivative points
We study smooth functions in several variables with a Lipschitz derivative. It is shown that these functions have the “envelope property”: Around zero-derivative points, and on...
Sanjo Zlobec
IPL
2010
160views more  IPL 2010»
13 years 9 months ago
Antimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
Michael D. Barrus
COMBINATORICS
1998
77views more  COMBINATORICS 1998»
13 years 11 months ago
Permutations which are the Union of an Increasing and a Decreasing Subsequence
It is shown that there are 2n n − n−1 m=0 2n−m−1 2m m permutations which are the union of an increasing sequence and a decreasing sequence. 1991 Mathematics Subject Classi...
M. D. Atkinson
IJAC
2007
85views more  IJAC 2007»
13 years 11 months ago
Limit Groups are Conjugacy Separable
A limit group is a finitely generated subgroup of a residually free group. We prove the result announced in the tittle. 2000 Mathematics Subject Classification: 20E06, 20E08, 20...
S. C. Chagas, Pavel Zalesskii
KGC
1997
Springer
14 years 3 months ago
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
Bernd Borchert, Frank Stephan
SSC
2007
Springer
147views Cryptology» more  SSC 2007»
14 years 5 months ago
Remarks on a Sequence of Minimal Niven Numbers
In this short note we introduce two new sequences defined using the sum of digits in the representation of an integer in a certain base. A connection to Niven numbers is proposed ...
H. Fredricksen, E. J. Ionascu, Florian Luca, Pante...