English
Related papers

Related papers: Every sum system is divisible

200 papers

This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…

Logic in Computer Science · Computer Science 2013-02-05 Giorgi Japaridze

The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…

Category Theory · Mathematics 2025-02-10 Ryan Reynolds

We prove the cyclic sum formulas for certain two-parameter multiple series. These are new and non-trivial generalizations of the cyclic sum formulas for multiple zeta values and multiple zeta-star values.

Number Theory · Mathematics 2022-06-03 Masahiro Igarashi

Given a sequence converging to zero, we consider the set of numbers which are sums of (infinite, finite, or empty) subsequences. When the original sequence is not absolutely summable, the subsum set is an unbounded closed interval which…

History and Overview · Mathematics 2013-07-09 Zbigniew Nitecki

We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…

Combinatorics · Mathematics 2020-09-23 Jakub Byszewski , Jakub Konieczny , Elżbieta Krawczyk

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik

Multivariate discrete probability laws are considered. We show that such laws are quasi-infinitely divisible if and only if their characteristic functions are separated from zero. We generalize the existing results for the univariate…

Probability · Mathematics 2023-03-08 I. A. Alexeev , A. A. Khartov

We extend the criterion of Kawatani and Okawa for indecomposability of the derived category of a smooth projective variety to arbitrary schemes. For relative schemes, we also give a criterion for the nonexistence of semiorthogonal…

Algebraic Geometry · Mathematics 2023-05-19 Ana Cristina López Martín , Fernando Sancho de Salas

Rowen and Saltman proved that every division algebra which is split by a dihedral extension of degree $2n$ of the center, $n$ odd, is in fact cyclic. The proof requires roots of unity of order $n$ in the center. We show that for $n=5$, this…

Rings and Algebras · Mathematics 2014-02-04 Eliyahu Matzri

The necessary and sufficient condition of separability of a mixed state of any systems is presented, which is practical in judging the separability of a mixed state. This paper also presents a method of finding the disentangled…

Quantum Physics · Physics 2009-11-07 Ping-Xing Chen , Lin-Mei Liang , Cheng-Zu Li , Ming-Qiu Huang

Let $X_0, X_1, ..., X_k$ with $k \in \IN\cup\{\infty\}$ be sequence spaces $($finite or infinite dimensional$)$ over $\IC$ or $\IR$ with absolute norms $N_i$ for $i = 0, ..., k$, $($i.e., with 1-unconditional bases$)$ such that $\dim X_0 =…

Functional Analysis · Mathematics 2009-09-25 Chi-Kwong Li , Beata Randrianantoanina

Explicit formulas involving a generalized Ramanujan sum are derived. An analogue of the prime number theorem is obtained and equivalences of the Riemann hypothesis are shown. Finally, explicit formulas of Bartz are generalized.

Number Theory · Mathematics 2015-04-02 Patrick Kühn , Nicolas Robles

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

Logic · Mathematics 2026-01-19 Joey Lakerdas-Gayle

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

Computational Complexity · Computer Science 2025-11-21 Srinivas Balaji Bollepalli

Given a finite abelian group $G$, consider the complete graph on the set of all elements of $G$. Find a Hamiltonian cycle in this graph and for each pair of consecutive vertices along the cycle compute their sum. What are the smallest and…

Combinatorics · Mathematics 2007-05-23 Vsevolod F. Lev

A permutation class $C$ is said to be splittable if there exist two proper subclasses $A, B \subsetneq C$ such that any $\sigma \in C$ can be red-blue colored so that the red (respectively, blue) subsequence of $\sigma$ is order isomorphic…

Combinatorics · Mathematics 2020-12-16 Rachel Zhang

Generalizing Krieger's finite generation theorem, we give conditions for an ergodic system to be generated by a pair of partitions, each required to be measurable with respect to a given sub-algebra, and also required to have a fixed size.

Dynamical Systems · Mathematics 2009-07-08 Nir Avni , Benjamin Weiss

We show that every sufficiently large $x\equiv 3(4)$ can be written as the sum of three primes, each of which is a sum of a square and a prime square. The main tools are a transference version of the circle method and various sieve related…

Number Theory · Mathematics 2022-10-19 Lasse Grimmelt

I prove two variants of the $ABC$ sum-product theorem for $\delta$-separated sets $A,B,C \subset [0,1]$ satisfying Katz-Tao spacing conditions. The main novelty is that the cardinality of the sets $B,C$ need not match their…

Combinatorics · Mathematics 2025-11-10 Tuomas Orponen

A product of compact normal spaces is normal; the product of a countably infinite collection of non-trivial spaces is normal if and only if it is countably paracompact and each of its finite sub-products is normal; if all powers of a space…

General Topology · Mathematics 2020-02-10 N. Noble