Related papers: Partitions versus sets : a case of duality
For any given finite abelian group, we give factorizations of the group determinant in the group algebra of any subgroup. The factorizations are an extension of Dedekind's theorem. The extension leads to a generalization of Dedekind's…
We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…
We prove an elementary additive combinatorics inequality, which says that if $A$ is a subset of an Abelian group, which has, in some strong sense, large doubling, then the difference set A-A has a large subset, which has small doubling.
The q-deformation of the Lie algebras underlying the standard field theories leads to a pair of dual algebras. We describe a simple choice of possible field theories based on these derived algebras. One of these approximates the standard…
We introduce an object that has obvious similarity to the classical one - the algebra of supersymmetric polynomials. Despite the similarity, the known structure theorems on supersymmetric polynomials do not help in the study of the new…
I argue that, on a judicious reading of two existing criteria--one syntactic and the other semantic--dual theories can be taken to be empirically equivalent. The judicious reading is straightforward, but leads to the surprising conclusion…
We consider Proof Complexity in light of the unusual binary encoding of certain combinatorial principles. We contrast this Proof Complexity with the normal unary encoding in several refutation systems, based on Resolution and Integer Linear…
The decomposition of arbitrary unitary transformations into sequences of simpler, physically realizable operations is a foundational problem in quantum information science, quantum control, and linear optics. We establish a 1D Quantum Field…
For more than half a century, dualities have been at the heart of modern physics. From quantum mechanics to statistical mechanics, condensed matter physics, quantum field theory and quantum gravity, dualities have proven useful in solving…
Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize the abstract separation systems that have representations as…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
We prove a Ramsey theorem for finite sets equipped with a partial order and a fixed number of linear orders extending the partial order. This is a common generalization of two recent Ramsey theorems due to Soki\'c. As a bonus, our proof…
We show that cylindric partitions are in one-to-one correspondence with a pair which has an ordinary partition and a colored partition into distinct parts. Then, we show the general form of the generating function for cylindric partitions…
The theory of unified product and extending structures for alternative and pre-alternative algebras are developed. It is proved that the extending structures of these algebras can be classified by using some non-abelian cohomology and…
Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over…
We contemplate a higher-level bipolar abstract argumentation for non-elementary arguments such as: X argues against Ys sincerity with the fact that Y has presented his argument to draw a conclusion C, by omitting other facts which would not…
A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If we consider the objects as indivisible, many instances of the decision problem: ``Is there a fair division of the objects…
We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…
Lie systems form a class of systems of first-order ordinary differential equations whose general solutions can be described in terms of certain finite families of particular solutions and a set of constants, by means of a particular type of…
Unlike in the case of distinguishable particles, the concept of entanglement-- not to mention, nonlocality-- remains debated in case of indistinguishable particles. Here, we show that certain existing all-versus-nothing type of proofs of…