English
Related papers

Related papers: Low Ambiguity in Strong, Total, Associative, One-W…

200 papers

We prove that every smooth closed manifold admits a smooth real-valued function with only two critical values. We call a function of this type a \emph{Reeb function}. We prove that for a Reeb function we can prescribe the set of minima (or…

Geometric Topology · Mathematics 2025-06-02 Antonio Lerario , Chiara Meroni , Daniele Zuddas

We investigate uniform ergodic type theorems for additive and subadditive functions on a subshift over a finite alphabet. We show that every strictly ergodic subshift admits a uniform ergodic theorem for Banach-space-valued additive…

Dynamical Systems · Mathematics 2007-05-23 Daniel Lenz

In 2007, Carlet and Ding introduced two parameters, denoted by $Nb_F$ and $NB_F$, quantifying respectively the balancedness of general functions $F$ between finite Abelian groups and the (global) balancedness of their derivatives $D_a…

Information Theory · Computer Science 2023-05-11 Shihui Fu , Xiutao Feng , Qiang Wang , Claude Carlet

The universal approximation theorem is generalised to uniform convergence on the (noncompact) input space $\mathbb{R}^n$. All continuous functions that vanish at infinity can be uniformly approximated by neural networks with one hidden…

Machine Learning · Computer Science 2024-03-05 Teun D. H. van Nuland

A finite unary algebra $(A,F)$ has only countably many countable subdirect powers if and only if every operation $f\in F$ is either a permutation or a constant mapping.

Rings and Algebras · Mathematics 2023-07-11 Nik Ruskuc , Bill de Witt

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

Logic · Mathematics 2014-10-16 Robin Hirsch , Marcel Jackson , Szabolcs Mikulás

We discuss avoidance of sure loss and coherence results for semicopulas and standardized functions, i.e., for grounded, 1-increasing functions with value $1$ at $(1,1,\ldots, 1)$. We characterize the existence of a $k$-increasing…

Secure function evaluation is a two-party cryptographic primitive where Bob computes a function of Alice's and his respective inputs, and both hope to keep their inputs private from the other party. It has been proven that perfect (or near…

Quantum Physics · Physics 2022-03-17 Sarah Osborn , Jamie Sikora

We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious transfer (QOT), which is known to suffice for secure computation of arbitrary quantum functionalities. Furthermore, our construction only makes black-box…

Quantum Physics · Physics 2024-08-06 James Bartusek , Andrea Coladangelo , Dakshita Khurana , Fermi Ma

Let $\M$ be a complete, connected noncompact manifold with bounded geometry. Under a condition near infinity, we prove that the Log Sobolev functional (\ref{logfanhan}) has an extremal function decaying exponentially near infinity. We also…

Differential Geometry · Mathematics 2011-05-10 Qi S. Zhang

A function of two variables F(x,y)is universal iff for every other function G(x,y) there exists functions h(x) and k(y) with G(x,y) = F(h(x),k(y)) Sierpinski showed that assuming the continuum hypothesis there exists a Borel function F(x,y)…

Logic · Mathematics 2012-04-25 Paul B. Larson , Arnold W. Miller , Juris Steprans , William A. R. Weiss

Let $F_{BC}(\lambda,k;t)$ be the Heckman-Opdam hypergeometric function of type BC with multiplicities $k=(k_1,k_2,k_3)$ and weighted half sum $\rho(k)$ of positive roots. We prove that $F_{BC}(\lambda+\rho(k),k;t)$ converges for…

Classical Analysis and ODEs · Mathematics 2013-10-14 Margit Rösler , Tom Koornwinder , Michael Voit

We present a class of hardware-based cryptographic one-way functions that, in practice, would be hard to invert even if P=NP and linear-time satisfiability algorithms exist. Such functions use a hardware-based component with omega(n^2) size…

Computational Complexity · Computer Science 2016-10-25 Javier A. Arroyo-Figueroa

One-way functions (OWFs) form the foundation of modern cryptography, yet their unconditional existence remains a major open question. In this work, we study this question by exploring its relation to lossy reductions, i.e., reductions $R$…

Cryptography and Security · Computer Science 2025-07-01 Pouria Fallahpour , Alex B. Grilo , Garazi Muguruza , Mahshid Riahinia

We show that there exist unbounded functionals on the spaces of sequences that take at most one nonzero value on an arbitrary family of elements whose supports are pairwise disjoint.

Functional Analysis · Mathematics 2025-12-09 Konstantin Storozhuk

A fundamental open question asking whether all real-valued strongly quasiconvex functions defined on $\mathbb R^n$ are necessarily continuous, akin to their convex counterparts, is answered in detail in this paper. Among other things, we…

Optimization and Control · Mathematics 2025-12-04 Nguyen Thi Van Hang , Felipe Lara , Nguyen Dong Yen

We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…

General Mathematics · Mathematics 2025-07-08 Stanislav Semenov

We study in detail the one-variable local theory of functions holomorphic over a finite-dimensional commutative associative unital $\mathbb{C}$-algebra $\mathcal{A}$, showing that it shares a multitude of features with the classical…

Complex Variables · Mathematics 2019-01-03 Marin Genov

Any two-way finite state automaton is equivalent to some one-way finite state automaton. This well-known result, shown by Rabin and Scott and independently by Shepherdson, states that two-way finite state automata (even non-deterministic)…

Formal Languages and Automata Theory · Computer Science 2013-04-29 Emmanuel Filiot , Olivier Gauwin , Pierre-Alain Reynier , Frédéric Servais

In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism. Yet, we prove that the conversion of an unambiguous…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Vincent Carnino , Sylvain Lombardy