Related papers: Algebraic Methods in Difference Sets and Bent Func…
We introduce symmetrizing operators of the polynomial ring $A[x]$ in the varible $x$ over a ring $A$. When $A$ is an algebra over a field $k$ these operators are used to characterize the monic polynomials $F(x)$ of degree $n$ in $A[x]$ such…
In this paper some classes of local polynomial functions on abelian groups are characterized by the properties of their variety. For this characterization we introduce a numerical quantity depending on the variety of the local polynomial…
Given a function from $\mathbb{Z}_n$ to itself one can determine its polynomial representability by using Kempner function. In this paper we present an alternative characterization of polynomial functions over $\mathbb{Z}_n$ by constructing…
The paper deals with different properties of polynomials in random elements: bounds for characteristics functionals of polynomials, stochastic generalization of the Vinogradov mean value theorem, characterization problem, bounds for…
We consider hilbert spaces of holomorphic functions in Cartan domains (in particular in ball and polydisk) and operator of restriction of holomorphic function to a submanifold in Shilov boundary. We discuss conditions when this operator…
We introduce a method for constructing collections of subsets of $\mathbb{R}^{n}$, using an iterated function system, a set $T,$ and a cost function. We refer to these collections as tilings. The special case where $T$ is the central open…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
Boolean functions with strong cryptographic properties, such as high nonlinearity and algebraic degree, are important for the security of stream and block ciphers. These functions can be designed using algebraic constructions or…
In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types…
In this paper we explore a connection between certain Almost Perfect Nonlinear Functions (APN functions) and relative difference sets. In particular, we show that the image set of certain 2-to-1 APN functions is a relative difference set.…
We generalize and unify the proofs of several results on algebraic in- dependence of arithmetic functions and Dirichlet series by a theorem of Ax on differential Schanuel conjecture. Along the way, we find counter-examples to some results…
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…
Bell's theorem for systems more complicated than two qubits faces a hidden, as yet undiscussed, problem. One of the methods to derive Bell's inequalities is to assume existence of joint probability distribution for measurement results for…
In this paper we revisit the work of E.T. Bell concerning partition polynomials in order to introduce the reciprocal partition polynomials. We give their explicit formulas and apply the result to compute closed formulae for some well-known…
We give a number new examples analytically and numerically to confirm the Kohler conjecture. It turned out that for a rather large class of nonnegative functions the equality (A) hold.
In this paper we present a method of characteristic sets for inversive difference polynomials and apply it to the analysis of systems of quasi-linear algebraic difference equations. We describe characteristic sets and compute difference…
Borel-fixed ideals play a key role in the study of Hilbert schemes. Indeed each component and each intersection of components of a Hilbert scheme contains at least one Borel-fixed point, i.e. a point corresponding to a subscheme defined by…
Inspired by nonstandard analysis, we define and study internal subsets and internal functions in algebras of Colombeau generalized functions. We prove a saturation principle for internal sets and provide applications to Colombeau algebras.
In the present paper, new classes of wavelet functions are presented in the framework of Clifford analysis. Firstly, some classes of orthogonal polynomials are provided based on 2-parameters weight functions. Such classes englobe the well…
We give a bracket polynomial expression for intermediate terms between discriminant and resultant for pair of binary forms. As an application of the bracket polynomial expression, we give an algebraic proof of the algebraic independence of…