English
Related papers

Related papers: Complete Log Concavity of Coverage-Like Functions

200 papers

We show that the likelihood function for a multinomial vector observed under arbitrary interval censoring constraints on the frequencies or their partial sums is completely log-concave by proving that the constrained sample spaces comprise…

Statistics Theory · Mathematics 2023-11-07 Bruce Levin , Erik Learned-Miller

The Boros-Moll polynomials $P_m(a)$ arise in the evaluation of a quartic integral. It has been conjectured by Boros and Moll that these polynomials are infinitely log-concave. In this paper, we show that $P_m(a)$ is 2-log-concave for any…

Combinatorics · Mathematics 2010-10-05 William Y. C. Chen , Ernest X. W. Xia

In this paper we extend some notions, previously defined for log-concave functions, to the larger domain of so-called {\alpha}-concave functions. We begin with a detailed discussion of support functions - first for log-concave functions,…

Functional Analysis · Mathematics 2012-10-17 Liran Rotem

In this paper we study the representation of Morse polynomial functions which are nonnegative on a compact basic closed semi-algebraic set in $\mathbb R^n$, and having only finitely many zeros in this set. Following C. Bivi\`{a}-Ausina, we…

Algebraic Geometry · Mathematics 2019-02-19 Công-Trình Lê

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

Classical Analysis and ODEs · Mathematics 2023-05-31 Marcel de Jeu

Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…

Machine Learning · Computer Science 2016-02-24 Francis Bach

We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…

Computational Complexity · Computer Science 2025-04-01 Stepan Margaryan

We present two new classes of orthogonal functions, log orthogonal functions (LOFs) and generalized log orthogonal functions (GLOFs), which are constructed by applying a $\log$ mapping to Laguerre polynomials. We develop basic approximation…

Numerical Analysis · Mathematics 2020-03-04 Sheng Chen , Jie Shen

In this note, we give a rank function axiomatization for delta-matroids and study the corresponding rank generating function. We relate an evaluation of the rank generating function to the number of independent sets of the delta-matroid,…

Combinatorics · Mathematics 2025-02-05 Matt Larson

Holomorphic almost modular forms are holomorphic functions of the complex upper half plane which can be approximated arbitrarily well (in a suitable sense) by modular forms of congruence subgroups of large index in $\SL(2,\ZZ)$. It is…

Number Theory · Mathematics 2010-05-21 Jens Marklof

Polynomial sequence ${P_m}_{m\geq0}$ is $q$-logarithmically concave if $P_{m}^2-P_{m+1}P_{m-1}$ is a polynomial with nonnegative coefficients for any $m\geq{1}$. We introduce an analogue of this notion for formal power series whose…

Classical Analysis and ODEs · Mathematics 2012-11-15 S. I. Kalmykov , D. B. Karp

We study seminormalization of affine complex varieties. We show that polynomials on the seminormalization correspond to the rational functions which are continuous for the Euclidean topology. We further study this type of functions which…

Algebraic Geometry · Mathematics 2022-04-08 François Bernard

Euler's gamma function is logarithmically convex on positive semi-axis. Additivity of logarithmic convexity implies that the function sum of gammas with non-negative coefficients is also log-convex. In this paper we investigate the series…

Classical Analysis and ODEs · Mathematics 2012-06-22 S. I. Kalmykov , D. B. Karp

In this brief note, it is shown that the function p^TW log(p) is convex in p if W is a diagonally dominant positive definite M-matrix. The techniques used to prove convexity are well-known in linear algebra and essentially involves…

Optimization and Control · Mathematics 2025-01-06 Shravan Mohan

Morphisms of matroids are combinatorial abstractions of linear maps and graph homomorphisms. We introduce the notion of basis for morphisms of matroids, and show that its generating function is strongly log-concave. As a consequence, we…

Combinatorics · Mathematics 2020-04-02 Christopher Eur , June Huh

We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. We refer to this permutation as a submodular order.…

Optimization and Control · Mathematics 2024-03-01 Rajan Udwani

Classes of set functions along with a choice of ground set are a bedrock to determine and develop corresponding variants of greedy algorithms to obtain efficient solutions for combinatorial optimization problems. The class of approximate…

Optimization and Control · Mathematics 2021-08-20 Praneeth Vepakomma , Yulia Kempner , Ramesh Raskar

We study the equivariant cohomology classes of torus-equivariant subvarieties of the space of matrices. For a large class of torus actions, we prove that the polynomials representing these classes (up to suitably changing signs) are…

Algebraic Geometry · Mathematics 2024-12-06 Yairon Cid-Ruiz , Yupeng Li , Jacob P. Matherne

In this work, using Moreau envelopes, we define a complete metric for the set of proper lower semicontinuous convex functions. Under this metric, the convergence of each sequence of convex functions is epi-convergence. We show that the set…

Optimization and Control · Mathematics 2015-07-28 Chayne Planiden , Xianfu Wang

A Ringel ladder can be formed by a self-bar-amalgamation operation on a symmetric ladder, that is, by joining the root vertices on its end-rungs. The present authors have previously derived criteria under which linear chains of copies of…

Combinatorics · Mathematics 2015-01-27 J. L. Gross , T. Mansour , T. W. Tucker , D. G. L. Wang