中文
相关论文

相关论文: On the Chen Conjecture regarding the complexity of…

200 篇论文

The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…

计算复杂性 · 计算机科学 2025-02-04 Prerona Chatterjee , Mrinal Kumar , C Ramya , Ramprasad Saptharishi , Anamay Tengse

We show a number of fine-grained hardness results for the Closest Vector Problem in the $\ell_p$ norm ($\mathrm{CVP}_p$), and its approximate and non-uniform variants. First, we show that $\mathrm{CVP}_p$ cannot be solved in…

计算复杂性 · 计算机科学 2021-08-10 Divesh Aggarwal , Huck Bennett , Alexander Golovnev , Noah Stephens-Davidowitz

We investigate properties of varieties of algebras described by a novel concept of equation that we call \emph{commutator equation}. A commutator equation is a relaxation of the standard term equality obtained substituting the equality…

环与代数 · 数学 2023-10-04 Stefano Fioravanti

In [7] we proposed a non-generational conjectural derivation of all first class constraints (involving, only, variables compatible with canonical Poisson brackets) for realistic gauge (singular) field theories; and we verified the…

数学物理 · 物理学 2009-10-05 K. Rasem Qandalji

We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let $k$ and $s$ be positive integers and let $G$ be a graph. Then $G$ is said - $\mathbf{W_k}$ if for any $k$ pairwise disjoint…

组合数学 · 数学 2024-04-12 Carl Feghali , Malory Marin , Rémi Watrigant

A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective…

计算复杂性 · 计算机科学 2019-04-23 Vladimir Kolmogorov

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic. Using methods from ergodic theory, we are able to partially resolve this…

数论 · 数学 2020-04-01 Jakub Byszewski , Jakub Konieczny

Let gamma be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in gamma is in Logspace or complete for the class CSP(gamma)_NP under…

计算复杂性 · 计算机科学 2011-01-13 Manuel Bodirsky , Miki Hermann , Florian Richoux

Working over an infinite field of positive characteristic, an upper bound is given for the nilpotency index of a finitely generated nil algebra of bounded nil index $n$ in terms of the maximal degree in a minimal homogenous generating…

环与代数 · 数学 2018-08-08 M. Domokos

A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…

组合数学 · 数学 2019-12-03 Cara Monical , Neriman Tokcan , Alexander Yong

We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method…

计算机科学中的逻辑 · 计算机科学 2020-04-07 Krishnendu Chatterjee , Hongfei Fu , Amir Kafshdar Goharshady , Ehsan Kafshdar Goharshady

Amalgamation SNP (ASNP) is a fragment of existential second-order logic that strictly contains binary connected MMSNP of Feder and Vardi and binary guarded monotone SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate…

计算机科学中的逻辑 · 计算机科学 2020-01-29 Manuel Bodirsky , Simon Knäuer , Florian Starke

Given a satisfiable instance of 1-in-3 SAT, it is NP-hard to find a satisfying assignment for it, but it may be possible to efficiently find a solution subject to a weaker (not necessarily Boolean) predicate than `1-in-3'. There is a…

计算复杂性 · 计算机科学 2025-08-21 Andrei Krokhin , Danny Vagnozzi

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

数论 · 数学 2016-03-29 Andreas O. Bender , Olivier Wittenberg

The rapid development of q-calculus has led to the discovery of new generalizations of Bernstein polynomials and Genocchi polynomials involving q-integers. The present paper deals with weighted q-Bernstein polynomials and q-Genocchi numbers…

数论 · 数学 2019-07-04 Serkan Araci , Mehmet Acikgoz

We consider the equation $P(Q(x_1,\ldots,x_\nu))=Q(P(x_1),\ldots,P(x_\nu))$ in polynomials over the field of complex numbers and prove that if ${\rm deg}(P)>1$, then it is only solvable in polynomials that are affinely conjugate to…

数论 · 数学 2024-12-17 Arseny Mingajev

Let $F$ be a totally real number field. Dasgupta conjectured an explicit $p$-adic analytic formula for the Gross-Stark units of $F$. In a later paper, Dasgupta-Spiess conjectured a cohomological formula for the principal minors and the…

数论 · 数学 2025-12-18 Matthew H. L. Honnor

In this paper we make a series of numerical experiments to support Greenberg's $p$-rationality conjecture, we present a family of $p$-rational biquadratic fields and we find new examples of $p$-rational multiquadratic fields. In the case of…

数论 · 数学 2019-12-20 Razvan Barbulescu , Jishnu Ray

In 2021, Chen proved a congruence for the degree of a certain map on the space of covers of elliptic curves. He concluded as a corollary that the size of any connected component of the Markoff mod $p$ graph is divisible by $p$. In…

数论 · 数学 2025-02-25 Daniel E. Martin

We formulate a number of related generalisations of the weight part of Serre's conjecture to the case of GL(n) over an arbitrary number field, motivated by the formalism of the Breuil-M\'ezard conjecture. We give evidence for these…

数论 · 数学 2021-03-29 Toby Gee , Florian Herzig , David Savitt
‹ 上一页 1 8 9 10 下一页 ›