English
Related papers

Related papers: Introducing the vfunc R package

200 papers

Multiplicative mixed models can be applied in a wide range of scientific disciplines, since they are relevant in every situation where an interaction between a fixed effect and a random effect is present. Until now, no R package has been…

Computation · Statistics 2018-11-05 Sofie Pødenphant , Kasper Kristensen , Per B. Brockhoff

Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combine two features: 1) a special type of interfaces; and 2)…

Programming Languages · Computer Science 2012-03-21 Bruno C. d. S. Oliveira , Tom Schrijvers , Wontae Choi , Wonchan Lee , Kwangkeun Yi

This extended abstract gives a brief outline of the connections between the descriptions and variable concepts. Thus, the notion of a concept is extended to include both the syntax and semantics features. The evaluation map in use is…

Logic in Computer Science · Computer Science 2007-05-23 Viacheslav Wolfengagen

The intention of these notes is to give a mathematical account of how I believe students could be taught to think about functional programming languages and to explain how such languages work.

Programming Languages · Computer Science 2010-08-09 Chris Preston

In a previous paper, we provided a formal definition for the concept of computational irreducibility (CIR), i.e. the fact for a function f from N to N that it is impossible to compute f(n) without following approximately the same path than…

Computational Complexity · Computer Science 2013-10-15 Herve Zwirn

Elementary function calls are a common feature in numerical programs. While their implementions in library functions are highly optimized, their computation is nonetheless very expensive compared to plain arithmetic. Full accuracy is,…

Numerical Analysis · Computer Science 2018-11-27 Eva Darulova , Anastasia Volkova

An arithmetical function $f$ is said to be even (mod r) if f(n)=f((n,r)) for all n\in\Z^+, where (n, r) is the greatest common divisor of n and r. We adopt a linear algebraic approach to show that the Discrete Fourier Transform of an even…

Number Theory · Mathematics 2012-10-02 Pentti Haukkanen

Verification of C++ programs has seen considerable progress in several areas, but not for programs that use these languages' mathematical libraries. The reason is that all libraries in widespread use come with no guarantees about the…

Programming Languages · Computer Science 2022-06-23 Roberto Bagnara , Michele Chiari , Roberta Gori , Abramo Bagnara

Let $f,g:(\mathbb{R}^n,0)\rightarrow (\mathbb{R},0)$ be analytic functions. We will show that if $\nabla f(0)=0$ and $g-f \in (f)^{r+2}$ then $f$ and $g$ are $C^r$-right equivalent, where $(f)$ denote ideal generated by $f$ and $r\in…

Algebraic Geometry · Mathematics 2014-12-08 Piotr Migus

To a smooth and symmetric function $f$ defined on a symmetric open set $\Gamma\subset\mathbb{R}^{n}$ and a real $n$-dimensional vector space $V$ we assign an associated operator function $F$ defined on an open subset…

Representation Theory · Mathematics 2018-05-23 Julian Scheuer

Given two arithmetical functions $f,g$ we derive, under suitable conditions, asymptotic formulas with error term, for the convolution sums $\sum_{n \le N} f(n) g(n+h)$, building on an earlier work of Gadiyar, Murty and Padma. A key role in…

Number Theory · Mathematics 2016-08-05 M. Ram Murty , Biswajyoti Saha

Some necessary and sufficient conditions for the existence of Cohen-Ramanujan expansions for arithmetical functions were provided by these authors in [\textit{arXive preprint arXive:2205.08466}, 2022]. Given two arithmetical functions $f$…

Number Theory · Mathematics 2024-01-02 Arya Chandran , K Vishnu Namboothiri

A graph $G$ is called \textit{super edge-magic} if there exists a bijective function $f$ from $V(G) \cup E(G)$ to $\{1, 2, \ldots, |V(G) \cup E(G)|\}$ such that $f(V(G)) = \{1, 2, \ldots, |V(G)|\}$ and $f(x) + f(xy) + f(y)$ is a constant…

Combinatorics · Mathematics 2014-04-29 A. A. G. Ngurah , Rinovia Simanjuntak

Algebraic-geometric codes can be constructed by evaluating a certain set of functions on a set of distinct rational points of an algebraic curve. The set of functions that are evaluated is the linear space of a given divisor or,…

Information Theory · Computer Science 2008-03-10 Valentin Savin

With distributed computing and mobile applications, synchronizing diverging replicas of data structures is a more and more common problem. We use algebraic methods to reason about filesystem operations, and introduce a simplified definition…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-07-24 Elod Pal Csirmaz

We provide new insight into the convergence properties of the Douglas-Rachford algorithm for the problem $\min_x \{f(x)+g(x)\}$, where $f$ and $g$ are convex functions. Our approach relies on and highlights the natural primal-dual symmetry…

Optimization and Control · Mathematics 2021-11-12 Javier Peña , Juan C. Vera , Luis F. Zuluaga

We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…

Combinatorics · Mathematics 2014-02-26 Boris Bukh , Jacob Tsimerman

An invaluable feature of computer algebra systems is their ability to plot the graph of functions. Unfortunately, when one is trying to design a library of mathematical functions, this feature often falls short, producing incorrect and…

Software Engineering · Computer Science 2021-08-10 Guillaume Melquiond

Regular logic can be regarded as the internal language of regular categories, but the logic itself is generally not given a categorical treatment. In this paper, we understand the syntax and proof rules of regular logic in terms of the free…

Category Theory · Mathematics 2019-06-21 Brendan Fong , David I Spivak

For a function $g\colon\{0,1\}^m\to\{0,1\}$, a function $f\colon \{0,1\}^n\to\{0,1\}$ is called a $g$-polymorphism if their actions commute: $f(g(\mathsf{row}_1(Z)),\ldots,g(\mathsf{row}_n(Z))) =…

Discrete Mathematics · Computer Science 2021-06-22 Gilad Chase , Yuval Filmus , Dor Minzer , Elchanan Mossel , Nitin Saurabh
‹ Prev 1 3 4 5 6 7 10 Next ›