English
Related papers

Related papers: A note on powers of the characteristic function

200 papers

We investigate the linear chromatic number $\chi_{\text{lin}}(G(n,p))$ of the binomial random graph $G(n,p)$ on $n$ vertices in which each edge appears independently with probability $p=p(n)$. For dense random graphs ($np \to \infty$ as $n…

Combinatorics · Mathematics 2023-11-16 Austin Eide , Paweł Prałat

We derive necessary and sufficient conditions for a continuous bounded function $f: R\to C$ to be a characteristic function of a probability measure. The Cauchy transform $K_f$ of $f$ is used as analytic continuation of $f$ to the upper and…

Classical Analysis and ODEs · Mathematics 2020-09-11 Saulius Norvidas

In this paper, we investigate the power functions $F(x)=x^d$ over the finite field $\mathbb{F}_{2^{4n}}$, where $n$ is a positive integer and $d=2^{3n}+2^{2n}+2^{n}-1$. It is proved that $F(x)=x^d$ is APcN at certain $c$'s in…

Information Theory · Computer Science 2021-07-15 Ziran Tu , Xiangyong Zeng , Yupeng Jiang , Xiaohu Tang

In this paper we obtain some explicit expressions for the Euler characteristic of a rank n coherent sheaf F on P^N and of its twists F(t) as polynomials in the Chern classes c_i(F), also giving algorithms for the computation. The employed…

Algebraic Geometry · Mathematics 2009-01-17 Cristina Bertone

As a part of our works on effective properties of probability distributions, we deal with the corresponding characteristic functions. A sequence of probability distributions is computable if and only if the corresponding sequence of…

Computational Complexity · Computer Science 2015-07-01 Takakazu Mori , Yoshiki Tsujii , Mariko Yasugi

Let $f(n)$ denote the number of unordered factorizations of a positive integer $n$ into factors larger than $1$. We show that the number of distinct values of $f(n)$, less than or equal to $x$, is at most $\exp \left( C \sqrt{\frac{\log…

Number Theory · Mathematics 2016-09-28 R. Balasubramanian , Priyamvad Srivastav

Extending the idea from the recent paper by Carbonero, Hompe, Moore, and Spirkl, for every function $f\colon\mathbb{N}\to\mathbb{N}\cup\{\infty\}$ with $f(1)=1$ and $f(n)\geq\binom{3n+1}{3}$, we construct a hereditary class of graphs…

Combinatorics · Mathematics 2023-08-17 Marcin Briański , James Davies , Bartosz Walczak

In this paper, we show that the existence of certain first-countable compact-like extensions is equivalent to the equality between corresponding cardinal characteristics of the continuum. For instance, $\mathfrak b=\mathfrak s=\mathfrak c$…

Logic · Mathematics 2025-02-19 Serhii Bardyla , Peter Nyikos , Lyubomyr Zdomskyy

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…

Logic · Mathematics 2013-12-03 Apoloniusz Tyszka

Perfect phylogeny consisting of determining the compatibility of a set of characters is known to be NP-complete. We propose in this article a conjecture on the necessary and sufficient conditions of compatibility: Given a set $\mathcal{C}$…

Data Structures and Algorithms · Computer Science 2011-05-06 Michel Habib , Thu-Hien To

We consider classes of non-manipulable social choice functions with range of cardinality at most two within a set of at least two alternatives. We provide the functional form for each of the classes we consider. This functional form is a…

Theoretical Economics · Economics 2024-02-28 Achille Basile , K. P. S. Bhaskara Rao , Surekha Rao

Cardinal characteristics of the continuum represent the boundaries in size between the countable and the continuum with respect to certain properties of sets. They are often defined as the minimum sizes of families of reals that meet some…

Logic · Mathematics 2025-03-07 Logan McDonald

We consider natural cardinal invariants hm_n and prove several duality theorems, saying roughly: if I is a suitably definable ideal and provably cov(I)>=hm_n, then non(I) is provably small. The proofs integrate the determinacy theory,…

Logic · Mathematics 2007-05-23 Saharon Shelah , Jindrich Zapletal

A double star is a tree with two internal vertices. It is known that the Gy\'arf\'as-Sumner conjecture holds for double stars, that is, for every double star $H$, there is a function $f$ such that if $G$ does not contain $H$ as an induced…

Combinatorics · Mathematics 2021-08-17 Alex Scott , Paul Seymour , Sophie Spirkl

Let $p$ and $q$ be two nonnegative integers with $p+q>0$ and $n>0$. We call $\mathcal{F} \subset \mathcal{P}([n])$ a \textit{(p,q)-tilted Sperner family with patterns on [n]} if there are no distinct $F,G \in \mathcal{F}$ with: $$(i) \ \…

Combinatorics · Mathematics 2016-05-19 Dániel Gerbner , Máté Vizer

Considered will be properties of the set of real numbers $\Re$ generated by an operator that has form of an exponential function of Gelfond-Schneider type with rational arguments. It will be shown that such created set has cardinal number…

General Mathematics · Mathematics 2008-03-24 Slavica Vlahovic , Branislav Vlahovic

The aim of this note is to provoke discussion concerning arithmetic properties of function $p_{d}(n)$ counting partitions of an positive integer $n$ into $d$-th powers, where $d\geq 2$. Besides results concerning the asymptotic behavior of…

Number Theory · Mathematics 2021-02-11 Maciej Ulas

We consider the problem of determining when the difference of two ribbon Schur functions is a single Schur function. We fully classify the five infinite families of pairs of ribbon Schur functions whose difference is a single Schur function…

Combinatorics · Mathematics 2020-08-11 Foster Tom

Power functions with low $c$-differential uniformity have been widely studied not only because of their strong resistance to multiplicative differential attacks, but also low implementation cost in hardware. Furthermore, the…

Information Theory · Computer Science 2023-11-03 Huan Zhou , Xiaoni Du , Wenping Yuan , Xingbin Qiao

An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many…

Combinatorics · Mathematics 2011-06-07 Norman Biggs