Related papers: Equipartition of a segment

Consider a_1,a_2,...,a_n, arbitrary elements of R. We characterize those real functions f that decompose into the sum of a_j-periodic functions, i.e., f=f_1+...+f_n with D_{a_j}f(x):=f(x+a_j)-f(x)=0. We show that f has such a decomposition…

In the case of finite measures on finite spaces, we state conditions under which {\phi}- projections are continuously differentiable. When the set on which one wishes to {\phi}- project is convex, we show that the required assumptions are…

A criterion for a functor between derived categories of coherent sheaves to be full and faithful is given. A semiorthogonal decomposition for the derived category of coherent sheaves on the intersection of two even dimensional quadrics is…

The main result of this paper shows a totally new necessary and sufficient condition to determine both real and complex zeros of derivative of all entire and meromorphic functions of one complex variable in the extended complex plane. By…

Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…

Suppose l=2m+1, m>0. We introduce m "theta-series", [1],...,[m], in Z/2[[x]]. It has been conjectured that the n for which the coefficient of x^n in 1/[i] is 1 form a set of density 0. This is probably always false, but in certain cases,…

A segment representation of a graph is an assignment of line segments in 2D to the vertices in such a way that two segments intersect if and only if the corresponding vertices are adjacent. Not all graphs have such segment representations,…

Necessary and sufficient observable conditions for the nonnegativity of all partial transpositions of multi-mode quantum states are derived. The result is a hierarchy of inequalities for minors in terms of moments of the given state.…

Let $f: \{1, ..., n\} \rightarrow \{1, ..., n\}$ be a function (not necessarily one-to-one). An $f-derangement$ is a permutation $ g:\{1,...,n\} \rightarrow \{1,...,n\}$ such that $g(i) \neq f(i)$ for each $ i = 1, ..., n$. When $f$ is…

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…

The following problem has been known since the 80s. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $\{m_i\}_{i=1}^{t}$, be positive integers such that $\sum_{i=1}^t m_i=m-1$. Determine when…

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…

Given positive real numbers, we prove two inequalities involving their potential energy and their power sums. We also prove an inequality involving the energy and the discriminant and apply it to deduce a result on totally positive…

Call a simple graph $H$ of order $n$ well-separable, if by deleting a separator set of size $o(n)$ the leftover will have components of size at most $o(n)$. We prove, that bounded degree well-separable spanning subgraphs are easy to embed:…

We Define moments of partitions of integers, and show that they appear in higher order derivatives of certain combinations of functions.

In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

We prove that any complete metric space has a unique decomposition as a direct product of a possibly finite or zero-dimensional Hilbert space and a space that does not split off lines.

An old conjecture of Ringel states that every tree with $m$ edges decomposes the complete graph $K_{2m+1}$. The best known lower bound for the order of a complete graph which admits a decomposition by every given tree with $m$ edges is…