Related papers: Three New Families of Zero-difference Balanced Fun…
In the present paper, the concept of contraction has been extended in a refined manner by introducing $\mathfrak{D}$-Contraction defined on a family $\mathfrak{F}$ of bounded functions. Also, a new notion of fixed function has been…
Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…
For nearly a century, mathematicians have been developing techniques for constructing abelian automorphism groups of combinatorial objects, and, conversely, constructing combinatorial objects from abelian groups. While abelian groups are a…
We address the problem of finding optimal strategies for computing Boolean symmetric functions. We consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and we…
Strong difference families are an interesting class of discrete structures which can be used to derive relative difference families. Relative difference families are closely related to $2$-designs, and have applications in constructions for…
We develop a family of stabilized backward differentiation formula (sBDF) schemes of orders one through four for semilinear parabolic equations. The proposed methods are designed to achieve three properties that are rarely available…
In 2009, the first author introduced a new class of zeta functions, called `distance zeta functions', associated with arbitrary compact fractal subsets of Euclidean spaces of arbitrary dimension. It represents a natural, but nontrivial…
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact combinational logic circuit synthesizer is described as a…
This paper presents a new approach for guaranteed safety subject to input constraints (e.g., actuator limits) using a composition of multiple control barrier functions (CBFs). First, we present a method for constructing a single CBF from…
Finding Boolean functions suitable for cryptographic primitives is a complex combinatorial optimization problem, since they must satisfy several properties to resist cryptanalytic attacks, and the space is very large, which grows super…
By means of a digit function that has been introduced in a recent formulation of classical and quantum mechanics, we provide a new construction of some infinite families of finite groups, both abelian and nonabelian, of importance for…
We present the Multi-Block DC (BDC) class, a rich class of structured nonconvex functions that admit a DC ("difference-of-convex") decomposition across parameter blocks. This multi-block class not only subsumes the usual DC programming, but…
In this paper, we define and study four families of Berndt-type integrals, called mixed Berndt-type integrals, which contain (hyperbolic) sine and cosine functions in the integrand function. Using contour integration, these integrals are…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
Boolean function bi-decomposition is ubiquitous in logic synthesis. It entails the decomposition of a Boolean function using two-input simple logic gates. Existing solutions for bi-decomposition are often based on BDDs and, more recently,…
This paper presents a new data structure, called \emph{Weighted Context-Free-Language Ordered BDDs} (WCFLOBDDs), which are a hierarchically structured decision diagram, akin to Weighted BDDs (WBDDs) enhanced with a procedure-call mechanism.…
The noncommutative space $\mathbb{R}^3_\lambda$, a deformation of $\mathbb{R}^3$, supports a $3$-parameter family of gauge theory models with gauge-invariant harmonic term, stable vacuum and which are perturbatively finite to all orders.…
The special uniformity of zeta functions claims that pure non-abelian zeta functions coincide with group zeta functions associated to the special linear groups. Naturally associated are three aspects, namely, the analytic, arithmetic, and…
We develop summation by parts (SBP) approach for generating high-order finite-difference schemes on the interval and propose new sets of schemes up to the 12th order. The coefficients of the schemes are governed by values of grid spacing…
Perfect codes are arguably the most fascinating structures in combinatorial coding theory, and their classification and weight distribution are of considerable interest. This classification also involves the analysis of some related…