Related papers: On the generalized numerical criterion
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
A mixed type dual to a nondifferentiable variational problem involving higher order derivative is formulated and duality results are proved under generalized invexity conditions. Special cases are generated from our results.
In this note we show that the only result of [Rocky Mountain J. Math. 54 (2024), no. 4, 995--1004] is nothing more than a misformulated version of an exercise from classical texts, presented with a flawed proof. To place the matter on…
In this paper, we will present some results on the counterfeit coins problem in the case of multi-sets.
We establish a number of foundational results on Poincar\'e spaces which result in several applications. One application settles an old conjecture of C.T.C. Wall in the affirmative. Another result shows that for any natural number n, there…
In this paper, we present various inequalities for generalized numerical radius of $2 \times 2$ block matrices for Schatten p-norm. Moreover, we give a refinement of the triangle inequality for the Schatten p-generalized numerical radius.
We consider problems of rating alternatives based on their pairwise comparison under various assumptions, including constraints on the final scores of alternatives. The problems are formulated in the framework of tropical mathematics to…
In [2] we show how to construct information sets for Reed-Muller codes only in terms of their basic parameters. In this work we deal with the corresponding problem for q-ary Generalized Reed-Muller codes of first and second order. We see…
In this short note, we find an equivalent combinatorial condition only involving finite sums under which a centered Gaussian random vector with multinomial covariance matrix satisfies the Gaussian product inequality (GPI) conjecture. These…
We consider the popular matching problem in a roommates instance with strict preference lists. While popular matchings always exist in a bipartite instance, they need not exist in a roommates instance. The complexity of the popular matching…
We prove inequalities on non-integer powers of products of generalized matrices functions on the sum of positive semi-definite matrices. For example, for any real number $r \in \{1\} \cup [2, \infty)$, positive semi-definite matrices $A_i,\…
We study the correlations of pairs of logarithms of positive integers at various scalings, either with trivial weigths or with weights given by the Euler function, proving the existence of pair correlation functions. We prove that at the…
Extending the theory of systems, we introduce a theory of Lie semialgebra ``pairs'' which parallels the classical theory of Lie algebras, but with a ``null set'' replacing $0$. A selection of examples is given. These Lie pairs comprise two…
In this paper we consider $N$, the number of solutions $(x,y,u,v)$ to the equation $ (-1)^u r a^x + (-1)^v s b^y = c$ in nonnegative integers $x, y$ and integers $u, v \in \{0,1\}$, for given integers $a>1$, $b>1$, $c>0$, $r>0$ and $s>0$.…
In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…
In software testing, the large size of the input domain makes exhaustively testing the inputs a daunting and often impossible task. Pair-wise testing is a popular approach to combinatorial testing problems. This paper reviews Pair-wise…
It is a classical result that the absolute value of any $k$-minor of an $r\times s$ real or complex matrix is bounded by the product of its first $k$ singular values. We generalize this statement to the context of real or complex simple…
An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…
We study sets of integers that can be defined by the vanishing of a generalised polynomial expression. We show that this includes sets of values of linear recurrent sequences of Salem type and some linear recurrent sequences of Pisot type.…
Elimination of quantifiers is shown to fail dramatically for a group of well-known mathematical theories (classically enjoying the property) against a wide range of relevant logical backgrounds. Furthermore, it is suggested that only by…