English
Related papers

Related papers: Nonvanishing $k$-flats of Boolean and vectorial fu…

200 papers

This article is devoted to the study of several algebras which are related to symmetric functions, and which admit linear bases labelled by various combinatorial objects: permutations (free quasi-symmetric functions), standard Young…

Combinatorics · Mathematics 2013-02-12 G. Duchamp , F. Hivert , J. -Y. Thibon

We prove generalized ABC theorems for vanishing sums of non-Archimedean entire functions of several variables in arbitrary characteristic.

Number Theory · Mathematics 2009-04-18 William Cherry , Cristina Toropu

We show that the alternating sum of the floor function of $\sqrt{jn}$, with $j$ ranging from 1 to $n$, has an easy evaluation for all odd integers $n\geq 1$. This is in contrast to known non-alternating sums of the same type which hold only…

Number Theory · Mathematics 2025-10-31 Marc Chamberland , Karl Dilcher

In this paper, we investigate the concepts of generalized twice differentiability and quadratic bundles of nonsmooth functions that have been very recently proposed by Rockafellar in the framework of second-order variational analysis. These…

Optimization and Control · Mathematics 2025-01-07 Pham Duy Khanh , Boris S. Mordukhovich , Vo Thanh Phat , Le Duc Viet

Using methods from the theory of commutative graded Banach algebras, we obtain a generalization of the two dimensional Borsuk-Ulam theorem as follows: Let $\phi:S^{2} \rightarrow S^{2}$ be a homeomorphism of order n and $\lambda\neq 1$ be…

Functional Analysis · Mathematics 2013-10-16 Ali Taghavi

For the Hamming graph $H(n,q)$, where a $q$ is a constant prime power and $n$ grows, we construct perfect colorings without non-essential arguments such that $n$ depends exponentially on the off-diagonal part of the quotient matrix. In…

Combinatorics · Mathematics 2024-12-06 Denis S. Krotov

In this paper we introduce and study a family $\Phi_k$ of arithmetic functions generalizing Euler's totient function. These functions are given by the number of solutions to the equation $\gcd(x_1^2+\ldots +x_k^2, n)=1$ with $x_1,\ldots,x_k…

Number Theory · Mathematics 2014-06-26 Catalina Calderon , Jose Maria Grau , A. Oller-Marcen , László Tóth

Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…

Information Theory · Computer Science 2007-07-13 Constanza Riera , Matthew G. Parker

The partition function $pod(n)$ enumerates the partitions of $n$ wherein odd parts are distinct and even parts are unrestricted. Recently, a number of properties for $pod(n)$ have been established. In this paper, for $k\in\{0,2\}$ we…

Combinatorics · Mathematics 2022-10-26 Cristina Ballantine , Mircea Merca

We establish a theory of NC functions on a class of von Neumann algebras with a particular direct sum property, e.g. $B(\mathcal{H})$. In contrast to the theory's origins, we do not rely on appealing to results from the matricial case. We…

Operator Algebras · Mathematics 2021-07-29 Meric Augat , John E. McCarthy

We give a definition of some classes of boolean algebras generalizing free boolean algebras; they satisfy a universal property that certain functions extend to homomorphisms. We give a combinatorial property of generating sets of these…

Logic · Mathematics 2011-10-04 Corey Thomas Bruns

Bent functions are Boolean functions that are maximally nonlinear. They can be represented as bent squares, i.e., square matrices for which each row and each column is the Walsh spectrum of a Boolean function. Using this representation, it…

Combinatorics · Mathematics 2025-09-09 Jan Kristian Haugland

Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. The representation function $R_{A,k}(n)$ for the set $A$ is the number of representations of a nonnegative integer $n$ as the sum of $k$ terms from $A$. Let $A(n)$…

Number Theory · Mathematics 2023-03-03 Sándor Z. Kiss , Csaba Sándor , Quan-Hui Yang

Noncommutative functions are graded functions between sets of square matrices of all sizes over two vector spaces that respect direct sums and similarities. They possess very strong regularity properties (reminiscent of the regularity…

Functional Analysis · Mathematics 2020-05-20 Dmitry Kaliuzhnyi-Verbovetskyi , Leonard Stevenson , Victor Vinnikov

Negabent Boolean functions are defined by having a flat magnitude spectrum under the nega-Hadamard transform. They exist in both even and odd dimensions, and the subclass of functions that are simultaneously bent and negabent…

Neural and Evolutionary Computing · Computer Science 2026-02-03 Claude Carlet , Marko Ðurasevic , Ermes Franch , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

The $n$th partial sum of an analytic function $f(z)=z+\sum_{k=2}^\infty a_k z^k$ is the polynomial $f_n(z):=z+\sum_{k=2}^n a_k z^k$. A survey of the univalence and other geometric properties of the $n$th partial sum of univalent functions…

Complex Variables · Mathematics 2012-07-19 V. Ravichandran

We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…

Number Theory · Mathematics 2022-06-15 Marco Aymone , Caio Bueno , Kevin Medeiros

We study recursively defined functions associated with directed graphs on the k dimensional nonnegative integral lattice. The existence of certain combinatorial structures associated with these function classes are shown to be independent…

Combinatorics · Mathematics 2017-08-29 S. Gill Williamson

A nowhere-zero $k$-flow on a graph $\Gamma$ is a mapping from the edges of $\Gamma$ to the set $\{\pm1, \pm2, ..., \pm(k-1)\} \subset \bbZ$ such that, in any fixed orientation of $\Gamma$, at each node the sum of the labels over the edges…

Combinatorics · Mathematics 2007-05-25 Matthias Beck , Thomas Zaslavsky

Alon's combinatorial Nullstellensatz (Theorem 1.1 from \cite{Alon1}) is one of the most powerful algebraic tools in combinatorics, with a diverse array of applications. Let $\F$ be a field, $S_1,S_2,..., S_n$ be finite nonempty subsets of…

Combinatorics · Mathematics 2011-09-26 Géza Kós , Lajos Rónyai