English
Related papers

Related papers: Refutations of pebble minimization via output lang…

200 papers

In this paper we investigate regularity properties of weak solutions to a PDE system that arises in the study of biological transport networks. The system consists of a possibly singular elliptic equation for the scalar pressure of the…

Analysis of PDEs · Mathematics 2018-01-03 Jian-Guo Liu , Xiangsheng Xu

Notions of a "holomorphic" function theory for functions of a split-quaternionic variable have been of recent interest. We describe two found in the literature and show that one notion encompasses a small class of functions, while the other…

Complex Variables · Mathematics 2015-06-25 John A. Emanuello , Craig A. Nolder

Let $k$ be an algebraically closed field of characteristic zero and $P(x,y)\in k[x,y]$ be a polynomial which depends on all its variables. $P$ has an algebraic constraint if the set $\{(P(a,b),(P(a',b'),P(a',b),P(a,b')\,|\,a,a',b,b'\in k\}$…

Logic · Mathematics 2015-06-25 Elad Levi

Given a property of Boolean functions, what is the minimum number of queries required to determine with high probability if an input function satisfies this property or is "far" from satisfying it? This is a fundamental question in Property…

Data Structures and Algorithms · Computer Science 2016-01-13 Noga Alon , Rani Hod , Amit Weinstein

A way to construct and classify the three dimensional polynomially deformed algebras is given and the irreducible representations is presented. for the quadratic algebras 4 different algebras are obtained and for cubic algebras 12 different…

Mathematical Physics · Physics 2007-05-23 Bindu A. Bambah

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Commutative Algebra · Mathematics 2021-10-07 H. Al-Ezeh , A. A. Al-Maktry , S. Frisch

Multimodular functions, primarily used in the literature of queueing theory, discrete-event systems, and operations research, constitute a fundamental function class in discrete convex analysis. The objective of this paper is to clarify the…

Optimization and Control · Mathematics 2019-06-25 Satoko Moriguchi , Kazuo Murota

Using polarity, we give an outer polyhedral approximation for the epigraph of set functions. For a submodular function, we prove that the corresponding polar relaxation is exact; hence, it is equivalent to the Lov\'asz extension. The polar…

Optimization and Control · Mathematics 2020-12-09 Alper Atamturk , Vishnu Narayanan

The theory of slice regular functions of a quaternionic variable extends the notion of holomorphic function to the quaternionic setting. This theory, already rich of results, is sometimes surprisingly different from the theory of…

Complex Variables · Mathematics 2014-04-14 Graziano Gentili , Giulia Sarfatti

This article offers a comprehensive treatment of polynomial functional regression, culminating in the establishment of a novel finite sample bound. This bound encompasses various aspects, including general smoothness conditions, capacity…

Numerical Analysis · Mathematics 2024-05-08 Markus Holzleitner , Sergei Pereverzyev

Given an automaton (a letter-to-letter transducer, a dynamical 1-Lipschitz system on the space $\mathbb Z_p$ of $p$-adic integers) $\mathfrak A$ whose input and output alphabets are $\mathbb F_p=\{0,1,\ldots,p-1\}$, one visualizes word…

Dynamical Systems · Mathematics 2015-02-09 Vladimir Anashin

The Polyak-{\L}ojasiewicz (P{\L}) inequality extends the favorable optimization properties of strongly convex functions to a broader class of functions. In this paper, we prove a theorem (also obtained by Criscitiello, Rebjock and Boumal in…

Optimization and Control · Mathematics 2026-01-19 Aziz Ben Nejma

In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are…

Information Theory · Computer Science 2011-11-02 Emily J. King

Relations between the decision tree complexity and various other complexity measures of Boolean functions is a thriving topic of research in computational complexity. It is known that decision tree complexity is bounded above by the cube of…

Computational Complexity · Computer Science 2022-09-19 Rahul Chugh , Supartha Podder , Swagato Sanyal

Pebble games are single-player games on DAGs involving placing and moving pebbles on nodes of the graph according to a certain set of rules. The goal is to pebble a set of target nodes using a minimum number of pebbles. In this paper, we…

Computational Complexity · Computer Science 2018-07-16 Erik D. Demaine , Quanquan C. Liu

Bounded holomorphic interpolation problems associated to finitely many data have, in general, distinct solutions. Uniqueness arises only in some convex extreme configurations. Rational inner functions in a polydisk are the best understood…

Functional Analysis · Mathematics 2025-09-23 Mainak Bhowmik , Mihai Putinar

We introduce $(k,l)$-regular maps, which generalize two previously studied classes of maps: affinely $k$-regular maps and totally skew embeddings. We exhibit some explicit examples and obtain bounds on the least dimension of a Euclidean…

Differential Geometry · Mathematics 2007-05-23 Gordana Stojanovic

Given any square matrix or a bounded operator $A$ in a Hilbert space such that $p(A)$ is normal (or similar to normal), we construct a Banach algebra, depending on the polynomial $p$, for which a simple functional calculus holds. When the…

Functional Analysis · Mathematics 2015-06-03 Olavi Nevanlinna

We conjecture that a class of Artinian Gorenstein Hilbert algebras called full Perazzo algebras always have minimal Hilbert function, fixing codimension and length. We prove the conjecture in length four and five, in low codimension. We…

Algebraic Geometry · Mathematics 2024-05-13 Lenin Bezerra , Rodrigo Gondim , Giovanna Ilardi , Giuseppe Zappalà

Consider an algebraic function like $F(x) = \sqrt{x^3 - 1}$. If $p \in \mathbb{Q}$ is a rational number, how many iterates of $p$ under $F$ can also be rational? The dynamics of algebraic functions may be formalized in the language of…

Number Theory · Mathematics 2026-05-07 Trevor Hyde