93,091 research outputs found
Numerical Computation of Exponential Functions of Nabla Fractional Calculus
In this article, we illustrate the asymptotic behaviour of exponential
functions of nabla fractional calculus. For this purpose, we propose a novel
matrix technique to compute these functions numerically
Implementing Brouwer's database of strongly regular graphs
Andries Brouwer maintains a public database of existence results for strongly
regular graphs on vertices. We implemented most of the infinite
families of graphs listed there in the open-source software Sagemath, as well
as provided constructions of the "sporadic" cases, to obtain a graph for each
set of parameters with known examples. Besides providing a convenient way to
verify these existence results from the actual graphs, it also extends the
database to higher values of .Comment: 18 pages, LaTe
Mixed Ehrhart polynomials
For lattice polytopes , Bihan (2014)
introduced the discrete mixed volume in analogy
to the classical mixed volume. In this note we initiate the study of the
associated mixed Ehrhart polynomial . We study properties of this polynomial and we
give interpretations for some of its coefficients in terms of (discrete) mixed
volumes. Bihan (2014) showed that the discrete mixed volume is always
non-negative. Our investigations yield simpler proofs for certain special
cases. We also introduce and study the associated mixed -vector. We show
that for large enough dilates the corresponding mixed
-polynomial has only real roots and as a consequence the mixed
-vector becomes non-negative.Comment: 12 page
On largest volume simplices and sub-determinants
We show that the problem of finding the simplex of largest volume in the
convex hull of points in can be approximated with a factor
of in polynomial time. This improves upon the previously best
known approximation guarantee of by Khachiyan. On the other hand,
we show that there exists a constant such that this problem cannot be
approximated with a factor of , unless . % This improves over the
inapproximability that was previously known. Our hardness result holds
even if , in which case there exists a \bar c\,^{d}-approximation
algorithm that relies on recent sampling techniques, where is again a
constant. We show that similar results hold for the problem of finding the
largest absolute value of a subdeterminant of a matrix
Quantity and number
Quantity is the first category that Aristotle lists after substance. It has extraordinary epistemological clarity: "2+2=4" is the model of a self-evident and universally known truth. Continuous quantities such as the ratio of circumference to diameter of a circle are as clearly known as discrete ones. The theory that mathematics was "the science of quantity" was once the leading philosophy of mathematics. The article looks at puzzles in the classification and epistemology of quantity
Towards the Formalization of Fractional Calculus in Higher-Order Logic
Fractional calculus is a generalization of classical theories of integration
and differentiation to arbitrary order (i.e., real or complex numbers). In the
last two decades, this new mathematical modeling approach has been widely used
to analyze a wide class of physical systems in various fields of science and
engineering. In this paper, we describe an ongoing project which aims at
formalizing the basic theories of fractional calculus in the HOL Light theorem
prover. Mainly, we present the motivation and application of such formalization
efforts, a roadmap to achieve our goals, current status of the project and
future milestones.Comment: 9 page
Near-best quartic spline quasi-interpolants on type-6 tetrahedral partitions of bounded domains
In this paper, we present new quasi-interpolating spline schemes defined on
3D bounded domains, based on trivariate quartic box splines on type-6
tetrahedral partitions and with approximation order four. Such methods can be
used for the reconstruction of gridded volume data. More precisely, we propose
near-best quasi-interpolants, i.e. with coefficient functionals obtained by
imposing the exactness of the quasi-interpolants on the space of polynomials of
total degree three and minimizing an upper bound for their infinity norm. In
case of bounded domains the main problem consists in the construction of the
coefficient functionals associated with boundary generators (i.e. generators
with supports not completely inside the domain), so that the functionals
involve data points inside or on the boundary of the domain.
We give norm and error estimates and we present some numerical tests,
illustrating the approximation properties of the proposed quasi-interpolants,
and comparisons with other known spline methods. Some applications with real
world volume data are also provided.Comment: In the new version of the paper, we have done some minor revisions
with respect to the previous version, CALCOLO, Published online: 10 October
201
Helly numbers of Algebraic Subsets of
We study -convex sets, which are the geometric objects obtained as the
intersection of the usual convex sets in with a proper subset
. We contribute new results about their -Helly
numbers. We extend prior work for , , and ; we give sharp bounds on the -Helly numbers in
several new cases. We considered the situation for low-dimensional and for
sets that have some algebraic structure, in particular when is an
arbitrary subgroup of or when is the difference between a
lattice and some of its sublattices. By abstracting the ingredients of Lov\'asz
method we obtain colorful versions of many monochromatic Helly-type results,
including several colorful versions of our own results.Comment: 13 pages, 3 figures. This paper is a revised version of what was
originally the first half of arXiv:1504.00076v
- …