中文
相关论文

相关论文: Getting results with negative thinking

200 篇论文

Structured matrices with symbolic sizes appear frequently in the literature, especially in the description of algorithms for linear algebra. Recent work has treated these symbolic structured matrices themselves as computational objects,…

符号计算 · 计算机科学 2023-11-29 Mike Ghesquiere , Stephen M. Watt

Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…

组合数学 · 数学 2024-09-24 János Nagy , Péter Pál Pach

The proposed system of integer functions is logically fully independent from the traditional mathematical analysis of the real functions, but there is a well-defined mutual correspondence between the two disciplines. The system of integer…

综合数学 · 数学 2017-10-03 Jozsef Peredy

A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…

组合数学 · 数学 2007-05-23 Ethan M. Coven , William Geller , Sylvia Silberger , William P. Thurston

The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…

逻辑 · 数学 2021-11-30 Saeed Salehi

Given a countable graph, we say a set $A$ of its vertices is \emph{universal} if it contains every countable graph as an induced subgraph, and $A$ is \emph{weakly universal} if it contains every finite graph as an induced subgraph. We show…

组合数学 · 数学 2017-02-24 Will Brian

We propose the extension of the complex numbers to be the new domain where new concepts, like negative and imaginary probabilities, can be defined. The unit of the new space is defined as the solution of the unsolvable equation in the…

综合物理 · 物理学 2020-12-03 Israel Ariel González Medina

When developing and assessing density functional theory methods, a finite basis set is usually employed. In most cases, however, the issue of basis set dependency is neglected. Here, we assess several basis sets and functionals. In…

化学物理 · 物理学 2007-05-23 A. Daniel Boese , Jan M. L. Martin , Nicholas C. Handy

Binary multirelations generalise binary relations by associating elements of a set to its subsets. We study the structure and algebra of multirelations under the operations of union, intersection, sequential and parallel composition, as…

计算机科学中的逻辑 · 计算机科学 2015-06-16 Hitoshi Furusawa , Georg Struth

We consider a notion of "numerosity" for sets of tuples of natural numbers, that satisfies the five common notions of Euclid's Elements, so it can agree with cardinality only for finite sets. By suitably axiomatizing such a notion, we show…

逻辑 · 数学 2017-12-19 Marco Forti , Giuseppe Morana Roccasalvo

We introduce a natural class of functions, the {\em pseudomultipliers}, associated with a general Hilbert function space, prove an extension theorem which justifies the definition, give numerous examples and establish the nature of the…

泛函分析 · 数学 2016-09-06 James Agler , Nicholas John Young

We present a new approach to the problem of mutually unbiased bases (MUBs), based on positive definite functions on the unitary group. The method provides a new proof of the fact that there are at most $d+1$ MUBs in ${\mathbb C}^d$. It may…

量子物理 · 物理学 2016-12-30 Mihail N. Kolountzakis , Máté Matolcsi , Mihály Weiner

Many vision-related tasks benefit from reasoning over multiple modalities to leverage complementary views of data in an attempt to learn robust embedding spaces. Most deep learning-based methods rely on a late fusion technique whereby…

计算机视觉与模式识别 · 计算机科学 2020-03-04 Austin Reiter , Menglin Jia , Pu Yang , Ser-Nam Lim

We characterise non-distributive positive logic as the fragment of a single-sorted first-order language that is preserved by a new notion of simulation called a meet-simulation. Meet-simulations distinguish themselves from simulations…

逻辑 · 数学 2023-02-07 Jim de Groot

A positive definite even Hermitian lattice is called \emph{even universal} if it represents all even positive integers. We introduce a method to get all even universal binary Hermitian lattices over imaginary quadratic fields $\Q{-m}$ for…

数论 · 数学 2009-02-19 Byeong Moon Kim , Ji Young Kim , Poo-Sung Park

For any $m,n\in\mathbb{N}$ we first give new proofs for the following well known combinatorial identities \begin{equation*} S_n(m)=\sum\limits_{k=1}^n\binom{n}{k}\frac{(-1)^{k-1}}{k^m}=\sum\limits_{n\geq r_1\geq r_2\geq...\geq r_m\geq…

数论 · 数学 2017-03-21 Necdet Batir

A semigroup A is an abelian semigroup with identity 0. A set of positives in A is an ordered down-directed set P containing with every r an element r/2 with r/2 + r/2 = r. A continuity space is an abstract set X equipped with a map d : XxX…

一般拓扑 · 数学 2008-11-18 Fleischer Isidore , Giroux Gaston

In analogy with the 290-Theorem of Bhargava-Hanke, a criterion set is a finite subset $C$ of the totally positive integers in a given totally real number field such that if a quadratic form represents all elements of $C$, then it…

数论 · 数学 2026-05-27 Vitezslav Kala , Jakub Krásenský , Giuliano Romeo

We introduce axiomatically a Nonarchimedean field E, called the field of the Euclidean numbers, where a transfinite sum is defined that is indicized by ordinal numbers less than the first inaccessible {\Omega}. Thanks to this sum, E becomes…

逻辑 · 数学 2020-06-30 Vieri Benci , Marco Forti

All possible products of all elements of an odd order finite group are considered. A set of all such products is called as a K-set. A hypothesis of K-set coincidence of any group of an odd order with its commutant is proposed and the…

群论 · 数学 2007-05-23 V. V. Genk