English
Related papers

Related papers: A Simplification Method of Polymorphic Boolean Fun…

200 papers

We define a modular function which is a generalization of the elliptic modular lambda function. We show this function and the modular invariant function generate the modular function field with respect to the principal congruence subgroup.…

Number Theory · Mathematics 2015-04-21 Noburo Ishii

Variational methods are used to calculate structural and thermodynamical properties of a titrating polyelectrolyte in a discrete representation. The Coulomb interactions are emulated by harmonic repulsive forces, the force constants being…

chem-ph · Physics 2008-02-03 B. Jönsson , M. Ullner , C. Peterson , O. Sommelius , B. Söderberg

In fields such as mining, search and rescue, and archaeological exploration, ensuring real-time, collision-free navigation of robots in confined, cluttered environments is imperative. Despite the value of established path planning…

Robotics · Computer Science 2024-03-28 Manan Tayal , Shishir Kolathaya

We introduce a class of functions which constitutes an obvious elliptic generalization of multiple polylogarithms. A subset of these functions appears naturally in the \epsilon-expansion of the imaginary part of the two-loop massive sunrise…

High Energy Physics - Phenomenology · Physics 2018-03-14 Ettore Remiddi , Lorenzo Tancredi

By a symbolic method, we introduce multivariate Bernoulli and Euler polynomials as powers of polynomials whose coefficients involve multivariate L\'evy processes. Many properties of these polynomials are stated straightforwardly thanks to…

Combinatorics · Mathematics 2012-04-04 E. Di Nardo , I. Oliva

Rotation symmetric Boolean functions represent an interesting class of Boolean functions as they are relatively rare compared to general Boolean functions. At the same time, the functions in this class can have excellent properties, making…

Neural and Evolutionary Computing · Computer Science 2023-11-21 Claude Carlet , Marko Ðurasevic , Bruno Gašperov , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

We study Boolean circuits as a representation of Boolean functions and consider different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all…

Computational Complexity · Computer Science 2015-07-01 Elmar Böhler , Nadia Creignou , Matthias Galota , Steffen Reith , Henning Schnoor , Heribert Vollmer

Buildup and switching mechanisms of solitons in complex nonlinear systems are fundamentally important dynamical regimes. Using a novel strongly nonlinear optical system,the work reveals a new buildup scenario for soliton molecules , which…

We present a review of the symbol map, a mathematical tool that can be useful in simplifying expressions among multiple polylogarithms, and recall its main properties. A recipe is given for how to obtain the symbol of a multiple…

Mathematical Physics · Physics 2015-05-30 Claude Duhr , Herbert Gangl , John R. Rhodes

Phase space of General Relativity is extended to a Poisson manifold by inclusion of the determinant of the metric and conjugate momentum as additional independent variables. As a result, the action and the constraints take a polynomial…

General Relativity and Quantum Cosmology · Physics 2009-11-11 M. O. Katanaev

Phosphorene and its components are highly reactive to oxygen when exposed to ambient conditions due to the presence of lone pairs of electrons on phosphorus atoms. Functionalization serves as a solution to prevent the chemical degradation…

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

Rings and Algebras · Mathematics 2012-02-20 Miguel Couceiro , Jean-Luc Marichal

The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is…

Computational Complexity · Computer Science 2021-01-01 Christian Ikenmeyer , Balagopal Komarath , Christoph Lenzen , Vladimir Lysikov , Andrey Mokhov , Karteek Sreenivasaiah

In the present paper, multiscale systems of polynomial wavelets on an n-dimensional sphere are constructed. Scaling functions and wavelets are investigated,and their reproducing and localization properties and positive definiteness are…

Classical Analysis and ODEs · Mathematics 2018-04-10 Ilona Iglewska-Nowak

In the present paper the two and three point functions which occur at the study of the various physical processes are considered. The investigation has dan in the framework of the perturbative theory at the one loop level. The general and…

High Energy Physics - Phenomenology · Physics 2007-05-23 G. G. Devidze , G. R. Jibuti

We use functions of a bicomplex variable to unify the existing constructions of harmonic morphisms from a 3-dimensional Euclidean or pseudo-Euclidean space to a Riemannian or Lorentzian surface. This is done by using the notion of…

Differential Geometry · Mathematics 2010-03-12 Paul Baird , John C. Wood

The nonlinearity of a Boolean function is a key property in deciding its suitability for cryptographic purposes, e.g. as a combining function in stream ciphers, and so the nonlinearity computation is an important problem for applications.…

Information Theory · Computer Science 2016-10-20 Emanuele Bellini , Teo Mora , Massimiliano Sala

The union of the particles of a stationary Poisson process of compact (convex) sets in Euclidean space is called Boolean model and is a classical topic of stochastic geometry. In this paper, Boolean models in hyperbolic space are…

Probability · Mathematics 2024-08-08 Daniel Hug , Günter Last , Matthias Schulte

Motivated by existing results, we present some completely monotonic functions involving the polygamma functions.

Classical Analysis and ODEs · Mathematics 2010-12-03 Peng Gao

Chaotic functions are characterized by sensitivity to initial conditions, transitivity, and regularity. Providing new functions with such properties is a real challenge. This work shows that one can associate with any Boolean network a…

Discrete Mathematics · Computer Science 2011-12-08 J. M. Bahi , J. -F. Couchot , C. Guyeux , A. Richard