中文
相关论文

相关论文: Restricted Holant Dichotomy on Domains 3 and 4

200 篇论文

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

计算机科学中的逻辑 · 计算机科学 2007-12-11 Klaus Aehlig , Arnold Beckmann

In sphere of research of discrete optimization algorithms efficiency the important place occupies a method of polynomial reducibility of some problems to others with use of special purpose components. In this paper a novel method of compact…

数据结构与算法 · 计算机科学 2013-09-25 V. F. Romanov

Given two finite abstract simplicial complexes A and B, one can define a new simplicial complex on the set of simplicial maps from A to B. After adding two technicalities, we call this complex Homsc(A, B). We prove the following dichotomy:…

一般拓扑 · 数学 2024-08-16 Sebastian Meyer

In computational complexity, a complexity class is given by a set of problems or functions, and a basic challenge is to show separations of complexity classes $A \not= B$ especially when $A$ is known to be a subset of $B$. In this paper we…

交换代数 · 数学 2017-04-10 Greg Yang

We construct a transcendental entire $f:\mathbb{C}\rightarrow\mathbb{C}$ such that (1) $f$ has bounded singular set, (2) $f$ has a wandering domain, and (3) each singular value of $f$ escapes to infinity under iteration by $f$.

动力系统 · 数学 2021-01-20 Kirill Lazebnik

We develop the hypothesis that the dynamics of a given system may lead to the activity being constricted to a subset of space, characterized by a fractal dimension smaller than the space dimension. We also address how the response function…

Let $A$ be a finite-dimensional algebra over a field $k$. We define $A$ to be $\mathbf{C}$-dichotomic if it has the dichotomy property of the representation type on complexes of projective $A$-modules. $\mathbf{C}$-dichotomy implies the…

表示论 · 数学 2025-12-09 Jie Li , Chao Zhang

Motivated by some algorithmic problems, we give lower bounds on the size of the multiplicative groups containing rational function images of low-dimensional affine subspaces of a finite field~$\mathbb{F}_{q^n}$ considered as a linear space…

数论 · 数学 2019-07-05 László Mérai

The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. The goal of this…

动力系统 · 数学 2018-02-26 Carlos Gustavo Moreira , Christian Mauduit

Courant's theorem implies that the number of nodal domains of a Laplace eigenfunction is controlled by the corresponding eigenvalue. Over the years, there have been various attempts to find an appropriate generalization of this statement in…

A canonical formalism and constraint analysis for discrete systems subject to a variational action principle are devised. The formalism is equivalent to the covariant formulation, encompasses global and local discrete time evolution moves…

数学物理 · 物理学 2013-09-17 Bianca Dittrich , Philipp A Hoehn

This paper studies a large class of continuous functions $f:[0,1]\to\mathbb{R}^d$ whose range is the attractor of an iterated function system $\{S_1,\dots,S_{m}\}$ consisting of similitudes. This class includes such classical examples as…

经典分析与常微分方程 · 数学 2018-12-12 Pieter C. Allaart

We consider a formal power series in one variable whose coefficients are holomorphic functions in a given multidimensional complex domain. Assume the following two conditions on the series. (C1) The restriction of the series at each point…

复变函数 · 数学 2025-09-09 Hiroki Aoki , Kyoji Saito

The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…

逻辑 · 数学 2019-03-14 Ivan Georgiev

We show a partial Boolean function $f$ together with an input $x\in f^{-1}\left(*\right)$ such that both $C_{\bar{0}}\left(f,x\right)$ and $C_{\bar{1}}\left(f,x\right)$ are at least $C\left(f\right)^{2-o\left(1\right)}$. Due to recent…

计算复杂性 · 计算机科学 2021-03-10 Kaspars Balodis

We consider a class of eigenvalue problems for poly-harmonic operators, including Dirichlet and buckling-type eigenvalue problems. We prove an analyticity result for the dependence of the symmetric functions of the eigenvalues upon domain…

谱理论 · 数学 2012-10-15 Davide Buoso , Pier Domenico Lamberti

A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set B of Boolean functions. We consider the problem of determining whether two given constraint…

计算复杂性 · 计算机科学 2007-05-23 E. Boehler , E. Hemaspaandra , Steffen Reith , Heribert Vollmer

Suppose q is a complex number of modulus one and different from 1,-1. Let O(R^2_q) be the *-algebra with two hermitean generators x and y satisfying the relation xy=qyx. Using operator representations of the *-algebra O(R^2_q) on Hilbert…

算子代数 · 数学 2016-09-07 Konrad Schmuedgen

The least concave majorant, $\hat F$, of a continuous function $F$ on a closed interval, $I$, is defined by \[ \hat F (x) = \inf \left\{ G(x): G \geq F, G \mbox{ concave}\right\},\; x \in I. \] We present here an algorithm, in the spirit of…

经典分析与常微分方程 · 数学 2022-01-20 Martin Franců , Ron Kerman , Gord Sinnamon

Denote the coefficients in the complex form of the Fourier series of a function $f$ on the interval $[-\pi, \pi)$ by $\hat f(n)$. It is known that if $p = 2j/(2j-1)$ for some integer $j>0$, then for each function $f$ in $L^p$ there exists…

泛函分析 · 数学 2021-12-28 John J. F. Fournier , Dean Vrecko
‹ 上一页 1 8 9 10 下一页 ›