Related papers: Generalized cofactors and decomposition of Boolean…
The main objective of this study is to investigate the existence and forms of solutions of systems of general quadratic functional equations in $\mathbb{C}^n$. By utilizing Nevanlinna theory in $\mathbb{C}^n$, we explore the existence and…
The main purpose of this paper is to introduce and investigate a class of generalized Bernoulli polynomials and Euler polynomials based on the generating function. we unify all forms of q-exponential functions by one more parameter. we…
In this paper we establish some bounds on the complexity of disjunctive normal forms of boolean function from narrow subclasses (e.g. functions takes value 0 in a limited number of points). The bounds are obtained by reduction the initial…
Hooley proved that if $f\in \Bbb Z [X]$ is irreducible of degree $\ge 2$, then the fractions $\{ r/n\}$, $0<r<n$ with $f(r)\equiv 0\pmod n$, are uniformly distributed in $(0,1)$. In this paper we study such problems for reducible…
New results regarding the Sobolev regularity of the principal solution of the linear Beltrami equation $\bar{\partial} f = \mu \partial f + \nu \overline{\partial f}$ for discontinuous Beltrami coefficients $\mu$ and $\nu$ are obtained,…
Church-Ellenberg-Farb used the language of FI-modules to prove that the cohomology of certain sequences of hyperplane arrangements with S_n-actions satisfies representation stability. Here we lift their results to the level of the…
Let $\mathcal{F}\subset\mathcal{M}(D)$ and let $a, b$ and $c$ be three distinct complex numbers. If, there exist a holomorphic function $h$ on $D$ and a positive constant $\rho$ such that for each $f\in\mathcal{F},$ $f$ and $f^{'}$…
The Boolean Satisfiability (SAT) problem is the canonical NP-complete problem and is fundamental to computer science, with a wide array of applications in planning, verification, and theorem proving. Developing and evaluating practical SAT…
We study subordination of free convolutions. We prove that for free random variables $X,Y$ and a Borel function $f$ the conditional expectation $E_\varphi\left[ (z-X-f(X)Yf^*(X))^{-1}| X\right]$, is a resolvent again. This result allows…
Statistical learning on biological data can be challenging due to confounding variables in sample collection and processing. Confounders can cause models to generalize poorly and result in inaccurate prediction performance metrics if models…
Dependency Quantified Boolean Formulas (DQBF) generalize QBF by explicitly specifying which universal variables each existential variable depends on, instead of relying on a linear quantifier order. The satisfiability problem of DQBF is…
This paper extends a stability estimate of the Sobolev Inequality established by G. Bianchi and H. Egnell in their paper "A note on the Sobolev Inequality." Bianchi and Egnell's Stability Estimate answers the question raised by H. Brezis…
In this work, we consider the problem of goodness-of-fit (GoF) testing for parametric models. This testing problem involves a composite null hypothesis, due to the unknown values of the model parameters. In some special cases, co-sufficient…
We present a theoretical model that fully supports the recently disclosed generalized droop formula (GDF) for calculating the signal-to-noise ratio (SNR) of constant-output power (COP) amplified dispersion-uncompensated coherent links…
In this paper, we present a new, graph-based modeling approach and a polynomial-sized linear programming (LP) formulation of the Boolean satisfiability problem (SAT). The approach is illustrated with a numerical example.
Solving Singularly Perturbed Differential Equations (SPDEs) poses computational challenges arising from the rapid transitions in their solutions within thin regions. The effectiveness of deep learning in addressing differential equations…
We prove that the Fisher information is monotone decreasing in time along solutions of the space-homogeneous Boltzmann equation for a large class of collision kernels covering all classical interactions derived from systems of particles.…
Boolean satisfiability ({\SAT}) has played a key role in diverse areas spanning testing, formal verification, planning, optimization, inferencing and the like. Apart from the classical problem of checking boolean satisfiability, the…
We solve the boson normal ordering problem for (q(a*)a + v(a*))^n with arbitrary functions q and v and integer n, where a and a* are boson annihilation and creation operators, satisfying [a,a*]=1. This leads to exponential operators…
We present a computational and statistical approach for fitting isotonic models under convex differentiable loss functions. We offer a recursive partitioning algorithm which provably and efficiently solves isotonic regression under any such…